./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b50a14aaadb91f0d2171e26e1cac3b7310be0682 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:22:37,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:22:37,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:22:37,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:22:37,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:22:37,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:22:37,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:22:37,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:22:37,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:22:37,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:22:37,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:22:37,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:22:37,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:22:37,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:22:37,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:22:37,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:22:37,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:22:37,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:22:37,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:22:37,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:22:37,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:22:37,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:22:37,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:22:37,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:22:37,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:22:37,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:22:37,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:22:37,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:22:37,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:22:37,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:22:37,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:22:37,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:22:37,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:22:37,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:22:37,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:22:37,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:22:37,598 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 14:22:37,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:22:37,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:22:37,606 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:22:37,606 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:22:37,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:22:37,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:22:37,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:22:37,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:22:37,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:22:37,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:22:37,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/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(G ! call(__VERIFIER_error())) ) 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 -> b50a14aaadb91f0d2171e26e1cac3b7310be0682 [2018-11-23 14:22:37,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:22:37,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:22:37,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:22:37,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:22:37,641 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:22:37,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-23 14:22:37,676 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/data/f29f70bb4/036b105abd1940068579319734698c2d/FLAG3166c72b0 [2018-11-23 14:22:38,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:22:38,101 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-23 14:22:38,108 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/data/f29f70bb4/036b105abd1940068579319734698c2d/FLAG3166c72b0 [2018-11-23 14:22:38,119 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/data/f29f70bb4/036b105abd1940068579319734698c2d [2018-11-23 14:22:38,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:22:38,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:22:38,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:38,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:22:38,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:22:38,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97dd10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38, skipping insertion in model container [2018-11-23 14:22:38,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:22:38,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:22:38,354 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:38,362 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:22:38,434 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:38,468 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:22:38,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38 WrapperNode [2018-11-23 14:22:38,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:38,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:38,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:22:38,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:22:38,475 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:22:38" (1/1) ... [2018-11-23 14:22:38,484 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:22:38" (1/1) ... [2018-11-23 14:22:38,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:38,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:22:38,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:22:38,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:22:38,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... [2018-11-23 14:22:38,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:22:38,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:22:38,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:22:38,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:22:38,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:22:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:22:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:22:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-23 14:22:38,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-23 14:22:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:22:38,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:22:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:22:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:22:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:22:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:22:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-23 14:22:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-23 14:22:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:22:38,549 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-23 14:22:38,549 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-23 14:22:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-23 14:22:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-23 14:22:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:22:38,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:22:38,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:22:38,862 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:22:38,862 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 14:22:38,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:38 BoogieIcfgContainer [2018-11-23 14:22:38,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:22:38,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:22:38,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:22:38,866 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:22:38,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:22:38" (1/3) ... [2018-11-23 14:22:38,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cf771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:22:38, skipping insertion in model container [2018-11-23 14:22:38,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:38" (2/3) ... [2018-11-23 14:22:38,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448cf771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:22:38, skipping insertion in model container [2018-11-23 14:22:38,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:38" (3/3) ... [2018-11-23 14:22:38,869 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-11-23 14:22:38,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:22:38,881 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:22:38,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:22:38,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:22:38,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:22:38,912 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:22:38,913 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:22:38,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:22:38,913 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:22:38,913 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:22:38,913 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:22:38,913 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:22:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-23 14:22:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:22:38,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:38,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:38,933 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:38,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1943492660, now seen corresponding path program 1 times [2018-11-23 14:22:38,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:38,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:38,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:38,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:38,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:39,032 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:22:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:22:39,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:22:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:22:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:22:39,048 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-23 14:22:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:39,064 INFO L93 Difference]: Finished difference Result 111 states and 170 transitions. [2018-11-23 14:22:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:22:39,064 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 14:22:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:39,071 INFO L225 Difference]: With dead ends: 111 [2018-11-23 14:22:39,071 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:22:39,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:22:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:22:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 14:22:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 14:22:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 14:22:39,098 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 19 [2018-11-23 14:22:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:39,099 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 14:22:39,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:22:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 14:22:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:22:39,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:39,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:39,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:39,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -882886878, now seen corresponding path program 1 times [2018-11-23 14:22:39,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:39,222 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:22:39,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:39,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:22:39,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:22:39,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:22:39,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:22:39,224 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2018-11-23 14:22:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:39,279 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-23 14:22:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:22:39,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 14:22:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:39,281 INFO L225 Difference]: With dead ends: 85 [2018-11-23 14:22:39,281 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 14:22:39,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:22:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 14:22:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 14:22:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 14:22:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 14:22:39,287 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 20 [2018-11-23 14:22:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:39,287 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 14:22:39,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:22:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 14:22:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:22:39,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:39,288 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:39,289 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:39,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1543057703, now seen corresponding path program 1 times [2018-11-23 14:22:39,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:39,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:22:39,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:39,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:22:39,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:22:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:22:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:22:39,326 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 3 states. [2018-11-23 14:22:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:39,359 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 14:22:39,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:22:39,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 14:22:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:39,360 INFO L225 Difference]: With dead ends: 70 [2018-11-23 14:22:39,360 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 14:22:39,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:22:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 14:22:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 14:22:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 14:22:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-23 14:22:39,364 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 26 [2018-11-23 14:22:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:39,364 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-23 14:22:39,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:22:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 14:22:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 14:22:39,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:39,364 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:39,365 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:39,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2140294891, now seen corresponding path program 1 times [2018-11-23 14:22:39,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:39,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:22:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:22:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:22:39,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:22:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:22:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:22:39,474 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 9 states. [2018-11-23 14:22:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:39,683 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-11-23 14:22:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:22:39,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 14:22:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:39,684 INFO L225 Difference]: With dead ends: 91 [2018-11-23 14:22:39,684 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 14:22:39,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:22:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 14:22:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-23 14:22:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 14:22:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 14:22:39,690 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 29 [2018-11-23 14:22:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 14:22:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:22:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 14:22:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 14:22:39,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:39,691 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:39,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:39,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1369121938, now seen corresponding path program 1 times [2018-11-23 14:22:39,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:22:40,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:22:40,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:22:40,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:40,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:40,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 14:22:40,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 14:22:40,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:22:40,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:22:40,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 14:22:40,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:22:40,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 14:22:40,232 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,240 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2018-11-23 14:22:40,779 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2018-11-23 14:22:40,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 749 treesize of output 550 [2018-11-23 14:22:40,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 14:22:40,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-23 14:22:40,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:40,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:22:40,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 549 treesize of output 549 [2018-11-23 14:22:40,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:40,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 137 [2018-11-23 14:22:40,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 87 [2018-11-23 14:22:41,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-23 14:22:41,091 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:22:41,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 113 [2018-11-23 14:22:41,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 123 [2018-11-23 14:22:41,116 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,125 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,129 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,155 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:41,165 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:41,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 965 treesize of output 268 [2018-11-23 14:22:41,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 14:22:41,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-23 14:22:41,259 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,265 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2018-11-23 14:22:41,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 94 [2018-11-23 14:22:41,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 157 [2018-11-23 14:22:41,327 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,348 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,361 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,375 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 137 [2018-11-23 14:22:41,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 94 [2018-11-23 14:22:41,399 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,423 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,436 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:2667, output treesize:131 [2018-11-23 14:22:41,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 116 [2018-11-23 14:22:41,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-11-23 14:22:41,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:41,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 52 [2018-11-23 14:22:41,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:41,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-11-23 14:22:41,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2018-11-23 14:22:41,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 14:22:41,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 14:22:41,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 14:22:41,665 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:41,668 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:148, output treesize:3 [2018-11-23 14:22:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:22:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:22:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 14:22:41,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 14:22:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 14:22:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-23 14:22:41,689 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 21 states. [2018-11-23 14:22:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:42,147 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-23 14:22:42,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:22:42,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-11-23 14:22:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:42,148 INFO L225 Difference]: With dead ends: 80 [2018-11-23 14:22:42,149 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 14:22:42,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-11-23 14:22:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 14:22:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-11-23 14:22:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 14:22:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-23 14:22:42,156 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 34 [2018-11-23 14:22:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:42,156 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-23 14:22:42,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 14:22:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-23 14:22:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 14:22:42,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:42,157 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:42,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:42,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1388207460, now seen corresponding path program 1 times [2018-11-23 14:22:42,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:22:42,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:22:42,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:22:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:42,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:42,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 14:22:42,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 14:22:42,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:22:42,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:22:42,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 14:22:42,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2018-11-23 14:22:42,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 142 [2018-11-23 14:22:42,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 14:22:42,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-23 14:22:42,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 130 [2018-11-23 14:22:42,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 135 [2018-11-23 14:22:42,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:42,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-23 14:22:42,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 14:22:42,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:42,642 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:42,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-23 14:22:42,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-23 14:22:42,652 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:42,658 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:42,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-11-23 14:22:42,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:42,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 14:22:42,681 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-11-23 14:22:42,702 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 14:22:42,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 14:22:42,730 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:935, output treesize:137 [2018-11-23 14:22:44,840 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 14:22:45,707 WARN L180 SmtUtils]: Spent 835.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 14:22:45,895 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 14:22:47,990 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 14:22:48,310 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 14:22:48,436 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 14:22:48,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-11-23 14:22:48,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:48,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 14:22:48,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 14:22:48,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2018-11-23 14:22:48,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 14:22:48,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:48,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 29 [2018-11-23 14:22:48,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 14:22:48,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:22:48,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-11-23 14:22:48,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 14:22:48,539 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:22:48,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 14:22:48,545 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:48,559 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:158, output treesize:4 [2018-11-23 14:22:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:22:48,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:22:48,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 14:22:48,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 14:22:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 14:22:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-11-23 14:22:48,587 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 21 states. [2018-11-23 14:22:51,002 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 81 [2018-11-23 14:22:51,532 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-23 14:22:52,119 WARN L180 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-23 14:22:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:22:52,202 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-11-23 14:22:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 14:22:52,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-11-23 14:22:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:22:52,203 INFO L225 Difference]: With dead ends: 92 [2018-11-23 14:22:52,203 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 14:22:52,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-11-23 14:22:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 14:22:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-23 14:22:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 14:22:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-23 14:22:52,212 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 34 [2018-11-23 14:22:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:22:52,212 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-23 14:22:52,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 14:22:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-23 14:22:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 14:22:52,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:22:52,213 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:22:52,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:22:52,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1783043061, now seen corresponding path program 1 times [2018-11-23 14:22:52,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:22:52,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:22:52,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:52,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:22:52,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:22:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:52,265 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=47, |#NULL.offset|=43, |old(#NULL.base)|=47, |old(#NULL.offset)|=43] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=47, |old(#NULL.offset)|=43] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=47, |old(#NULL.offset)|=43] [?] RET #196#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret24 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~nondet7|=1] [?] assume !!(0 != #t~nondet7);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0, |create_tree_#t~nondet7|=0] [?] assume !(0 != #t~nondet7);havoc #t~nondet7; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !!(~node~0.base != 0 || ~node~0.offset != 0);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~node~0.base != 0 || ~node~0.offset != 0); VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#res.base|=49, |create_tree_#res.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume true; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#res.base|=49, |create_tree_#res.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] RET #184#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret23.base|=49, |main_#t~ret23.offset|=0] [?] ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; VAL [main_~data~0.base=49, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [main_~data~0.base=49, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call inspect(~data~0.base, ~data~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] ~node.base, ~node.offset := #in~node.base, #in~node.offset; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] assume !(~node.base == 0 && ~node.offset == 0); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] goto; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] assume !!(~node.base != 0 || ~node.offset != 0);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0, |inspect_#t~mem2.base|=56, |inspect_#t~mem2.offset|=0] [?] assume #t~mem2.base != 0 || #t~mem2.offset != 0;havoc #t~mem2.base, #t~mem2.offset; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4);call #t~mem4 := read~int(#t~mem3.base, 12 + #t~mem3.offset, 4); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0, |inspect_#t~mem3.base|=56, |inspect_#t~mem3.offset|=0, |inspect_#t~mem4|=42] [?] assume !!(42 == #t~mem4);havoc #t~mem3.base, #t~mem3.offset;havoc #t~mem4; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] goto; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] call #t~mem5 := read~int(~node.base, 12 + ~node.offset, 4); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0, |inspect_#t~mem5|=0] [?] assume 0 == #t~mem5;havoc #t~mem5; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] CALL call fail(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=47, #NULL.offset=43, old(#NULL.base)=47, old(#NULL.offset)=43] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L619] CALL call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0] [L574] ~nodelast~0.base, ~nodelast~0.offset := 0, 0; [L575] ~node~0.base, ~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=1, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576-L587] assume !!(0 != #t~nondet7); [L576] havoc #t~nondet7; [L577] call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16); [L577] ~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L578-L579] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L580] call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4); [L581] call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L582-L583] assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4); [L586] ~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, #t~nondet7=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576-L587] assume !(0 != #t~nondet7); [L576] havoc #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !!(~node~0.base != 0 || ~node~0.offset != 0); [L589] call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L590-L591] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L592] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4); [L592] havoc #t~mem11.base, #t~mem11.offset; [L593] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4); [L593] havoc #t~mem12.base, #t~mem12.offset; [L594] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L594] call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4); [L594] havoc #t~mem13.base, #t~mem13.offset; [L595] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L595] call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4); [L595] havoc #t~mem14.base, #t~mem14.offset; [L596] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4); [L596] ~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset; [L596] havoc #t~mem15.base, #t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !(~node~0.base != 0 || ~node~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L598] #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L572-L599] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L619] RET call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret23.base=49, #t~ret23.offset=0] [L619] ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset; [L619] havoc #t~ret23.base, #t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L620-L621] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L622] CALL call inspect(~data~0.base, ~data~0.offset); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0] [L562-L571] ~node.base, ~node.offset := #in~node.base, #in~node.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L564] assume !(~node.base == 0 && ~node.offset == 0); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L565-L570] assume !!(~node.base != 0 || ~node.offset != 0); [L566] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2.base=56, #t~mem2.offset=0, ~node.base=49, ~node.offset=0] [L566-L567] assume #t~mem2.base != 0 || #t~mem2.offset != 0; [L566] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L567] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4); [L567] call #t~mem4 := read~int(#t~mem3.base, 12 + #t~mem3.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem3.base=56, #t~mem3.offset=0, #t~mem4=42, ~node.base=49, ~node.offset=0] [L567] assume !!(42 == #t~mem4); [L567] havoc #t~mem3.base, #t~mem3.offset; [L567] havoc #t~mem4; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] call #t~mem5 := read~int(~node.base, 12 + ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem5=0, ~node.base=49, ~node.offset=0] [L568] assume 0 == #t~mem5; [L568] havoc #t~mem5; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=47, #NULL.offset=43, old(#NULL.base)=47, old(#NULL.offset)=43] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L619] CALL call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0] [L574] ~nodelast~0.base, ~nodelast~0.offset := 0, 0; [L575] ~node~0.base, ~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=1, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576-L587] assume !!(0 != #t~nondet7); [L576] havoc #t~nondet7; [L577] call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16); [L577] ~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L578-L579] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L580] call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4); [L581] call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L582-L583] assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4); [L586] ~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, #t~nondet7=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576-L587] assume !(0 != #t~nondet7); [L576] havoc #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !!(~node~0.base != 0 || ~node~0.offset != 0); [L589] call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L590-L591] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L592] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4); [L592] havoc #t~mem11.base, #t~mem11.offset; [L593] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4); [L593] havoc #t~mem12.base, #t~mem12.offset; [L594] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L594] call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4); [L594] havoc #t~mem13.base, #t~mem13.offset; [L595] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L595] call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4); [L595] havoc #t~mem14.base, #t~mem14.offset; [L596] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4); [L596] ~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset; [L596] havoc #t~mem15.base, #t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !(~node~0.base != 0 || ~node~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L598] #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L572-L599] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L619] RET call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret23.base=49, #t~ret23.offset=0] [L619] ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset; [L619] havoc #t~ret23.base, #t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L620-L621] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L622] CALL call inspect(~data~0.base, ~data~0.offset); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0] [L562-L571] ~node.base, ~node.offset := #in~node.base, #in~node.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L564] assume !(~node.base == 0 && ~node.offset == 0); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L565-L570] assume !!(~node.base != 0 || ~node.offset != 0); [L566] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2.base=56, #t~mem2.offset=0, ~node.base=49, ~node.offset=0] [L566-L567] assume #t~mem2.base != 0 || #t~mem2.offset != 0; [L566] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L567] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4); [L567] call #t~mem4 := read~int(#t~mem3.base, 12 + #t~mem3.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem3.base=56, #t~mem3.offset=0, #t~mem4=42, ~node.base=49, ~node.offset=0] [L567] assume !!(42 == #t~mem4); [L567] havoc #t~mem3.base, #t~mem3.offset; [L567] havoc #t~mem4; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] call #t~mem5 := read~int(~node.base, 12 + ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem5=0, ~node.base=49, ~node.offset=0] [L568] assume 0 == #t~mem5; [L568] havoc #t~mem5; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL, EXPR create_tree() [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L578] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L580] node->left = ((void *)0) [L581] node->right = nodelast VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L582] COND FALSE !(\read(*nodelast)) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={49:0}, value=0] [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={49:0}, nodelast={49:0}, value=0] [L590] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={49:0}, nodelast={49:0}, value=0] [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={0:0}, nodelast={49:0}, value=0] [L598] return nodelast; VAL [\result={49:0}, malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={0:0}, nodelast={49:0}, value=0] [L619] RET, EXPR create_tree() VAL [create_tree()={49:0}] [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) VAL [data={49:0}] [L622] CALL inspect(data) VAL [node={49:0}] [L564] COND FALSE !(!(node)) VAL [node={49:0}, node={49:0}] [L565] COND TRUE node != ((void *)0) [L566] node->left VAL [node={49:0}, node={49:0}, node->left={56:0}] [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value VAL [node={49:0}, node={49:0}, node->left={56:0}, node->left->value=42] [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value VAL [node={49:0}, node={49:0}, node->value=0] [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() ----- [2018-11-23 14:22:52,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:22:52 BoogieIcfgContainer [2018-11-23 14:22:52,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:22:52,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:22:52,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:22:52,326 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:22:52,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:38" (3/4) ... [2018-11-23 14:22:52,328 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=47, |#NULL.offset|=43, |old(#NULL.base)|=47, |old(#NULL.offset)|=43] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=47, |old(#NULL.offset)|=43] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=47, |old(#NULL.offset)|=43] [?] RET #196#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret24 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~nondet7|=1] [?] assume !!(0 != #t~nondet7);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); VAL [create_tree_~nodelast~0.base=0, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0, |create_tree_#t~nondet7|=0] [?] assume !(0 != #t~nondet7);havoc #t~nondet7; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !!(~node~0.base != 0 || ~node~0.offset != 0);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=49, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume !(~node~0.base != 0 || ~node~0.offset != 0); VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#res.base|=49, |create_tree_#res.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] assume true; VAL [create_tree_~nodelast~0.base=49, create_tree_~nodelast~0.offset=0, create_tree_~node~0.base=0, create_tree_~node~0.offset=0, create_tree_~value~0=0, |#NULL.base|=0, |#NULL.offset|=0, |create_tree_#res.base|=49, |create_tree_#res.offset|=0, |create_tree_#t~malloc10.base|=56, |create_tree_#t~malloc10.offset|=0, |create_tree_#t~malloc8.base|=49, |create_tree_#t~malloc8.offset|=0] [?] RET #184#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret23.base|=49, |main_#t~ret23.offset|=0] [?] ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; VAL [main_~data~0.base=49, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [main_~data~0.base=49, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call inspect(~data~0.base, ~data~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] ~node.base, ~node.offset := #in~node.base, #in~node.offset; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] assume !(~node.base == 0 && ~node.offset == 0); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] goto; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] assume !!(~node.base != 0 || ~node.offset != 0);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0, |inspect_#t~mem2.base|=56, |inspect_#t~mem2.offset|=0] [?] assume #t~mem2.base != 0 || #t~mem2.offset != 0;havoc #t~mem2.base, #t~mem2.offset; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4);call #t~mem4 := read~int(#t~mem3.base, 12 + #t~mem3.offset, 4); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0, |inspect_#t~mem3.base|=56, |inspect_#t~mem3.offset|=0, |inspect_#t~mem4|=42] [?] assume !!(42 == #t~mem4);havoc #t~mem3.base, #t~mem3.offset;havoc #t~mem4; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] goto; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] call #t~mem5 := read~int(~node.base, 12 + ~node.offset, 4); VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0, |inspect_#t~mem5|=0] [?] assume 0 == #t~mem5;havoc #t~mem5; VAL [inspect_~node.base=49, inspect_~node.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_#in~node.base|=49, |inspect_#in~node.offset|=0] [?] CALL call fail(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=47, #NULL.offset=43, old(#NULL.base)=47, old(#NULL.offset)=43] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L619] CALL call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0] [L574] ~nodelast~0.base, ~nodelast~0.offset := 0, 0; [L575] ~node~0.base, ~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=1, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576-L587] assume !!(0 != #t~nondet7); [L576] havoc #t~nondet7; [L577] call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16); [L577] ~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L578-L579] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L580] call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4); [L581] call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L582-L583] assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4); [L586] ~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, #t~nondet7=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576-L587] assume !(0 != #t~nondet7); [L576] havoc #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !!(~node~0.base != 0 || ~node~0.offset != 0); [L589] call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L590-L591] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L592] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4); [L592] havoc #t~mem11.base, #t~mem11.offset; [L593] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4); [L593] havoc #t~mem12.base, #t~mem12.offset; [L594] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L594] call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4); [L594] havoc #t~mem13.base, #t~mem13.offset; [L595] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L595] call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4); [L595] havoc #t~mem14.base, #t~mem14.offset; [L596] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4); [L596] ~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset; [L596] havoc #t~mem15.base, #t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !(~node~0.base != 0 || ~node~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L598] #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L572-L599] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L619] RET call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret23.base=49, #t~ret23.offset=0] [L619] ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset; [L619] havoc #t~ret23.base, #t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L620-L621] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L622] CALL call inspect(~data~0.base, ~data~0.offset); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0] [L562-L571] ~node.base, ~node.offset := #in~node.base, #in~node.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L564] assume !(~node.base == 0 && ~node.offset == 0); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L565-L570] assume !!(~node.base != 0 || ~node.offset != 0); [L566] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2.base=56, #t~mem2.offset=0, ~node.base=49, ~node.offset=0] [L566-L567] assume #t~mem2.base != 0 || #t~mem2.offset != 0; [L566] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L567] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4); [L567] call #t~mem4 := read~int(#t~mem3.base, 12 + #t~mem3.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem3.base=56, #t~mem3.offset=0, #t~mem4=42, ~node.base=49, ~node.offset=0] [L567] assume !!(42 == #t~mem4); [L567] havoc #t~mem3.base, #t~mem3.offset; [L567] havoc #t~mem4; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] call #t~mem5 := read~int(~node.base, 12 + ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem5=0, ~node.base=49, ~node.offset=0] [L568] assume 0 == #t~mem5; [L568] havoc #t~mem5; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=47, #NULL.offset=43, old(#NULL.base)=47, old(#NULL.offset)=43] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=47, old(#NULL.offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L619] CALL call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0] [L574] ~nodelast~0.base, ~nodelast~0.offset := 0, 0; [L575] ~node~0.base, ~node~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=1, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0] [L576-L587] assume !!(0 != #t~nondet7); [L576] havoc #t~nondet7; [L577] call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16); [L577] ~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L578-L579] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L580] call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset, 4); [L581] call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, 4 + ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L582-L583] assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=0, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] call write~int(~value~0, ~node~0.base, 12 + ~node~0.offset, 4); [L586] ~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, #t~nondet7=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L576-L587] assume !(0 != #t~nondet7); [L576] havoc #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !!(~node~0.base != 0 || ~node~0.offset != 0); [L589] call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16); [L589] call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L590-L591] assume !(~node~0.base == 0 && ~node~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=49, ~node~0.offset=0, ~value~0=0] [L592] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L592] call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset, 4); [L592] havoc #t~mem11.base, #t~mem11.offset; [L593] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L593] call write~$Pointer$(0, 0, #t~mem12.base, 4 + #t~mem12.offset, 4); [L593] havoc #t~mem12.base, #t~mem12.offset; [L594] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L594] call write~int(42, #t~mem13.base, 12 + #t~mem13.offset, 4); [L594] havoc #t~mem13.base, #t~mem13.offset; [L595] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset, 4); [L595] call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, 8 + #t~mem14.offset, 4); [L595] havoc #t~mem14.base, #t~mem14.offset; [L596] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, 4 + ~node~0.offset, 4); [L596] ~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset; [L596] havoc #t~mem15.base, #t~mem15.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L588-L597] assume !(~node~0.base != 0 || ~node~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L598] #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L572-L599] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=49, #res.offset=0, #t~malloc10.base=56, #t~malloc10.offset=0, #t~malloc8.base=49, #t~malloc8.offset=0, ~nodelast~0.base=49, ~nodelast~0.offset=0, ~node~0.base=0, ~node~0.offset=0, ~value~0=0] [L619] RET call #t~ret23.base, #t~ret23.offset := create_tree(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret23.base=49, #t~ret23.offset=0] [L619] ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset; [L619] havoc #t~ret23.base, #t~ret23.offset; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L620-L621] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=49, ~data~0.offset=0] [L622] CALL call inspect(~data~0.base, ~data~0.offset); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0] [L562-L571] ~node.base, ~node.offset := #in~node.base, #in~node.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L564] assume !(~node.base == 0 && ~node.offset == 0); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L565-L570] assume !!(~node.base != 0 || ~node.offset != 0); [L566] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~node.base, ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2.base=56, #t~mem2.offset=0, ~node.base=49, ~node.offset=0] [L566-L567] assume #t~mem2.base != 0 || #t~mem2.offset != 0; [L566] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L567] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~node.base, ~node.offset, 4); [L567] call #t~mem4 := read~int(#t~mem3.base, 12 + #t~mem3.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem3.base=56, #t~mem3.offset=0, #t~mem4=42, ~node.base=49, ~node.offset=0] [L567] assume !!(42 == #t~mem4); [L567] havoc #t~mem3.base, #t~mem3.offset; [L567] havoc #t~mem4; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] call #t~mem5 := read~int(~node.base, 12 + ~node.offset, 4); VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem5=0, ~node.base=49, ~node.offset=0] [L568] assume 0 == #t~mem5; [L568] havoc #t~mem5; VAL [#in~node.base=49, #in~node.offset=0, #NULL.base=0, #NULL.offset=0, ~node.base=49, ~node.offset=0] [L568] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=47, #NULL!offset=43, old(#NULL!base)=47, old(#NULL!offset)=43] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=47, old(#NULL!offset)=43] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0] [L574] ~nodelast~0 := { base: 0, offset: 0 }; [L575] ~node~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=1, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0] [L576-L587] COND FALSE !(!(0 != #t~nondet7)) [L576] havoc #t~nondet7; [L577] FCALL call #t~malloc8 := #Ultimate.alloc(16); [L577] ~node~0 := #t~malloc8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L578] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L580] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~node~0!base, offset: ~node~0!offset }, 4); [L581] FCALL call write~$Pointer$(~nodelast~0, { base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L582-L583] COND FALSE !(~nodelast~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=0, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0] [L584] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L584] ~value~0 := #t~nondet9; [L584] havoc #t~nondet9; [L585] FCALL call write~int(~value~0, { base: ~node~0!base, offset: 12 + ~node~0!offset }, 4); [L586] ~nodelast~0 := ~node~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, #t~nondet7=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L576-L587] COND TRUE !(0 != #t~nondet7) [L576] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L588-L597] COND FALSE !(!(~node~0 != { base: 0, offset: 0 })) [L589] FCALL call #t~malloc10 := #Ultimate.alloc(16); [L589] FCALL call write~$Pointer$(#t~malloc10, { base: ~node~0!base, offset: ~node~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L590] COND FALSE !(~node~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=49, ~node~0!offset=0, ~value~0=0] [L592] FCALL call #t~mem11 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L592] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L592] havoc #t~mem11; [L593] FCALL call #t~mem12 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L593] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem12!base, offset: 4 + #t~mem12!offset }, 4); [L593] havoc #t~mem12; [L594] FCALL call #t~mem13 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L594] FCALL call write~int(42, { base: #t~mem13!base, offset: 12 + #t~mem13!offset }, 4); [L594] havoc #t~mem13; [L595] FCALL call #t~mem14 := read~$Pointer$({ base: ~node~0!base, offset: ~node~0!offset }, 4); [L595] FCALL call write~$Pointer$(~node~0, { base: #t~mem14!base, offset: 8 + #t~mem14!offset }, 4); [L595] havoc #t~mem14; [L596] FCALL call #t~mem15 := read~$Pointer$({ base: ~node~0!base, offset: 4 + ~node~0!offset }, 4); [L596] ~node~0 := #t~mem15; [L596] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L588-L597] COND TRUE !(~node~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L598] #res := ~nodelast~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=49, #res!offset=0, #t~malloc10!base=56, #t~malloc10!offset=0, #t~malloc8!base=49, #t~malloc8!offset=0, ~nodelast~0!base=49, ~nodelast~0!offset=0, ~node~0!base=0, ~node~0!offset=0, ~value~0=0] [L619] RET call #t~ret23 := create_tree(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret23!base=49, #t~ret23!offset=0] [L619] ~data~0 := #t~ret23; [L619] havoc #t~ret23; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L620] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=49, ~data~0!offset=0] [L622] CALL call inspect(~data~0); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0] [L562-L571] ~node := #in~node; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L564] COND FALSE !(~node == { base: 0, offset: 0 }) VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L565-L570] COND FALSE !(!(~node != { base: 0, offset: 0 })) [L566] FCALL call #t~mem2 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2!base=56, #t~mem2!offset=0, ~node!base=49, ~node!offset=0] [L566-L567] COND TRUE #t~mem2 != { base: 0, offset: 0 } [L566] havoc #t~mem2; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L567] FCALL call #t~mem3 := read~$Pointer$({ base: ~node!base, offset: ~node!offset }, 4); [L567] FCALL call #t~mem4 := read~int({ base: #t~mem3!base, offset: 12 + #t~mem3!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem3!base=56, #t~mem3!offset=0, #t~mem4=42, ~node!base=49, ~node!offset=0] [L567] COND FALSE !(!(42 == #t~mem4)) [L567] havoc #t~mem3; [L567] havoc #t~mem4; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] FCALL call #t~mem5 := read~int({ base: ~node!base, offset: 12 + ~node!offset }, 4); VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem5=0, ~node!base=49, ~node!offset=0] [L568] COND TRUE 0 == #t~mem5 [L568] havoc #t~mem5; VAL [#in~node!base=49, #in~node!offset=0, #NULL!base=0, #NULL!offset=0, ~node!base=49, ~node!offset=0] [L568] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L619] CALL, EXPR create_tree() [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L578] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L580] node->left = ((void *)0) [L581] node->right = nodelast VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L582] COND FALSE !(\read(*nodelast)) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={49:0}, value=0] [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={49:0}, nodelast={49:0}, value=0] [L590] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={49:0}, nodelast={49:0}, value=0] [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={0:0}, nodelast={49:0}, value=0] [L598] return nodelast; VAL [\result={49:0}, malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={0:0}, nodelast={49:0}, value=0] [L619] RET, EXPR create_tree() VAL [create_tree()={49:0}] [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) VAL [data={49:0}] [L622] CALL inspect(data) VAL [node={49:0}] [L564] COND FALSE !(!(node)) VAL [node={49:0}, node={49:0}] [L565] COND TRUE node != ((void *)0) [L566] node->left VAL [node={49:0}, node={49:0}, node->left={56:0}] [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value VAL [node={49:0}, node={49:0}, node->left={56:0}, node->left->value=42] [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value VAL [node={49:0}, node={49:0}, node->value=0] [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() ----- [2018-11-23 14:22:52,518 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0178ce7d-b422-4eb5-95d8-60bfd2c9aa99/bin-2019/uautomizer/witness.graphml [2018-11-23 14:22:52,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:22:52,519 INFO L168 Benchmark]: Toolchain (without parser) took 14397.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 956.6 MB in the beginning and 879.7 MB in the end (delta: 76.9 MB). Peak memory consumption was 255.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:52,520 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:22:52,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:52,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.92 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:22:52,520 INFO L168 Benchmark]: Boogie Preprocessor took 23.24 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:52,521 INFO L168 Benchmark]: RCFGBuilder took 350.10 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: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:52,521 INFO L168 Benchmark]: TraceAbstraction took 13462.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 889.4 MB in the end (delta: 192.5 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:52,521 INFO L168 Benchmark]: Witness Printer took 192.79 ms. Allocated memory is still 1.2 GB. Free memory was 889.4 MB in the beginning and 879.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:52,523 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.24 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 350.10 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: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13462.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 889.4 MB in the end (delta: 192.5 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. * Witness Printer took 192.79 ms. Allocated memory is still 1.2 GB. Free memory was 889.4 MB in the beginning and 879.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L619] CALL, EXPR create_tree() [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L578] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L580] node->left = ((void *)0) [L581] node->right = nodelast VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L582] COND FALSE !(\read(*nodelast)) VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={0:0}] [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value [L586] nodelast = node VAL [malloc(sizeof *node)={49:0}, node={49:0}, nodelast={49:0}, value=0] [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={49:0}, nodelast={49:0}, value=0] [L590] COND FALSE !(!node) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={49:0}, nodelast={49:0}, value=0] [L592] EXPR node->left [L592] node->left->left = ((void *)0) [L593] EXPR node->left [L593] node->left->right = ((void *)0) [L594] EXPR node->left [L594] node->left->value = 42 [L595] EXPR node->left [L595] node->left->parent = node [L596] EXPR node->right [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) VAL [malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={0:0}, nodelast={49:0}, value=0] [L598] return nodelast; VAL [\result={49:0}, malloc(sizeof *node)={49:0}, malloc(sizeof *node)={56:0}, node={0:0}, nodelast={49:0}, value=0] [L619] RET, EXPR create_tree() VAL [create_tree()={49:0}] [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) VAL [data={49:0}] [L622] CALL inspect(data) VAL [node={49:0}] [L564] COND FALSE !(!(node)) VAL [node={49:0}, node={49:0}] [L565] COND TRUE node != ((void *)0) [L566] node->left VAL [node={49:0}, node={49:0}, node->left={56:0}] [L566] COND TRUE node->left [L567] EXPR node->left [L567] EXPR node->left->value VAL [node={49:0}, node={49:0}, node->left={56:0}, node->left->value=42] [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value VAL [node={49:0}, node={49:0}, node->value=0] [L568] COND TRUE !(node->value) [L568] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 60 locations, 1 error locations. UNSAFE Result, 13.4s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 238 SDtfs, 148 SDslu, 1071 SDs, 0 SdLazy, 809 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 222 ConstructedInterpolants, 11 QuantifiedInterpolants, 161265 SizeOfPredicates, 24 NumberOfNonLiveVariables, 316 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 13/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...