./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.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_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/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 c77e93b9599e042c4501017444b3de5267565d01 .................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-19 22:12:13,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:12:13,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:12:13,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:12:13,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:12:13,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:12:13,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:12:13,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:12:13,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:12:13,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:12:13,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:12:13,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:12:13,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:12:13,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:12:13,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:12:13,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:12:13,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:12:13,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:12:13,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:12:13,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:12:13,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:12:13,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:12:13,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:12:13,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:12:13,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:12:13,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:12:13,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:12:13,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:12:13,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:12:13,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:12:13,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:12:13,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:12:13,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:12:13,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:12:13,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:12:13,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:12:13,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:12:13,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:12:13,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:12:13,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:12:13,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:12:13,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 22:12:13,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:12:13,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:12:13,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:12:13,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:12:13,627 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:12:13,627 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:12:13,627 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:12:13,628 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:12:13,628 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:12:13,628 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:12:13,628 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:12:13,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:12:13,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:12:13,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:12:13,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:12:13,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:12:13,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:12:13,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:12:13,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:12:13,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:12:13,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:12:13,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:12:13,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:12:13,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:12:13,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:12:13,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:12:13,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:12:13,632 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:12:13,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:12:13,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:12:13,633 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:12:13,633 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:12:13,633 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_0d3783bb-d6b6-434c-a6ea-133fb820d706/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 -> c77e93b9599e042c4501017444b3de5267565d01 [2019-11-19 22:12:13,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:12:13,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:12:13,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:12:13,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:12:13,801 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:12:13,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-19 22:12:13,858 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/data/6e8937c4e/9a660d43ff1b487aa27c64c3754dd770/FLAGa3eb64e48 [2019-11-19 22:12:14,370 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:12:14,373 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-19 22:12:14,392 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/data/6e8937c4e/9a660d43ff1b487aa27c64c3754dd770/FLAGa3eb64e48 [2019-11-19 22:12:14,821 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/data/6e8937c4e/9a660d43ff1b487aa27c64c3754dd770 [2019-11-19 22:12:14,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:12:14,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:12:14,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:12:14,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:12:14,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:12:14,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:12:14" (1/1) ... [2019-11-19 22:12:14,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205e4e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:14, skipping insertion in model container [2019-11-19 22:12:14,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:12:14" (1/1) ... [2019-11-19 22:12:14,842 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:12:14,881 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:12:15,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:12:15,230 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:12:15,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:12:15,327 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:12:15,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15 WrapperNode [2019-11-19 22:12:15,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:12:15,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:12:15,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:12:15,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:12:15,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:12:15,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:12:15,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:12:15,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:12:15,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... [2019-11-19 22:12:15,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:12:15,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:12:15,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:12:15,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:12:15,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/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-19 22:12:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:12:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:12:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:12:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:12:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:12:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:12:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:12:15,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:12:16,043 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:12:16,043 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 22:12:16,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:12:16 BoogieIcfgContainer [2019-11-19 22:12:16,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:12:16,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:12:16,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:12:16,049 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:12:16,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:12:16,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:12:14" (1/3) ... [2019-11-19 22:12:16,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39adef0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:12:16, skipping insertion in model container [2019-11-19 22:12:16,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:12:16,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:12:15" (2/3) ... [2019-11-19 22:12:16,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39adef0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:12:16, skipping insertion in model container [2019-11-19 22:12:16,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:12:16,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:12:16" (3/3) ... [2019-11-19 22:12:16,053 INFO L371 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2019-11-19 22:12:16,086 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:12:16,086 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:12:16,086 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:12:16,086 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:12:16,087 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:12:16,087 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:12:16,087 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:12:16,087 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:12:16,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-19 22:12:16,121 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-19 22:12:16,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:12:16,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:12:16,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:12:16,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:12:16,127 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:12:16,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-19 22:12:16,132 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-19 22:12:16,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:12:16,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:12:16,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:12:16,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:12:16,138 INFO L794 eck$LassoCheckResult]: Stem: 38#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 8#L557-2true [2019-11-19 22:12:16,138 INFO L796 eck$LassoCheckResult]: Loop: 8#L557-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; 30#L547-2true assume !true; 40#L546-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 17#L552true 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; 23#L552-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L557true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 8#L557-2true [2019-11-19 22:12:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 22:12:16,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699651163] [2019-11-19 22:12:16,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-19 22:12:16,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612707472] [2019-11-19 22:12:16,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:12:16,297 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-19 22:12:16,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612707472] [2019-11-19 22:12:16,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:12:16,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:12:16,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494743472] [2019-11-19 22:12:16,303 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:12:16,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:12:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:12:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:12:16,318 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-11-19 22:12:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:12:16,325 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2019-11-19 22:12:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:12:16,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2019-11-19 22:12:16,329 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-19 22:12:16,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2019-11-19 22:12:16,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-19 22:12:16,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-19 22:12:16,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2019-11-19 22:12:16,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:12:16,335 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-19 22:12:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2019-11-19 22:12:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-19 22:12:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 22:12:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-11-19 22:12:16,361 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-19 22:12:16,361 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-11-19 22:12:16,361 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:12:16,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2019-11-19 22:12:16,363 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2019-11-19 22:12:16,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:12:16,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:12:16,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:12:16,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:12:16,364 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 114#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 99#L557-2 [2019-11-19 22:12:16,364 INFO L796 eck$LassoCheckResult]: Loop: 99#L557-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; 104#L547-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; 101#L546-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; 102#L546-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 112#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 119#L552 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; 120#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 98#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 99#L557-2 [2019-11-19 22:12:16,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,364 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-19 22:12:16,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027159519] [2019-11-19 22:12:16,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-19 22:12:16,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979547553] [2019-11-19 22:12:16,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:12:16,510 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-19 22:12:16,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979547553] [2019-11-19 22:12:16,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:12:16,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:12:16,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490471979] [2019-11-19 22:12:16,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:12:16,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:12:16,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:12:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:12:16,512 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-19 22:12:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:12:16,710 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2019-11-19 22:12:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:12:16,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2019-11-19 22:12:16,716 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2019-11-19 22:12:16,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2019-11-19 22:12:16,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-19 22:12:16,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-19 22:12:16,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2019-11-19 22:12:16,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:12:16,719 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-11-19 22:12:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2019-11-19 22:12:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-11-19 22:12:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 22:12:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-11-19 22:12:16,731 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-11-19 22:12:16,731 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-11-19 22:12:16,731 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:12:16,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2019-11-19 22:12:16,732 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2019-11-19 22:12:16,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:12:16,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:12:16,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:12:16,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:12:16,733 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 206#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 190#L557-2 [2019-11-19 22:12:16,734 INFO L796 eck$LassoCheckResult]: Loop: 190#L557-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; 196#L547-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; 192#L546-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; 193#L546-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 226#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 211#L552 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; 212#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 189#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 190#L557-2 [2019-11-19 22:12:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-19 22:12:16,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055960621] [2019-11-19 22:12:16,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:16,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-19 22:12:16,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885205486] [2019-11-19 22:12:16,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:16,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:16,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-19 22:12:16,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:16,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11994166] [2019-11-19 22:12:16,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:12:16,934 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-19 22:12:16,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11994166] [2019-11-19 22:12:16,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:12:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:12:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330617874] [2019-11-19 22:12:17,132 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-19 22:12:17,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:12:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:12:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:12:17,240 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-11-19 22:12:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:12:17,586 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2019-11-19 22:12:17,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:12:17,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2019-11-19 22:12:17,590 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2019-11-19 22:12:17,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2019-11-19 22:12:17,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-11-19 22:12:17,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-19 22:12:17,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2019-11-19 22:12:17,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:12:17,596 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-11-19 22:12:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2019-11-19 22:12:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-11-19 22:12:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 22:12:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2019-11-19 22:12:17,601 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-11-19 22:12:17,601 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2019-11-19 22:12:17,601 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:12:17,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2019-11-19 22:12:17,602 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2019-11-19 22:12:17,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:12:17,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:12:17,603 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:12:17,603 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:12:17,603 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 350#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~short22, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~nondet28, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~mem35.base, main_#t~mem35.offset, main_#t~mem34, main_#t~mem37.base, main_#t~mem37.offset, main_#t~mem36, main_#t~mem38, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~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); 351#L557-2 [2019-11-19 22:12:17,603 INFO L796 eck$LassoCheckResult]: Loop: 351#L557-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; 366#L547-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; 338#L546-1 assume !main_#t~short6; 339#L546-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 349#L546-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 379#L552 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; 359#L552-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 360#L557 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 351#L557-2 [2019-11-19 22:12:17,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-19 22:12:17,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:17,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115832471] [2019-11-19 22:12:17,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:17,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-19 22:12:17,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:17,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437524188] [2019-11-19 22:12:17,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:17,667 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:17,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:12:17,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-19 22:12:17,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:12:17,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454479942] [2019-11-19 22:12:17,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:12:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:12:17,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:12:17,864 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-19 22:12:18,174 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:12:18,201 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:12:18,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:12:18,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:12:18,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:110 [2019-11-19 22:12:18,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:12:18 BoogieIcfgContainer [2019-11-19 22:12:18,394 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:12:18,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:12:18,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:12:18,394 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:12:18,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:12:16" (3/4) ... [2019-11-19 22:12:18,398 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 22:12:18,454 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0d3783bb-d6b6-434c-a6ea-133fb820d706/bin/uautomizer/witness.graphml [2019-11-19 22:12:18,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:12:18,465 INFO L168 Benchmark]: Toolchain (without parser) took 3640.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:12:18,466 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:12:18,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:12:18,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:12:18,468 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 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-19 22:12:18,468 INFO L168 Benchmark]: RCFGBuilder took 618.53 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:12:18,469 INFO L168 Benchmark]: BuchiAutomizer took 2348.39 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: -49.9 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:12:18,470 INFO L168 Benchmark]: Witness Printer took 70.07 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:12:18,473 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.01 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 618.53 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2348.39 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: -49.9 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. * Witness Printer took 70.07 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: 1.7 MB). Peak memory consumption was 1.7 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 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 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 166 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 544]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38f18115=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e5b60f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23f928a4=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4262ce46=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1168d66b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ae3e34c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@780d0dfc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69282cb5=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@656e0476=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@38f18115=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bcad288=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cf91c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24f2c359=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16fabe0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@649e5303=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@55148397=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@656e0476=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cf91c7=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24f2c359=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3df9275e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69282cb5=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d8ffe8f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@122cd387=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23f928a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c4859a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52f748ec=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1168d66b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4fbd5f46=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3df9275e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ae3e34c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@55148397=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4f3310e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19cb208a=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a9ca781=23, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59ae75f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@aa7b4f5=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5fc1d7e2=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@122cd387=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d8ffe8f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b5bc3c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4262ce46=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@780d0dfc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2740cc60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4fbd5f46=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3d74c74e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f239b57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4f3310e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2740cc60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b5bc3c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a931528=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63e9fa72=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5bb98703=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@76f4dad5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5fc1d7e2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ba617fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e5b60f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c4859a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@52f748ec=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a931528=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f239b57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ba617fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64890441=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@649e5303=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 544]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) Loop: [L544] COND TRUE __VERIFIER_nondet_int() [L545] n = root [L546] EXPR n->left [L546] n->left && n->right [L546] COND FALSE !(n->left && n->right) [L552] EXPR n->left [L552] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L557] EXPR n->right [L557] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...