./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/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 32bit --witnessprinter.graph.data.programhash 3e23c3bca784f04992b2007c94519fee617936af .............................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-678e011 [2019-11-20 01:54:52,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:54:52,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:54:52,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:54:52,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:54:52,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:54:52,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:54:52,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:54:52,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:54:52,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:54:52,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:54:52,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:54:52,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:54:52,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:54:52,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:54:52,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:54:52,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:54:52,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:54:52,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:54:52,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:54:52,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:54:52,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:54:52,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:54:52,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:54:52,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:54:52,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:54:52,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:54:52,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:54:52,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:54:52,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:54:52,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:54:52,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:54:52,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:54:52,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:54:52,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:54:52,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:54:52,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:54:52,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:54:52,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:54:52,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:54:52,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:54:52,399 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 01:54:52,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:54:52,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:54:52,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:54:52,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:54:52,423 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:54:52,424 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 01:54:52,424 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 01:54:52,424 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 01:54:52,424 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 01:54:52,424 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 01:54:52,425 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 01:54:52,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:54:52,425 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:54:52,425 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:54:52,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:54:52,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:54:52,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:54:52,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 01:54:52,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 01:54:52,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 01:54:52,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:54:52,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:54:52,427 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 01:54:52,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:54:52,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 01:54:52,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:54:52,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:54:52,428 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 01:54:52,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:54:52,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:54:52,429 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 01:54:52,429 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 01:54:52,430 INFO L138 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/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e23c3bca784f04992b2007c94519fee617936af [2019-11-20 01:54:52,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:54:52,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:54:52,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:54:52,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:54:52,613 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:54:52,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-11-20 01:54:52,687 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/data/94a21e664/3604a074baea4621ab6aee1639d9a7a1/FLAGe5617f030 [2019-11-20 01:54:53,229 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:54:53,229 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-11-20 01:54:53,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/data/94a21e664/3604a074baea4621ab6aee1639d9a7a1/FLAGe5617f030 [2019-11-20 01:54:53,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/data/94a21e664/3604a074baea4621ab6aee1639d9a7a1 [2019-11-20 01:54:53,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:54:53,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:54:53,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:54:53,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:54:53,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:54:53,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:54:53" (1/1) ... [2019-11-20 01:54:53,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d30bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:53, skipping insertion in model container [2019-11-20 01:54:53,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:54:53" (1/1) ... [2019-11-20 01:54:53,531 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:54:53,599 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:54:54,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:54:54,050 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:54:54,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:54:54,178 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:54:54,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54 WrapperNode [2019-11-20 01:54:54,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:54:54,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:54:54,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:54:54,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:54:54,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:54:54,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:54:54,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:54:54,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:54:54,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... [2019-11-20 01:54:54,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:54:54,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:54:54,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:54:54,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:54:54,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/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 [2019-11-20 01:54:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 01:54:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:54:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:54:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:54:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:54:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:54:54,954 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:54:54,954 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:54:54,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:54:54 BoogieIcfgContainer [2019-11-20 01:54:54,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:54:54,956 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 01:54:54,956 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 01:54:54,960 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 01:54:54,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:54:54,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 01:54:53" (1/3) ... [2019-11-20 01:54:54,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54c5cfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 01:54:54, skipping insertion in model container [2019-11-20 01:54:54,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:54:54,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:54:54" (2/3) ... [2019-11-20 01:54:54,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54c5cfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 01:54:54, skipping insertion in model container [2019-11-20 01:54:54,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:54:54,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:54:54" (3/3) ... [2019-11-20 01:54:54,964 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2019-11-20 01:54:55,011 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 01:54:55,012 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 01:54:55,012 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 01:54:55,012 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:54:55,012 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:54:55,012 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 01:54:55,012 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:54:55,012 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 01:54:55,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-20 01:54:55,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-20 01:54:55,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:54:55,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:54:55,055 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:54:55,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 01:54:55,055 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 01:54:55,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-20 01:54:55,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-20 01:54:55,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:54:55,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:54:55,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:54:55,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 01:54:55,064 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 5#L538-2true [2019-11-20 01:54:55,065 INFO L796 eck$LassoCheckResult]: Loop: 5#L538-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L528-2true assume !true; 13#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L533true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 17#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#L538true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 5#L538-2true [2019-11-20 01:54:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 01:54:55,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253258961] [2019-11-20 01:54:55,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-20 01:54:55,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377642502] [2019-11-20 01:54:55,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:54:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:54:55,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377642502] [2019-11-20 01:54:55,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:54:55,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:54:55,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85683401] [2019-11-20 01:54:55,249 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 01:54:55,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:54:55,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:54:55,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:54:55,265 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-20 01:54:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:54:55,271 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-20 01:54:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:54:55,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-11-20 01:54:55,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-20 01:54:55,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-11-20 01:54:55,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-20 01:54:55,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-20 01:54:55,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-20 01:54:55,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 01:54:55,281 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-20 01:54:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-20 01:54:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-20 01:54:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 01:54:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-20 01:54:55,310 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-20 01:54:55,310 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-20 01:54:55,310 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 01:54:55,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-20 01:54:55,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-20 01:54:55,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:54:55,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:54:55,312 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:54:55,312 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:54:55,313 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 53#L538-2 [2019-11-20 01:54:55,313 INFO L796 eck$LassoCheckResult]: Loop: 53#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 50#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 51#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 52#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 58#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L533 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 61#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 53#L538-2 [2019-11-20 01:54:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-20 01:54:55,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040947661] [2019-11-20 01:54:55,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-20 01:54:55,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016760083] [2019-11-20 01:54:55,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:54:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:54:55,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016760083] [2019-11-20 01:54:55,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:54:55,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:54:55,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282194684] [2019-11-20 01:54:55,508 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 01:54:55,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:54:55,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:54:55,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:54:55,509 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-20 01:54:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:54:55,653 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-11-20 01:54:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:54:55,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-11-20 01:54:55,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 01:54:55,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-11-20 01:54:55,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-20 01:54:55,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-20 01:54:55,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-11-20 01:54:55,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 01:54:55,659 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-20 01:54:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-11-20 01:54:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-20 01:54:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-20 01:54:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-20 01:54:55,664 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-20 01:54:55,664 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-20 01:54:55,664 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 01:54:55,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-20 01:54:55,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-20 01:54:55,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:54:55,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:54:55,666 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:54:55,666 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:54:55,666 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 115#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 105#L538-2 [2019-11-20 01:54:55,666 INFO L796 eck$LassoCheckResult]: Loop: 105#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 101#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 102#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 103#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 120#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 113#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 105#L538-2 [2019-11-20 01:54:55,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,667 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-20 01:54:55,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499769447] [2019-11-20 01:54:55,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-20 01:54:55,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829142418] [2019-11-20 01:54:55,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:55,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-20 01:54:55,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:55,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862729932] [2019-11-20 01:54:55,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:54:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:54:55,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862729932] [2019-11-20 01:54:55,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:54:55,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:54:55,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020437909] [2019-11-20 01:54:56,079 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-20 01:54:56,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:54:56,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:54:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:54:56,206 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-20 01:54:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:54:56,430 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-11-20 01:54:56,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:54:56,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-11-20 01:54:56,433 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-20 01:54:56,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-11-20 01:54:56,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-20 01:54:56,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-20 01:54:56,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-11-20 01:54:56,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 01:54:56,436 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-20 01:54:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-11-20 01:54:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-20 01:54:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 01:54:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-20 01:54:56,439 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-20 01:54:56,439 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-20 01:54:56,439 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 01:54:56,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-20 01:54:56,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-20 01:54:56,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:54:56,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:54:56,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 01:54:56,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:54:56,447 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 171#L538-2 [2019-11-20 01:54:56,447 INFO L796 eck$LassoCheckResult]: Loop: 171#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 168#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 169#L527-1 assume !main_#t~short6; 170#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 195#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 184#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 185#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 171#L538-2 [2019-11-20 01:54:56,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-20 01:54:56,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:56,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30031399] [2019-11-20 01:54:56,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:56,494 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-20 01:54:56,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:56,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345764227] [2019-11-20 01:54:56,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:56,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:54:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-20 01:54:56,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:54:56,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041558510] [2019-11-20 01:54:56,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:54:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:54:56,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:54:56,774 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-20 01:54:56,917 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 01:54:57,095 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-20 01:54:57,205 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 01:54:57,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 01:54:57 BoogieIcfgContainer [2019-11-20 01:54:57,278 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 01:54:57,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:54:57,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:54:57,278 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:54:57,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:54:54" (3/4) ... [2019-11-20 01:54:57,283 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-20 01:54:57,352 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0ca9d9b5-3d24-46e9-9cc6-c0d2329c9534/bin/uautomizer/witness.graphml [2019-11-20 01:54:57,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:54:57,354 INFO L168 Benchmark]: Toolchain (without parser) took 3839.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.1 MB in the beginning and 932.7 MB in the end (delta: 13.3 MB). Peak memory consumption was 173.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:54:57,355 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:54:57,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:54:57,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:54:57,356 INFO L168 Benchmark]: Boogie Preprocessor took 47.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:54:57,357 INFO L168 Benchmark]: RCFGBuilder took 676.33 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: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:54:57,361 INFO L168 Benchmark]: BuchiAutomizer took 2321.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.7 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:54:57,361 INFO L168 Benchmark]: Witness Printer took 74.42 ms. Allocated memory is still 1.2 GB. Free memory is still 932.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:54:57,364 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 676.33 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: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2321.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.7 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.42 ms. Allocated memory is still 1.2 GB. Free memory is still 932.7 MB. There was no memory consumed. 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 525]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2472a847=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63f9377f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a966773=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@441c95db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23c57fb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@476467bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@646c2824=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29dda7c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@30e3871d=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78faea93=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2472a847=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d4d63ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2720cd09=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a1628d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f9bd140=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56b3350a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c13eab7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2720cd09=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b9a33df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a1628d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@646c2824=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78faea93=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@30e3871d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@441c95db=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66c8fc0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a966773=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a1d5abf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65234730=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b5416e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@476467bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c13eab7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b29072a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4410065f=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cfc6692=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66c8fc0c=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7720d324=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23c57fb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29dda7c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b5416e=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2b29072a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7720d324=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2207beb7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@9fe80b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b9a33df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63f9377f=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a1d5abf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@65234730=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2207beb7=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56b3350a=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 525]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) Loop: [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...