./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/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 34137da927ca86d2fb49adf8270ebc903b8c1dbe ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 12:04:08,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:04:08,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:04:08,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:04:08,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:04:08,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:04:08,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:04:08,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:04:08,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:04:08,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:04:08,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:04:08,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:04:08,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:04:08,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:04:08,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:04:08,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:04:08,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:04:08,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:04:08,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:04:08,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:04:08,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:04:08,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:04:08,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:04:08,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:04:08,415 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:04:08,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:04:08,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:04:08,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:04:08,417 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:04:08,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:04:08,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:04:08,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:04:08,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:04:08,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:04:08,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:04:08,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:04:08,422 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:04:08,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:04:08,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:04:08,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:04:08,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:04:08,451 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:04:08,452 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:04:08,452 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:04:08,452 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:04:08,452 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:04:08,452 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:04:08,452 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:04:08,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:04:08,468 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:04:08,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:04:08,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:04:08,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:04:08,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:04:08,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:04:08,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:04:08,469 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:04:08,469 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:04:08,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:04:08,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:04:08,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:04:08,469 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:04:08,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:04:08,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:04:08,470 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:04:08,471 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:04:08,471 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_dc44c9b4-7610-4168-bc5a-1533b745e734/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 -> 34137da927ca86d2fb49adf8270ebc903b8c1dbe [2018-11-18 12:04:08,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:04:08,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:04:08,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:04:08,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:04:08,528 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:04:08,529 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2018-11-18 12:04:08,576 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/data/a506528e3/7f993f4f6d55448d8a5d6d8a04126bb5/FLAG65bd56480 [2018-11-18 12:04:09,028 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:04:09,031 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2018-11-18 12:04:09,044 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/data/a506528e3/7f993f4f6d55448d8a5d6d8a04126bb5/FLAG65bd56480 [2018-11-18 12:04:09,550 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/data/a506528e3/7f993f4f6d55448d8a5d6d8a04126bb5 [2018-11-18 12:04:09,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:04:09,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:04:09,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:04:09,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:04:09,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:04:09,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0789ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09, skipping insertion in model container [2018-11-18 12:04:09,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:04:09,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:04:09,809 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:04:09,816 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:04:09,850 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:04:09,922 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:04:09,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09 WrapperNode [2018-11-18 12:04:09,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:04:09,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:04:09,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:04:09,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:04:09,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:04:09,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:04:09,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:04:09,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:04:09,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... [2018-11-18 12:04:09,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:04:09,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:04:09,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:04:09,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:04:09,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/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-18 12:04:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:04:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:04:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:04:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:04:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:04:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:04:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:04:10,197 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:04:10,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:04:10 BoogieIcfgContainer [2018-11-18 12:04:10,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:04:10,198 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:04:10,198 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:04:10,201 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:04:10,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:04:10,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:04:09" (1/3) ... [2018-11-18 12:04:10,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eb98fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:04:10, skipping insertion in model container [2018-11-18 12:04:10,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:04:10,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:09" (2/3) ... [2018-11-18 12:04:10,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eb98fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:04:10, skipping insertion in model container [2018-11-18 12:04:10,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:04:10,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:04:10" (3/3) ... [2018-11-18 12:04:10,205 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca_false-termination.c.i [2018-11-18 12:04:10,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:04:10,240 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:04:10,240 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:04:10,240 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:04:10,240 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:04:10,240 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:04:10,240 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:04:10,240 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:04:10,240 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:04:10,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 12:04:10,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:04:10,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:04:10,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:04:10,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:04:10,272 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:04:10,272 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:04:10,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 12:04:10,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:04:10,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:04:10,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:04:10,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:04:10,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:04:10,279 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;assume { :begin_inline_init_cll } true;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 3#L552-4true [2018-11-18 12:04:10,279 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 10#L552-1true assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.alloc(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 15#L552-3true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 3#L552-4true [2018-11-18 12:04:10,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:04:10,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:10,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:10,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:10,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 12:04:10,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:10,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 12:04:10,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:10,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:10,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:10,572 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-18 12:04:10,768 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:04:10,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:04:10,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:04:10,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:04:10,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:04:10,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:04:10,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:04:10,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:04:10,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-18 12:04:10,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:04:10,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:04:10,784 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-18 12:04:10,788 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-18 12:04:10,953 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-18 12:04:10,955 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-18 12:04:10,956 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-18 12:04:10,957 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-18 12:04:10,959 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-18 12:04:10,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-18 12:04:10,963 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-18 12:04:10,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-18 12:04:10,966 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-18 12:04:10,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-18 12:04:10,969 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-18 12:04:11,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:04:11,217 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:04:11,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-18 12:04:11,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:11,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:11,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:11,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,224 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-18 12:04:11,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:11,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:11,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:11,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,229 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-18 12:04:11,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,230 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:04:11,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:04:11,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,242 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 12:04:11,243 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 12:04:11,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,295 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-18 12:04:11,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:11,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:11,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:04:11,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:11,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:11,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:11,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:04:11,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:11,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:11,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,317 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-18 12:04:11,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:11,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:11,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,327 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-18 12:04:11,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:11,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:11,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:11,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,330 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-18 12:04:11,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:11,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:11,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:11,341 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-18 12:04:11,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:11,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:11,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:11,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:11,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:11,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:11,363 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:04:11,383 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:04:11,383 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:04:11,385 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:04:11,386 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:04:11,387 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:04:11,387 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~n, ULTIMATE.start_init_cll_~i~0) = 1*ULTIMATE.start_init_cll_~n - 1*ULTIMATE.start_init_cll_~i~0 Supporting invariants [] [2018-11-18 12:04:11,396 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 12:04:11,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:11,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:04:11,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:04:11,491 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-18 12:04:11,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:04:11,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2018-11-18 12:04:11,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 35 states and 42 transitions. Complement of second has 7 states. [2018-11-18 12:04:11,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:04:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:04:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-18 12:04:11,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 12:04:11,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:04:11,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 12:04:11,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:04:11,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 12:04:11,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:04:11,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-18 12:04:11,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:04:11,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 14 transitions. [2018-11-18 12:04:11,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 12:04:11,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 12:04:11,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2018-11-18 12:04:11,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:04:11,558 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 12:04:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2018-11-18 12:04:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 12:04:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 12:04:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-18 12:04:11,580 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 12:04:11,580 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 12:04:11,580 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:04:11,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-18 12:04:11,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 12:04:11,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:04:11,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:04:11,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:04:11,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:04:11,582 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 99#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;assume { :begin_inline_init_cll } true;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 100#L552-4 assume true; 102#L552-1 assume !(init_cll_~i~0 < init_cll_~n); 107#L552-5 call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 108#L559 main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;assume { :end_inline_init_cll } true;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;assume { :begin_inline_search } true;search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9;havoc search_#t~mem6.base, search_#t~mem6.offset, search_#t~mem5, search_~head.base, search_~head.offset, search_~i, search_~curr~1.base, search_~curr~1.offset;search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset;search_~i := search_#in~i;search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; 109#L564-4 [2018-11-18 12:04:11,582 INFO L796 eck$LassoCheckResult]: Loop: 109#L564-4 assume true; 104#L564-1 call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); 105#L564-2 assume !!(search_#t~mem5 != search_~i);havoc search_#t~mem5;call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8);search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset;havoc search_#t~mem6.base, search_#t~mem6.offset; 109#L564-4 [2018-11-18 12:04:11,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 889538664, now seen corresponding path program 1 times [2018-11-18 12:04:11,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:11,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:11,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 52699, now seen corresponding path program 1 times [2018-11-18 12:04:11,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:11,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:11,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash 298145812, now seen corresponding path program 1 times [2018-11-18 12:04:11,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:11,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:11,839 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2018-11-18 12:04:11,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:04:11 BoogieIcfgContainer [2018-11-18 12:04:11,927 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:04:11,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:04:11,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:04:11,928 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:04:11,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:04:10" (3/4) ... [2018-11-18 12:04:11,931 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 12:04:11,959 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dc44c9b4-7610-4168-bc5a-1533b745e734/bin-2019/uautomizer/witness.graphml [2018-11-18 12:04:11,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:04:11,960 INFO L168 Benchmark]: Toolchain (without parser) took 2406.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 950.4 MB in the beginning and 858.6 MB in the end (delta: 91.8 MB). Peak memory consumption was 251.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:04:11,961 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:04:11,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 950.4 MB in the beginning and 1.2 GB in the end (delta: -200.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:04:11,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.00 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: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:04:11,961 INFO L168 Benchmark]: Boogie Preprocessor took 21.27 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-18 12:04:11,962 INFO L168 Benchmark]: RCFGBuilder took 223.20 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:04:11,962 INFO L168 Benchmark]: BuchiAutomizer took 1728.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.8 MB in the end (delta: 260.9 MB). Peak memory consumption was 260.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:04:11,962 INFO L168 Benchmark]: Witness Printer took 32.01 ms. Allocated memory is still 1.2 GB. Free memory was 861.8 MB in the beginning and 858.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:04:11,966 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 950.4 MB in the beginning and 1.2 GB in the end (delta: -200.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.00 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: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.27 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 223.20 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1728.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.8 MB in the end (delta: 260.9 MB). Peak memory consumption was 260.9 MB. Max. memory is 11.5 GB. * Witness Printer took 32.01 ms. Allocated memory is still 1.2 GB. Free memory was 861.8 MB in the beginning and 858.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.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 n + -1 * i and consists of 5 locations. The remainder module has 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 12 SDslu, 20 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital168 mio100 ax100 hnf100 lsp96 ukn62 mio100 lsp27 div100 bol100 ite100 ukn100 eq207 hnf87 smp100 dnf137 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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: 564]: 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 {i=1, NULL=0, curr=2, \result=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ac27e61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7671da65=0, next_node=0, \result=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5558340=3, next_node=0, head=2, head=2, \old(i)=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ac27e61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5435331a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64f82918=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1508d00a=0, i=3, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@df078ce=0, head=2, \old(n)=0, n=0, head=2, head=0, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72c640a3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@df078ce=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72c640a3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64f82918=0, curr=2, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L571] CALL, EXPR init_cll(n) [L548] node_t* head; [L549] EXPR, FCALL malloc(sizeof(node_t)) [L549] node_t* curr = malloc(sizeof(node_t)); [L550] FCALL curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] FCALL curr->next = head [L559] RET return head; [L571] EXPR init_cll(n) [L571] node_t* head = init_cll(n); [L572] CALL search(head, __VERIFIER_nondet_int()) [L563] node_t* curr = head; Loop: [L564] EXPR, FCALL curr->val [L564] COND TRUE curr->val != i [L565] EXPR, FCALL curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...