./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 275864fd23c88e3a2867d84f3947ff5231f6c6d6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:10:06,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:10:06,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:10:06,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:10:06,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:10:06,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:10:06,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:10:06,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:10:06,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:10:06,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:10:06,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:10:06,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:10:06,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:10:06,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:10:06,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:10:06,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:10:06,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:10:06,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:10:06,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:10:06,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:10:06,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:10:06,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:10:06,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:10:06,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:10:06,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:10:06,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:10:06,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:10:06,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:10:06,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:10:06,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:10:06,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:10:06,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:10:06,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:10:06,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:10:06,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:10:06,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:10:06,825 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 14:10:06,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:10:06,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:10:06,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:10:06,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:10:06,835 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:10:06,835 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:10:06,835 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:10:06,835 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:10:06,835 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:10:06,835 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:10:06,836 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:10:06,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:10:06,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:10:06,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:10:06,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:10:06,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:10:06,837 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:10:06,838 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:10:06,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:10:06,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:10:06,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:10:06,838 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:10:06,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:10:06,839 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:10:06,839 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:10:06,839 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:10:06,839 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 275864fd23c88e3a2867d84f3947ff5231f6c6d6 [2018-11-23 14:10:06,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:10:06,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:10:06,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:10:06,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:10:06,874 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:10:06,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-11-23 14:10:06,908 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/data/31d3b3a98/cc5d528785df4598b699e9f226794fc4/FLAG383615367 [2018-11-23 14:10:07,351 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:10:07,352 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/sv-benchmarks/c/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-11-23 14:10:07,359 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/data/31d3b3a98/cc5d528785df4598b699e9f226794fc4/FLAG383615367 [2018-11-23 14:10:07,369 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/data/31d3b3a98/cc5d528785df4598b699e9f226794fc4 [2018-11-23 14:10:07,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:10:07,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:10:07,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:10:07,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:10:07,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:10:07,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741d4a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07, skipping insertion in model container [2018-11-23 14:10:07,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:10:07,414 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:10:07,599 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:10:07,606 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:10:07,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:10:07,710 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:10:07,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07 WrapperNode [2018-11-23 14:10:07,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:10:07,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:10:07,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:10:07,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:10:07,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:10:07,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:10:07,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:10:07,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:10:07,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... [2018-11-23 14:10:07,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:10:07,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:10:07,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:10:07,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:10:07,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:10:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:10:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:10:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:10:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:10:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:10:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:10:08,021 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:10:08,021 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 14:10:08,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:08 BoogieIcfgContainer [2018-11-23 14:10:08,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:10:08,022 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:10:08,022 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:10:08,024 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:10:08,024 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:10:08,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:10:07" (1/3) ... [2018-11-23 14:10:08,025 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14d16eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:10:08, skipping insertion in model container [2018-11-23 14:10:08,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:10:08,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:07" (2/3) ... [2018-11-23 14:10:08,025 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14d16eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:10:08, skipping insertion in model container [2018-11-23 14:10:08,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:10:08,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:08" (3/3) ... [2018-11-23 14:10:08,027 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-11-23 14:10:08,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:10:08,063 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:10:08,063 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:10:08,063 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:10:08,063 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:10:08,063 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:10:08,063 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:10:08,063 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:10:08,063 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:10:08,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 14:10:08,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 14:10:08,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:10:08,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:10:08,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:10:08,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 14:10:08,095 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:10:08,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 14:10:08,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 14:10:08,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:10:08,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:10:08,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:10:08,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 14:10:08,104 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); 10#L641-2true [2018-11-23 14:10:08,104 INFO L796 eck$LassoCheckResult]: Loop: 10#L641-2true assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 8#L631-2true assume !true; 23#L630-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 20#L636true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 26#L636-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L641true assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 10#L641-2true [2018-11-23 14:10:08,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 14:10:08,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-23 14:10:08,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:10:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:10:08,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:10:08,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:10:08,211 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:10:08,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:10:08,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:10:08,222 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 14:10:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:10:08,227 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2018-11-23 14:10:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:10:08,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2018-11-23 14:10:08,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 14:10:08,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2018-11-23 14:10:08,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 14:10:08,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 14:10:08,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2018-11-23 14:10:08,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:10:08,235 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 14:10:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2018-11-23 14:10:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 14:10:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 14:10:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-11-23 14:10:08,253 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 14:10:08,254 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 14:10:08,254 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:10:08,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-11-23 14:10:08,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 14:10:08,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:10:08,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:10:08,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:10:08,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:10:08,255 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); 62#L641-2 [2018-11-23 14:10:08,255 INFO L796 eck$LassoCheckResult]: Loop: 62#L641-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 59#L631-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 64#L630-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 65#L630-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; 72#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L636 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 75#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L641 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 62#L641-2 [2018-11-23 14:10:08,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 14:10:08,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-23 14:10:08,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:10:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:10:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:10:08,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:10:08,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:10:08,364 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:10:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:10:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:10:08,365 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 14:10:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:10:08,456 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2018-11-23 14:10:08,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:10:08,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2018-11-23 14:10:08,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-23 14:10:08,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2018-11-23 14:10:08,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 14:10:08,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 14:10:08,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2018-11-23 14:10:08,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:10:08,461 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2018-11-23 14:10:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2018-11-23 14:10:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-23 14:10:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 14:10:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-23 14:10:08,463 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-23 14:10:08,463 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-23 14:10:08,463 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:10:08,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-11-23 14:10:08,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 14:10:08,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:10:08,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:10:08,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:10:08,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:10:08,465 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); 119#L641-2 [2018-11-23 14:10:08,465 INFO L796 eck$LassoCheckResult]: Loop: 119#L641-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 116#L631-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 121#L630-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 122#L630-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; 134#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L636 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 133#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 118#L641 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 119#L641-2 [2018-11-23 14:10:08,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 14:10:08,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-23 14:10:08,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:10:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-23 14:10:08,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:10:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:10:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:10:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:10:08,669 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-11-23 14:10:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:10:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:10:08,726 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 14:10:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:10:08,849 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2018-11-23 14:10:08,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:10:08,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2018-11-23 14:10:08,850 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2018-11-23 14:10:08,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2018-11-23 14:10:08,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 14:10:08,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 14:10:08,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2018-11-23 14:10:08,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:10:08,852 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2018-11-23 14:10:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2018-11-23 14:10:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2018-11-23 14:10:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 14:10:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-11-23 14:10:08,854 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-23 14:10:08,854 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-23 14:10:08,854 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:10:08,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2018-11-23 14:10:08,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2018-11-23 14:10:08,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:10:08,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:10:08,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:10:08,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:10:08,856 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); 215#L641-2 [2018-11-23 14:10:08,856 INFO L796 eck$LassoCheckResult]: Loop: 215#L641-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 212#L631-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 213#L630-1 assume !main_#t~short4; 214#L630-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; 234#L630-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L636 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 228#L636-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 229#L641 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 215#L641-2 [2018-11-23 14:10:08,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 14:10:08,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-23 14:10:08,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:10:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:10:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-23 14:10:08,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:10:08,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:10:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:10:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:10:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:10:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-23 14:10:09,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:10:09 BoogieIcfgContainer [2018-11-23 14:10:09,142 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:10:09,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:10:09,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:10:09,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:10:09,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:08" (3/4) ... [2018-11-23 14:10:09,144 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-23 14:10:09,174 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9889ee0d-9b1c-4a5d-bc87-f41c07f09f44/bin-2019/uautomizer/witness.graphml [2018-11-23 14:10:09,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:10:09,175 INFO L168 Benchmark]: Toolchain (without parser) took 1802.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 923.1 MB in the end (delta: 33.5 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:10:09,176 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:10:09,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:10:09,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.76 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. [2018-11-23 14:10:09,177 INFO L168 Benchmark]: Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:10:09,177 INFO L168 Benchmark]: RCFGBuilder took 263.17 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:10:09,178 INFO L168 Benchmark]: BuchiAutomizer took 1120.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 928.4 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:10:09,178 INFO L168 Benchmark]: Witness Printer took 32.24 ms. Allocated memory is still 1.2 GB. Free memory is still 923.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:10:09,180 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.76 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 19.07 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 263.17 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1120.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 928.4 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * Witness Printer took 32.24 ms. Allocated memory is still 1.2 GB. Free memory is still 923.1 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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 628]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d0bfac5=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f2a089=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c65e357=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bef8b7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b9d39bd=0, root=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79d970ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6541d677=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d0bfac5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@199e13e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a4ff9bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6541d677=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c047d3b=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79d970ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d5726a8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c6843f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c60ded1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c047d3b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@181b9e3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4022c850=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4022c850=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e09a0ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2edddb4c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51e160fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@adac2d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d5726a8=0, n=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51e160fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7844f22d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bef8b7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@199e13e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4aa2a517=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d92d258=15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b9d39bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@105ba6b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c60ded1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e09a0ff=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2edddb4c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2132f41d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4aa2a517=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75be5683=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c65e357=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@181b9e3=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75be5683=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c6843f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f2a089=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 628]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.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); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, 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~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~short20, main_#t~mem24.base, main_#t~mem24.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset; [L625] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L625] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L625] havoc main_~n~0.base, main_~n~0.offset; [L626] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L627] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem24, main_~root~0, main_~n~0, main_~pred~0; [L625] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L625] main_~root~0 := main_#t~malloc0; [L625] havoc main_~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L625] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L625] ~root~0 := #t~malloc0; [L625] havoc ~n~0; [L626] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L627] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~short4;havoc main_#t~mem2.base, main_#t~mem2.offset; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L628-L646] assume !!(0 != main_#t~nondet1); [L628] havoc main_#t~nondet1; [L629] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L630] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L630] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L630] assume !main_#t~short4; [L630-L635] assume !main_#t~short4; [L630] havoc main_#t~mem3.base, main_#t~mem3.offset; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2.base, main_#t~mem2.offset; [L636] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L636-L640] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L636] havoc main_#t~mem8.base, main_#t~mem8.offset; [L636] havoc main_#t~nondet9; [L641] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L641-L645] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L641] havoc main_#t~mem13.base, main_#t~mem13.offset; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L628-L646] COND FALSE !(!(0 != main_#t~nondet1)) [L628] havoc main_#t~nondet1; [L629] main_~n~0 := main_~root~0; [L630] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L630] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(main_#t~short4) [L630-L635] COND TRUE !main_#t~short4 [L630] havoc main_#t~mem3; [L630] havoc main_#t~short4; [L630] havoc main_#t~mem2; [L636] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L636] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L636] havoc main_#t~mem8; [L636] havoc main_#t~nondet9; [L641] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L641] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L641] havoc main_#t~mem13; [L641] havoc main_#t~nondet14; [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L628-L646] COND FALSE !(!(0 != #t~nondet1)) [L628] havoc #t~nondet1; [L629] ~n~0 := ~root~0; [L630] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L630] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L630] COND FALSE !(#t~short4) [L630-L635] COND TRUE !#t~short4 [L630] havoc #t~mem3; [L630] havoc #t~short4; [L630] havoc #t~mem2; [L636] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L636] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L636] havoc #t~mem8; [L636] havoc #t~nondet9; [L641] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L641] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L641] havoc #t~mem13; [L641] havoc #t~nondet14; [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; [L626] root->left = ((void *)0) [L627] root->right = ((void *)0) Loop: [L628] COND TRUE __VERIFIER_nondet_int() [L629] n = root [L630] EXPR n->left [L630] n->left && n->right [L630] COND FALSE !(n->left && n->right) [L636] EXPR n->left [L636] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L641] EXPR n->right [L641] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...