./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/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_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/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-aa41828 [2018-11-22 22:53:06,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:53:06,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:53:06,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:53:06,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:53:06,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:53:06,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:53:06,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:53:06,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:53:06,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:53:06,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:53:06,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:53:06,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:53:06,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:53:06,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:53:06,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:53:06,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:53:06,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:53:06,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:53:06,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:53:06,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:53:06,800 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:53:06,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:53:06,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:53:06,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:53:06,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:53:06,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:53:06,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:53:06,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:53:06,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:53:06,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:53:06,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:53:06,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:53:06,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:53:06,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:53:06,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:53:06,807 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:53:06,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:53:06,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:53:06,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:53:06,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:53:06,820 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:53:06,820 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:53:06,820 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:53:06,820 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:53:06,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:53:06,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:53:06,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:53:06,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:53:06,823 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:53:06,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:53:06,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:53:06,823 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:53:06,824 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:53:06,824 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_51190459-86ba-496a-9609-096261fd6211/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-11-22 22:53:06,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:53:06,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:53:06,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:53:06,855 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:53:06,855 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:53:06,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-22 22:53:06,891 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/data/366f633f1/905939be9e0a41478ba9c337234e4dad/FLAG30687b3f9 [2018-11-22 22:53:07,327 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:53:07,328 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-22 22:53:07,335 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/data/366f633f1/905939be9e0a41478ba9c337234e4dad/FLAG30687b3f9 [2018-11-22 22:53:07,344 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/data/366f633f1/905939be9e0a41478ba9c337234e4dad [2018-11-22 22:53:07,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:53:07,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:53:07,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:53:07,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:53:07,350 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:53:07,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4625e0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07, skipping insertion in model container [2018-11-22 22:53:07,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:53:07,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:53:07,566 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:53:07,575 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:53:07,646 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:53:07,680 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:53:07,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07 WrapperNode [2018-11-22 22:53:07,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:53:07,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:53:07,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:53:07,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:53:07,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:53:07,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:53:07,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:53:07,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:53:07,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... [2018-11-22 22:53:07,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:53:07,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:53:07,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:53:07,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:53:07,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/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-22 22:53:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:53:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:53:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 22:53:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 22:53:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure new_lseg [2018-11-22 22:53:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure new_lseg [2018-11-22 22:53:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:53:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:53:07,935 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:53:07,935 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-22 22:53:07,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:53:07 BoogieIcfgContainer [2018-11-22 22:53:07,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:53:07,936 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:53:07,936 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:53:07,939 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:53:07,940 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:53:07,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:53:07" (1/3) ... [2018-11-22 22:53:07,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33f3c1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:53:07, skipping insertion in model container [2018-11-22 22:53:07,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:53:07,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:53:07" (2/3) ... [2018-11-22 22:53:07,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33f3c1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:53:07, skipping insertion in model container [2018-11-22 22:53:07,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:53:07,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:53:07" (3/3) ... [2018-11-22 22:53:07,943 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_by_lseg_traverse-alloca_false-termination.c.i [2018-11-22 22:53:07,993 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:53:07,994 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:53:07,994 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:53:07,994 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:53:07,994 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:53:07,995 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:53:07,995 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:53:07,995 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:53:07,995 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:53:08,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-22 22:53:08,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:53:08,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:53:08,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:53:08,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:53:08,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:53:08,038 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:53:08,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-22 22:53:08,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:53:08,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:53:08,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:53:08,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:53:08,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:53:08,047 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-11-22 22:53:08,047 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-11-22 22:53:08,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2018-11-22 22:53:08,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:53:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:53:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:53:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:08,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 57729, now seen corresponding path program 1 times [2018-11-22 22:53:08,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:53:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:53:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:53:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:08,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1807633698, now seen corresponding path program 1 times [2018-11-22 22:53:08,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:53:08,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:53:08,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:08,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:53:08,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:08,348 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-11-22 22:53:08,648 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2018-11-22 22:53:08,830 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:53:08,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:53:08,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:53:08,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:53:08,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:53:08,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:53:08,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:53:08,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:53:08,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_by_lseg_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-22 22:53:08,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:53:08,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:53:08,852 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-22 22:53:08,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-11-22 22:53:08,858 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-22 22:53:08,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-11-22 22:53:08,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-11-22 22:53:08,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-11-22 22:53:08,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-11-22 22:53:08,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-11-22 22:53:08,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-11-22 22:53:08,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-11-22 22:53:08,889 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-22 22:53:08,890 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-22 22:53:08,892 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-22 22:53:08,893 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-22 22:53:08,894 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-22 22:53:08,895 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-22 22:53:08,898 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-22 22:53:08,899 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-22 22:53:08,958 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-22 22:53:08,960 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-22 22:53:08,961 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-22 22:53:08,962 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-22 22:53:08,964 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-22 22:53:08,965 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-22 22:53:08,967 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-22 22:53:08,968 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-22 22:53:08,970 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-22 22:53:08,971 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-22 22:53:08,972 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-22 22:53:08,977 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-22 22:53:08,979 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-22 22:53:08,981 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-22 22:53:08,983 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-22 22:53:08,984 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-22 22:53:08,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:53:08,997 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-22 22:53:09,193 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:53:09,196 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:53:09,198 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-22 22:53:09,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,204 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-22 22:53:09,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,206 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-22 22:53:09,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,208 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-22 22:53:09,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,210 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-22 22:53:09,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,213 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-22 22:53:09,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,215 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-22 22:53:09,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,216 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-22 22:53:09,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,218 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-22 22:53:09,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,219 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-22 22:53:09,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,220 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-22 22:53:09,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,222 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-22 22:53:09,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,223 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-22 22:53:09,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:53:09,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,226 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-22 22:53:09,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,230 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-22 22:53:09,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:53:09,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:53:09,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,235 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-22 22:53:09,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:53:09,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:53:09,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:53:09,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,241 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-22 22:53:09,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:53:09,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:53:09,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,253 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-22 22:53:09,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:53:09,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:53:09,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,261 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-22 22:53:09,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,261 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:53:09,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:53:09,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:53:09,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:53:09,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:53:09,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:53:09,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:53:09,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:53:09,280 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-22 22:53:09,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:53:09,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:53:09,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:53:09,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:53:09,286 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-22 22:53:09,286 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 22:53:09,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:53:09,360 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:53:09,361 INFO L444 ModelExtractionUtils]: 17 out of 21 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:53:09,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:53:09,365 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-22 22:53:09,366 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:53:09,366 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-11-22 22:53:09,385 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-22 22:53:09,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:53:09,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:53:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:53:09,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:53:09,466 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-22 22:53:09,476 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-22 22:53:09,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 5 states. [2018-11-22 22:53:09,570 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-11-22 22:53:09,571 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-11-22 22:53:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:53:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-22 22:53:09,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-22 22:53:09,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:53:09,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-22 22:53:09,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:53:09,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-22 22:53:09,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:53:09,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2018-11-22 22:53:09,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 22:53:09,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 27 transitions. [2018-11-22 22:53:09,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-22 22:53:09,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 22:53:09,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-22 22:53:09,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:53:09,583 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-22 22:53:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-22 22:53:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-22 22:53:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 22:53:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-22 22:53:09,602 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 22:53:09,602 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 22:53:09,602 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:53:09,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-22 22:53:09,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-22 22:53:09,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:53:09,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:53:09,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:53:09,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-22 22:53:09,604 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-11-22 22:53:09,604 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-11-22 22:53:09,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:09,604 INFO L82 PathProgramCache]: Analyzing trace with hash 914562823, now seen corresponding path program 1 times [2018-11-22 22:53:09,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:53:09,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:53:09,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:09,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:53:09,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:09,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2018-11-22 22:53:09,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:53:09,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:53:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:09,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:53:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:09,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:53:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1713323539, now seen corresponding path program 1 times [2018-11-22 22:53:09,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:53:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:53:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:53:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:53:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:53:10,121 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 139 [2018-11-22 22:53:10,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:53:10,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:53:10,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:53:10,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:53:10,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:53:10,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:136 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] 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; [?] 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); [?] CALL 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); [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := ~p.base, ~p.offset; [?] assume true; [?] RET #37#return; [?] 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; [?] 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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; [L565] COND TRUE curr != ((void *)0) [L566] EXPR curr->next [L566] curr = curr->next ----- [2018-11-22 22:53:10,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:53:10 BoogieIcfgContainer [2018-11-22 22:53:10,311 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:53:10,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:53:10,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:53:10,311 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:53:10,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:53:07" (3/4) ... [2018-11-22 22:53:10,314 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] 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; [?] 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); [?] CALL 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); [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := ~p.base, ~p.offset; [?] assume true; [?] RET #37#return; [?] 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; [?] 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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; [L565] COND TRUE curr != ((void *)0) [L566] EXPR curr->next [L566] curr = curr->next ----- [2018-11-22 22:53:10,357 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_51190459-86ba-496a-9609-096261fd6211/bin-2019/uautomizer/witness.graphml [2018-11-22 22:53:10,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:53:10,357 INFO L168 Benchmark]: Toolchain (without parser) took 3010.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 957.6 MB in the beginning and 919.0 MB in the end (delta: 38.6 MB). Peak memory consumption was 202.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:53:10,358 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:53:10,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -195.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:53:10,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:53:10,360 INFO L168 Benchmark]: Boogie Preprocessor took 20.88 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-22 22:53:10,360 INFO L168 Benchmark]: RCFGBuilder took 202.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:53:10,360 INFO L168 Benchmark]: BuchiAutomizer took 2374.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.2 MB in the end (delta: 201.0 MB). Peak memory consumption was 201.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:53:10,361 INFO L168 Benchmark]: Witness Printer took 46.01 ms. Allocated memory is still 1.2 GB. Free memory was 924.2 MB in the beginning and 919.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:53:10,364 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -195.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.88 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 202.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2374.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.2 MB in the end (delta: 201.0 MB). Peak memory consumption was 201.0 MB. Max. memory is 11.5 GB. * Witness Printer took 46.01 ms. Allocated memory is still 1.2 GB. Free memory was 924.2 MB in the beginning and 919.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 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.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. 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: 85ms 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@5bf9e140=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2044b26f=0, curr=2, \result=0, x=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@138a5e48=0, x=2, \old(n)=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ab4a13=0, x=2, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bf9e140=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e0f83a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ab4a13=2, n=1, head=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e0f83a6=0, NULL=0, n=1, \result=2, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2044b26f=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 565]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] 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; [?] 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); [?] CALL 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); [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := ~p.base, ~p.offset; [?] assume true; [?] RET #37#return; [?] 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; [?] 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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; [L565] COND TRUE curr != ((void *)0) [L566] EXPR curr->next [L566] curr = curr->next ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] 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; [?] 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); [?] CALL 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); [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset;~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := ~p.base, ~p.offset; [?] assume true; [?] RET #37#return; [?] 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; [?] 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; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] 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; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572-L574] assume !(main_~n~0 < 1); [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res.base, new_cll_#res.offset; [L575] 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; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] call new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset := #Ultimate.alloc(12); [L557] new_cll_~x~1.base, new_cll_~x~1.offset := new_cll_#t~malloc4.base, new_cll_#t~malloc4.offset; [L558] call write~int(new_cll_~n, new_cll_~x~1.base, new_cll_~x~1.offset, 4); [L559] CALL 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); [L546-L554] ~p.base, ~p.offset := #in~p.base, #in~p.offset; [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := ~p.base, ~p.offset; [L546-L554] ensures true; [L559] RET 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); [L559] 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); [L559] havoc new_cll_#t~ret5.base, new_cll_#t~ret5.offset; [L560] new_cll_#res.base, new_cll_#res.offset := new_cll_~x~1.base, new_cll_~x~1.offset; [L575] main_#t~ret8.base, main_#t~ret8.offset := new_cll_#res.base, new_cll_#res.offset; [L575] main_~x~2.base, main_~x~2.offset := main_#t~ret8.base, main_#t~ret8.offset; [L575] havoc main_#t~ret8.base, main_#t~ret8.offset; [L576] traverse_#in~head.base, traverse_#in~head.offset := main_~x~2.base, main_~x~2.offset; [L576] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~0.base, traverse_~curr~0.offset; [L562-L568] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L564] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~x~2; [L571] main_~n~0 := main_#t~nondet7; [L571] havoc main_#t~nondet7; [L572] COND FALSE !(main_~n~0 < 1) [L575] new_cll_#in~n := main_~n~0; [L575] havoc new_cll_#res; [L575] havoc new_cll_#t~malloc4, new_cll_#t~ret5, new_cll_~n, new_cll_~x~1; [L555-L561] new_cll_~n := new_cll_#in~n; [L557] FCALL call new_cll_#t~malloc4 := #Ultimate.alloc(12); [L557] new_cll_~x~1 := new_cll_#t~malloc4; [L558] FCALL call write~int(new_cll_~n, { base: new_cll_~x~1!base, offset: new_cll_~x~1!offset }, 4); [L559] CALL call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call new_cll_#t~ret5 := new_lseg(new_cll_~x~1, new_cll_~n - 1); [L559] FCALL call write~$Pointer$(new_cll_#t~ret5, { base: new_cll_~x~1!base, offset: 4 + new_cll_~x~1!offset }, 8); [L559] havoc new_cll_#t~ret5; [L560] new_cll_#res := new_cll_~x~1; [L575] main_#t~ret8 := new_cll_#res; [L575] main_~x~2 := main_#t~ret8; [L575] havoc main_#t~ret8; [L576] traverse_#in~head := main_~x~2; [L576] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~0; [L562-L568] traverse_~head := traverse_#in~head; [L564] traverse_~curr~0 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L571] ~n~0 := #t~nondet7; [L571] havoc #t~nondet7; [L572] COND FALSE !(~n~0 < 1) [L555-L561] ~n := #in~n; [L557] FCALL call #t~malloc4 := #Ultimate.alloc(12); [L557] ~x~1 := #t~malloc4; [L558] FCALL call write~int(~n, { base: ~x~1!base, offset: ~x~1!offset }, 4); [L559] CALL call #t~ret5 := new_lseg(~x~1, ~n - 1); [L546-L554] ~p := #in~p; [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := ~p; [L559] RET call #t~ret5 := new_lseg(~x~1, ~n - 1); [L559] FCALL call write~$Pointer$(#t~ret5, { base: ~x~1!base, offset: 4 + ~x~1!offset }, 8); [L559] havoc #t~ret5; [L560] #res := ~x~1; [L575] ~x~2 := #t~ret8; [L575] havoc #t~ret8; [L562-L568] ~head := #in~head; [L564] ~curr~0 := ~head; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L565-L567] assume !!(traverse_~curr~0.base != 0 || traverse_~curr~0.offset != 0); [L566] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~0.base, 4 + traverse_~curr~0.offset, 8); [L566] traverse_~curr~0.base, traverse_~curr~0.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L566] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L565-L567] COND FALSE !(!(traverse_~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~0!base, offset: 4 + traverse_~curr~0!offset }, 8); [L566] traverse_~curr~0 := traverse_#t~mem6; [L566] havoc traverse_#t~mem6; [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L565-L567] COND FALSE !(!(~curr~0 != { base: 0, offset: 0 })) [L566] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L566] ~curr~0 := #t~mem6; [L566] havoc #t~mem6; [L565] COND TRUE curr != ((void *)0) [L566] EXPR curr->next [L566] curr = curr->next ----- 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...