./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/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 65da722a2ea59f5974c3b0082ca57aa0ffbedb9a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 06:29:53,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:29:53,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:29:53,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:29:53,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:29:53,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:29:53,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:29:53,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:29:53,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:29:53,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:29:53,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:29:53,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:29:53,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:29:53,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:29:53,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:29:53,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:29:53,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:29:53,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:29:53,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:29:53,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:29:53,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:29:53,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:29:53,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:29:53,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:29:53,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:29:53,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:29:53,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:29:53,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:29:53,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:29:53,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:29:53,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:29:53,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:29:53,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:29:53,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:29:53,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:29:53,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:29:53,804 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 06:29:53,812 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:29:53,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:29:53,813 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 06:29:53,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 06:29:53,813 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 06:29:53,813 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 06:29:53,813 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 06:29:53,813 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 06:29:53,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 06:29:53,814 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 06:29:53,815 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 06:29:53,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:29:53,815 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:29:53,815 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 06:29:53,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:29:53,815 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 06:29:53,815 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 06:29:53,816 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 06:29:53,816 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_fed87bef-43a6-40f2-94bd-d82b582f3f34/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 -> 65da722a2ea59f5974c3b0082ca57aa0ffbedb9a [2018-12-09 06:29:53,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:29:53,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:29:53,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:29:53,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:29:53,846 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:29:53,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-12-09 06:29:53,883 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/data/200d371ca/9bc2d58e44ec49bfa137e56e46fd9d42/FLAGdf5b138bd [2018-12-09 06:29:54,222 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:29:54,222 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-12-09 06:29:54,228 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/data/200d371ca/9bc2d58e44ec49bfa137e56e46fd9d42/FLAGdf5b138bd [2018-12-09 06:29:54,612 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/data/200d371ca/9bc2d58e44ec49bfa137e56e46fd9d42 [2018-12-09 06:29:54,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:29:54,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:29:54,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:29:54,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:29:54,620 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:29:54,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f79a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54, skipping insertion in model container [2018-12-09 06:29:54,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:29:54,651 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:29:54,791 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:29:54,797 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:29:54,856 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:29:54,877 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:29:54,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54 WrapperNode [2018-12-09 06:29:54,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:29:54,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:29:54,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:29:54,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:29:54,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:29:54,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:29:54,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:29:54,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:29:54,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... [2018-12-09 06:29:54,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:29:54,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:29:54,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:29:54,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:29:54,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 06:29:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 06:29:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 06:29:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 06:29:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure new_lseg [2018-12-09 06:29:54,950 INFO L138 BoogieDeclarations]: Found implementation of procedure new_lseg [2018-12-09 06:29:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:29:54,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:29:55,078 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:29:55,078 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-09 06:29:55,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:55 BoogieIcfgContainer [2018-12-09 06:29:55,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:29:55,079 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 06:29:55,079 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 06:29:55,082 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 06:29:55,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:29:55,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 06:29:54" (1/3) ... [2018-12-09 06:29:55,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d25dae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:29:55, skipping insertion in model container [2018-12-09 06:29:55,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:29:55,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:29:54" (2/3) ... [2018-12-09 06:29:55,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d25dae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 06:29:55, skipping insertion in model container [2018-12-09 06:29:55,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 06:29:55,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:55" (3/3) ... [2018-12-09 06:29:55,084 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_by_lseg_traverse-alloca_false-termination.c.i [2018-12-09 06:29:55,116 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 06:29:55,116 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 06:29:55,116 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 06:29:55,116 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 06:29:55,116 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:29:55,117 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:29:55,117 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 06:29:55,117 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:29:55,117 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 06:29:55,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-09 06:29:55,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 06:29:55,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:55,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:55,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 06:29:55,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 06:29:55,148 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 06:29:55,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-09 06:29:55,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 06:29:55,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:55,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:55,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 06:29:55,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 06:29:55,154 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~x~2.base, main_~x~2.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 12#L572true assume !(main_~n~0 < 1);new_cll_#in~n := main_~n~0;havoc new_cll_#res.base, new_cll_#res.offset;havoc new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset, new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset;new_cll_~n := new_cll_#in~n;call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12);new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset;call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); 18#L559true call new_cll_#t~ret5.base, new_cll_#t~ret5.offset := new_lseg(new_cll_~x~1.base, new_cll_~x~1.offset, new_cll_~n - 1);< 14#new_lsegENTRYtrue [2018-12-09 06:29:55,155 INFO L796 eck$LassoCheckResult]: Loop: 14#new_lsegENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; 10#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~x~0.base, ~x~0.offset, 4); 15#L552true call #t~ret3.base, #t~ret3.offset := new_lseg(~p.base, ~p.offset, ~n - 1);< 14#new_lsegENTRYtrue [2018-12-09 06:29:55,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2018-12-09 06:29:55,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:55,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:55,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:55,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:55,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:55,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash 57729, now seen corresponding path program 1 times [2018-12-09 06:29:55,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:55,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:55,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:55,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:55,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1807633698, now seen corresponding path program 1 times [2018-12-09 06:29:55,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:55,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:55,410 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-09 06:29:55,673 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2018-12-09 06:29:55,829 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 06:29:55,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 06:29:55,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 06:29:55,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 06:29:55,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 06:29:55,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 06:29:55,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 06:29:55,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 06:29:55,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_by_lseg_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-12-09 06:29:55,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 06:29:55,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 06:29:55,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:55,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 06:29:56,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 06:29:56,129 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 06:29:56,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:56,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:56,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 06:29:56,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 06:29:56,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 06:29:56,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:56,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:56,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:56,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:56,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,185 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 06:29:56,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 06:29:56,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:56,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 06:29:56,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 06:29:56,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 06:29:56,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 06:29:56,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 06:29:56,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 06:29:56,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 06:29:56,200 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 06:29:56,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 06:29:56,204 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 06:29:56,204 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 06:29:56,245 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 06:29:56,258 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 06:29:56,258 INFO L444 ModelExtractionUtils]: 16 out of 21 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 06:29:56,260 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 06:29:56,262 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-12-09 06:29:56,262 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 06:29:56,262 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_lseg_#in~n) = 1*new_lseg_#in~n Supporting invariants [1*new_lseg_#in~n >= 0] [2018-12-09 06:29:56,268 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-12-09 06:29:56,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:56,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:29:56,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 06:29:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:29:56,371 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-12-09 06:29:56,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 5 states. [2018-12-09 06:29:56,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 5 states. Result 35 states and 41 transitions. Complement of second has 13 states. [2018-12-09 06:29:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 06:29:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 06:29:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-09 06:29:56,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-12-09 06:29:56,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:56,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-09 06:29:56,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:56,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-09 06:29:56,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 06:29:56,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2018-12-09 06:29:56,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 06:29:56,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 27 transitions. [2018-12-09 06:29:56,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 06:29:56,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 06:29:56,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-09 06:29:56,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 06:29:56,484 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 06:29:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-09 06:29:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-09 06:29:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 06:29:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 06:29:56,502 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 06:29:56,502 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 06:29:56,502 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 06:29:56,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-09 06:29:56,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-09 06:29:56,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 06:29:56,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 06:29:56,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:29:56,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-09 06:29:56,504 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~x~2.base, main_~x~2.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 131#L572 assume !(main_~n~0 < 1);new_cll_#in~n := main_~n~0;havoc new_cll_#res.base, new_cll_#res.offset;havoc new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset, new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset;new_cll_~n := new_cll_#in~n;call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12);new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset;call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); 136#L559 call new_cll_#t~ret5.base, new_cll_#t~ret5.offset := new_lseg(new_cll_~x~1.base, new_cll_~x~1.offset, new_cll_~n - 1);< 137#new_lsegENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; 138#L548 assume 0 == ~n;#res.base, #res.offset := ~p.base, ~p.offset; 143#new_lsegFINAL assume true; 141#new_lsegEXIT >#37#return; 127#L559-1 call write~$Pointer$(new_cll_#t~ret5.base, new_cll_#t~ret5.offset, new_cll_~x~1.base, 4 + new_cll_~x~1.offset, 8);havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset;new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; 128#L560 main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset;main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; 133#L565-2 [2018-12-09 06:29:56,504 INFO L796 eck$LassoCheckResult]: Loop: 133#L565-2 assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8);traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 133#L565-2 [2018-12-09 06:29:56,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash 914562823, now seen corresponding path program 1 times [2018-12-09 06:29:56,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:56,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:56,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2018-12-09 06:29:56,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:56,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:29:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1713323539, now seen corresponding path program 1 times [2018-12-09 06:29:56,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:29:56,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:29:56,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:29:56,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:29:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 06:29:57,021 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 141 [2018-12-09 06:29:57,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:29:57,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:29:57,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:29:57,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 06:29:57,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 06:29:57,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:136 [2018-12-09 06:29:57,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 06:29:57 BoogieIcfgContainer [2018-12-09 06:29:57,201 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 06:29:57,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:29:57,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:29:57,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:29:57,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:29:55" (3/4) ... [2018-12-09 06:29:57,204 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 06:29:57,229 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fed87bef-43a6-40f2-94bd-d82b582f3f34/bin-2019/uautomizer/witness.graphml [2018-12-09 06:29:57,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:29:57,230 INFO L168 Benchmark]: Toolchain (without parser) took 2614.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -68.2 MB). Peak memory consumption was 152.0 MB. Max. memory is 11.5 GB. [2018-12-09 06:29:57,231 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:29:57,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 06:29:57,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.13 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-12-09 06:29:57,231 INFO L168 Benchmark]: Boogie Preprocessor took 15.14 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-09 06:29:57,232 INFO L168 Benchmark]: RCFGBuilder took 161.58 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-09 06:29:57,232 INFO L168 Benchmark]: BuchiAutomizer took 2121.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.8 MB). Peak memory consumption was 151.5 MB. Max. memory is 11.5 GB. [2018-12-09 06:29:57,233 INFO L168 Benchmark]: Witness Printer took 28.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-12-09 06:29:57,235 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.14 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.58 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2121.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.8 MB). Peak memory consumption was 151.5 MB. Max. memory is 11.5 GB. * Witness Printer took 28.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. The remainder module has 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 11 SDslu, 7 SDs, 0 SdLazy, 18 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital191 mio100 ax100 hnf100 lsp93 ukn43 mio100 lsp32 div100 bol100 ite100 ukn100 eq196 hnf91 smp100 dnf139 smp100 tf100 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 62ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 565]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@119b43c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@719fb92b=0, curr=2, \result=0, x=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c938aa7=0, x=2, \old(n)=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45a21b4b=0, x=2, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@119b43c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62387487=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45a21b4b=2, n=1, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62387487=0, NULL=0, n=1, \result=2, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@719fb92b=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 565]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L571] int n = __VERIFIER_nondet_int(); [L572] COND FALSE !(n < 1) [L557] node_t* x = malloc(sizeof(node_t)); [L558] x->val = n [L559] CALL, EXPR new_lseg(x,n-1) [L548] COND TRUE n==0 [L549] return p; [L559] RET, EXPR new_lseg(x,n-1) [L559] x->next = new_lseg(x,n-1) [L560] return x; [L575] node_t* x = new_cll(n); [L564] node_t* curr = head; Loop: [L565] COND TRUE curr != ((void *)0) [L566] EXPR curr->next [L566] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...