./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/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_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/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-aa41828 [2018-11-23 15:47:49,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:47:49,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:47:49,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:47:49,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:47:49,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:47:49,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:47:49,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:47:49,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:47:49,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:47:49,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:47:49,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:47:49,350 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:47:49,351 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:47:49,352 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:47:49,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:47:49,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:47:49,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:47:49,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:47:49,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:47:49,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:47:49,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:47:49,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:47:49,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:47:49,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:47:49,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:47:49,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:47:49,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:47:49,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:47:49,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:47:49,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:47:49,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:47:49,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:47:49,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:47:49,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:47:49,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:47:49,366 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:47:49,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:47:49,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:47:49,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:47:49,378 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:47:49,378 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:47:49,378 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:47:49,379 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:47:49,379 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:47:49,379 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:47:49,379 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:47:49,379 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:47:49,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:47:49,379 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:47:49,380 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:47:49,381 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:47:49,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:47:49,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:47:49,381 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:47:49,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:47:49,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:47:49,381 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:47:49,382 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:47:49,382 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_a391296a-c052-4473-8b29-e4502a5ff59f/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-23 15:47:49,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:47:49,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:47:49,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:47:49,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:47:49,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:47:49,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2018-11-23 15:47:49,450 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/data/2d070db8d/a2ab087cea324e6e814727e4b2a0132f/FLAGdbb3b6c81 [2018-11-23 15:47:49,882 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:47:49,883 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2018-11-23 15:47:49,889 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/data/2d070db8d/a2ab087cea324e6e814727e4b2a0132f/FLAGdbb3b6c81 [2018-11-23 15:47:49,897 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/data/2d070db8d/a2ab087cea324e6e814727e4b2a0132f [2018-11-23 15:47:49,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:47:49,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:47:49,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:47:49,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:47:49,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:47:49,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:47:49" (1/1) ... [2018-11-23 15:47:49,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212141c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:49, skipping insertion in model container [2018-11-23 15:47:49,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:47:49" (1/1) ... [2018-11-23 15:47:49,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:47:49,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:47:50,134 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:47:50,142 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:47:50,211 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:47:50,234 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:47:50,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50 WrapperNode [2018-11-23 15:47:50,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:47:50,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:47:50,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:47:50,235 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:47:50,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:47:50,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:47:50,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:47:50,261 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:47:50,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... [2018-11-23 15:47:50,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:47:50,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:47:50,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:47:50,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:47:50,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/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-23 15:47:50,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:47:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:47:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:47:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:47:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:47:50,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:47:50,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:47:50,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:47:50,490 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 15:47:50,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:50 BoogieIcfgContainer [2018-11-23 15:47:50,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:47:50,491 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:47:50,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:47:50,494 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:47:50,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:47:50,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:47:49" (1/3) ... [2018-11-23 15:47:50,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25344f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:47:50, skipping insertion in model container [2018-11-23 15:47:50,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:47:50,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:50" (2/3) ... [2018-11-23 15:47:50,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25344f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:47:50, skipping insertion in model container [2018-11-23 15:47:50,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:47:50,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:50" (3/3) ... [2018-11-23 15:47:50,499 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca_false-termination.c.i [2018-11-23 15:47:50,547 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:47:50,547 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:47:50,547 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:47:50,548 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:47:50,548 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:47:50,548 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:47:50,548 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:47:50,548 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:47:50,548 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:47:50,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 15:47:50,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:47:50,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:50,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:50,584 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:47:50,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:47:50,585 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:47:50,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 15:47:50,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:47:50,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:50,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:50,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:47:50,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:47:50,593 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true 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;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; 13#L552-3true [2018-11-23 15:47:50,594 INFO L796 eck$LassoCheckResult]: Loop: 13#L552-3true 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; 11#L552-2true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 13#L552-3true [2018-11-23 15:47:50,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 15:47:50,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:50,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:50,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:50,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:50,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:50,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 15:47:50,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:50,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:50,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:50,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:50,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 15:47:50,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:50,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:50,954 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-23 15:47:50,977 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-23 15:47:50,984 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-23 15:47:51,055 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-23 15:47:51,066 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-23 15:47:51,146 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-23 15:47:51,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:153, output treesize:155 [2018-11-23 15:47:51,312 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:47:51,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:47:51,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:47:51,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:47:51,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:47:51,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:47:51,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:47:51,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:47:51,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 15:47:51,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:47:51,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:47:51,329 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-23 15:47:51,334 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-23 15:47:51,337 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-23 15:47:51,340 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-23 15:47:51,341 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-23 15:47:51,343 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-23 15:47:51,346 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-23 15:47:51,347 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-23 15:47:51,508 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-23 15:47:51,510 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-23 15:47:51,512 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-23 15:47:51,513 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-23 15:47:51,517 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-23 15:47:51,750 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:47:51,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:47:51,756 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-23 15:47:51,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,762 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-23 15:47:51,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,765 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-23 15:47:51,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,767 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-23 15:47:51,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,769 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-23 15:47:51,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,771 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-23 15:47:51,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:51,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:51,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,776 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-23 15:47:51,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,778 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-23 15:47:51,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,781 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-23 15:47:51,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,784 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-23 15:47:51,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,785 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:47:51,785 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:47:51,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,794 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 15:47:51,794 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:47:51,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,844 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-23 15:47:51,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,847 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-23 15:47:51,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:51,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:51,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,857 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-23 15:47:51,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,860 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-23 15:47:51,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:51,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:51,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,866 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-23 15:47:51,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:47:51,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:47:51,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:47:51,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,868 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-23 15:47:51,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:51,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:51,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:47:51,873 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-23 15:47:51,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:47:51,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:47:51,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:47:51,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:47:51,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:47:51,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:47:51,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:47:51,903 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:47:51,904 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:47:51,905 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:47:51,907 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:47:51,907 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:47:51,908 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-23 15:47:51,914 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:47:51,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:47:51,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:47:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:47:51,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:47:51,963 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-23 15:47:51,974 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-23 15:47:51,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2018-11-23 15:47:52,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 30 states and 39 transitions. Complement of second has 7 states. [2018-11-23 15:47:52,003 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-23 15:47:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:47:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-23 15:47:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 15:47:52,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:47:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 15:47:52,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:47:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 15:47:52,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:47:52,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 15:47:52,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:47:52,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2018-11-23 15:47:52,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:47:52,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 15:47:52,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-23 15:47:52,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:47:52,013 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 15:47:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-23 15:47:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 15:47:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 15:47:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 15:47:52,029 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 15:47:52,029 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 15:47:52,029 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:47:52,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-23 15:47:52,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:47:52,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:47:52,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:47:52,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:47:52,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:47:52,030 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 93#L-1 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;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; 94#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 95#L552-4 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; 96#L559 main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;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;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; 98#L564-3 [2018-11-23 15:47:52,030 INFO L796 eck$LassoCheckResult]: Loop: 98#L564-3 call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); 97#L564-1 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; 98#L564-3 [2018-11-23 15:47:52,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2018-11-23 15:47:52,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:52,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2018-11-23 15:47:52,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:52,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:52,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:52,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:52,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:52,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:47:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951500, now seen corresponding path program 1 times [2018-11-23 15:47:52,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:47:52,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:47:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:52,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:47:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:47:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:47:52,374 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2018-11-23 15:47:52,378 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-23 15:47:52,394 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-23 15:47:52,496 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-23 15:47:52,502 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-23 15:47:52,577 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-23 15:47:52,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:159 ----- 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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;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; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] 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; [?] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;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;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; [?] #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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~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_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [?] 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; [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] curr = curr->next ----- [2018-11-23 15:47:52,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:47:52 BoogieIcfgContainer [2018-11-23 15:47:52,677 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:47:52,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:47:52,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:47:52,677 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:47:52,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:50" (3/4) ... [2018-11-23 15:47:52,680 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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;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; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] 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; [?] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;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;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; [?] #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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~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_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [?] 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; [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] curr = curr->next ----- [2018-11-23 15:47:52,717 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a391296a-c052-4473-8b29-e4502a5ff59f/bin-2019/uautomizer/witness.graphml [2018-11-23 15:47:52,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:47:52,718 INFO L168 Benchmark]: Toolchain (without parser) took 2819.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,719 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:47:52,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,720 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,720 INFO L168 Benchmark]: RCFGBuilder took 208.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,721 INFO L168 Benchmark]: BuchiAutomizer took 2186.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.4 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,721 INFO L168 Benchmark]: Witness Printer took 40.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:47:52,725 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2186.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.4 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. * Witness Printer took 40.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB 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 n + -1 * i and consists of 5 locations. The remainder module has 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. 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 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 10 SDslu, 16 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: inital254 mio100 ax100 hnf100 lsp97 ukn41 mio100 lsp24 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf162 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms 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@bf556de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c97a3c5=0, next_node=0, \result=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74ec355f=5, next_node=0, head=2, head=2, \old(i)=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bf556de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@572242d5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e1db86e=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3d5f859b=0, i=5, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@491a6a3c=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@32987870=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@491a6a3c=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32987870=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e1db86e=0, curr=2, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: 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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;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; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] 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; [?] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;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;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; [?] #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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~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_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [?] 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; [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] 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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;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; [?] assume !(init_cll_~i~0 < init_cll_~n); [?] 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; [?] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;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;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; [?] #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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~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_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res.base, init_cll_#res.offset; [L571] 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; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0.base, init_cll_~head~0.offset; [L549] call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; [L550] call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4); [L551] init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset; [L552] init_cll_~i~0 := 1; [L552-L557] assume !(init_cll_~i~0 < init_cll_~n); [L558] 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); [L559] init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; [L571] main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset; [L571] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L571] havoc main_#t~ret8.base, main_#t~ret8.offset; [L572] search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9; [L572] 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; [L561-L567] search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~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_#t~nondet9, main_~n~0, main_~head~1; [L570] main_~n~0 := main_#t~nondet7; [L570] havoc main_#t~nondet7; [L571] init_cll_#in~n := main_~n~0; [L571] havoc init_cll_#res; [L571] havoc init_cll_#t~malloc2, init_cll_#t~malloc4, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0, init_cll_~n, init_cll_~head~0, init_cll_~curr~0; [L546-L560] init_cll_~n := init_cll_#in~n; [L548] havoc init_cll_~head~0; [L549] FCALL call init_cll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_cll_~curr~0 := init_cll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_cll_~curr~0!base, offset: init_cll_~curr~0!offset }, 4); [L551] init_cll_~head~0 := init_cll_~curr~0; [L552] init_cll_~i~0 := 1; [L552-L557] COND TRUE !(init_cll_~i~0 < init_cll_~n) [L558] FCALL call write~$Pointer$(init_cll_~head~0, { base: init_cll_~curr~0!base, offset: 4 + init_cll_~curr~0!offset }, 8); [L559] init_cll_#res := init_cll_~head~0; [L571] main_#t~ret8 := init_cll_#res; [L571] main_~head~1 := main_#t~ret8; [L571] havoc main_#t~ret8; [L572] search_#in~head, search_#in~i := main_~head~1, main_#t~nondet9; [L572] havoc search_#t~mem6, search_#t~mem5, search_~head, search_~i, search_~curr~1; [L561-L567] search_~head := search_#in~head; [L561-L567] search_~i := search_#in~i; [L563] search_~curr~1 := search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet7; [L570] havoc #t~nondet7; [L546-L560] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L559] #res := ~head~0; [L571] ~head~1 := #t~ret8; [L571] havoc #t~ret8; [L561-L567] ~head := #in~head; [L561-L567] ~i := #in~i; [L563] ~curr~1 := ~head; [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [?] 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; [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L564] call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); [L564-L566] assume !!(search_#t~mem5 != search_~i); [L564] havoc search_#t~mem5; [L565] call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8); [L565] search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset; [L565] havoc search_#t~mem6.base, search_#t~mem6.offset; [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L564] FCALL call search_#t~mem5 := read~int({ base: search_~curr~1!base, offset: search_~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(search_#t~mem5 != search_~i)) [L564] havoc search_#t~mem5; [L565] FCALL call search_#t~mem6 := read~$Pointer$({ base: search_~curr~1!base, offset: 4 + search_~curr~1!offset }, 8); [L565] search_~curr~1 := search_#t~mem6; [L565] havoc search_#t~mem6; [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L564] FCALL call #t~mem5 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L564-L566] COND FALSE !(!(#t~mem5 != ~i)) [L564] havoc #t~mem5; [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L565] ~curr~1 := #t~mem6; [L565] havoc #t~mem6; [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] curr = curr->next ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; Loop: [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...