./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.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_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/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 dfa29c268b4cea6214da8605085222e43705cbc6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:33:30,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:33:30,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:33:30,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:33:30,718 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:33:30,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:33:30,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:33:30,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:33:30,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:33:30,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:33:30,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:33:30,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:33:30,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:33:30,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:33:30,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:33:30,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:33:30,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:33:30,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:33:30,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:33:30,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:33:30,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:33:30,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:33:30,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:33:30,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:33:30,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:33:30,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:33:30,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:33:30,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:33:30,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:33:30,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:33:30,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:33:30,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:33:30,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:33:30,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:33:30,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:33:30,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:33:30,737 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:33:30,746 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:33:30,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:33:30,747 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:33:30,747 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:33:30,747 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:33:30,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:33:30,748 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:33:30,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:33:30,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:33:30,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:33:30,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:33:30,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:33:30,751 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_f5ae5f99-23a3-4b45-8e56-b77e065129ca/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 -> dfa29c268b4cea6214da8605085222e43705cbc6 [2018-11-23 02:33:30,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:33:30,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:33:30,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:33:30,785 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:33:30,786 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:33:30,786 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 02:33:30,831 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/data/9bf890880/2bae395be19e4343bfed31567ece14e6/FLAG916824543 [2018-11-23 02:33:31,268 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:33:31,269 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/sv-benchmarks/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 02:33:31,276 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/data/9bf890880/2bae395be19e4343bfed31567ece14e6/FLAG916824543 [2018-11-23 02:33:31,285 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/data/9bf890880/2bae395be19e4343bfed31567ece14e6 [2018-11-23 02:33:31,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:33:31,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:33:31,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:33:31,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:33:31,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:33:31,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31, skipping insertion in model container [2018-11-23 02:33:31,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:33:31,326 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:33:31,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:33:31,513 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:33:31,576 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:33:31,603 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:33:31,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31 WrapperNode [2018-11-23 02:33:31,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:33:31,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:33:31,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:33:31,604 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:33:31,611 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:33:31" (1/1) ... [2018-11-23 02:33:31,623 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:33:31" (1/1) ... [2018-11-23 02:33:31,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:33:31,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:33:31,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:33:31,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:33:31,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... [2018-11-23 02:33:31,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:33:31,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:33:31,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:33:31,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:33:31,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/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 02:33:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:33:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:33:31,698 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 02:33:31,698 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 02:33:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:33:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:33:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:33:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:33:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:33:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 02:33:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 02:33:31,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:33:31,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:33:31,895 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:33:31,895 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 02:33:31,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:31 BoogieIcfgContainer [2018-11-23 02:33:31,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:33:31,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:33:31,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:33:31,898 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:33:31,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:33:31" (1/3) ... [2018-11-23 02:33:31,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe7d120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:31, skipping insertion in model container [2018-11-23 02:33:31,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:33:31" (2/3) ... [2018-11-23 02:33:31,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe7d120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:33:31, skipping insertion in model container [2018-11-23 02:33:31,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:31" (3/3) ... [2018-11-23 02:33:31,901 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 02:33:31,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:33:31,916 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:33:31,930 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:33:31,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:33:31,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:33:31,948 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:33:31,949 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:33:31,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:33:31,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:33:31,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:33:31,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:33:31,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:33:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 02:33:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:33:31,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:31,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:31,966 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:31,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1541418343, now seen corresponding path program 1 times [2018-11-23 02:33:31,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:33:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:33:32,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:32,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:32,060 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 02:33:32,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:33:32,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:33:32,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:33:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:33:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:33:32,073 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 02:33:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:32,085 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 02:33:32,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:33:32,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 02:33:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:32,090 INFO L225 Difference]: With dead ends: 38 [2018-11-23 02:33:32,090 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 02:33:32,092 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 02:33:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 02:33:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 02:33:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 02:33:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 02:33:32,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 02:33:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:32,114 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 02:33:32,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:33:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 02:33:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 02:33:32,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:32,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:32,115 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:32,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash 96690808, now seen corresponding path program 1 times [2018-11-23 02:33:32,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:33:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:33:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:32,189 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 02:33:32,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:33:32,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:33:32,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:33:32,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:33:32,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:33:32,191 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-23 02:33:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:32,297 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 02:33:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:33:32,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 02:33:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:32,298 INFO L225 Difference]: With dead ends: 33 [2018-11-23 02:33:32,298 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 02:33:32,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:33:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 02:33:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 02:33:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 02:33:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 02:33:32,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2018-11-23 02:33:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:32,304 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 02:33:32,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:33:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 02:33:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 02:33:32,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:32,305 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:32,306 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:32,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1402379173, now seen corresponding path program 1 times [2018-11-23 02:33:32,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:33:32,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:33:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:33:32,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:33:32,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/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 02:33:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:32,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:32,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:33:32,516 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 02:33:32,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,533 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:33:32,535 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 02:33:32,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 02:33:32,569 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 15 treesize of output 11 [2018-11-23 02:33:32,573 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 02:33:32,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,594 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 15 treesize of output 11 [2018-11-23 02:33:32,597 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 02:33:32,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:33:32,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 02:33:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:33:32,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:33:32,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 02:33:32,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:33:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:33:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:33:32,631 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 02:33:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:32,685 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 02:33:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:33:32,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 02:33:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:32,686 INFO L225 Difference]: With dead ends: 37 [2018-11-23 02:33:32,686 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 02:33:32,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:33:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 02:33:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 02:33:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:33:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 02:33:32,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 02:33:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:32,690 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 02:33:32,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:33:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 02:33:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:33:32,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:32,691 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:33:32,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:32,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1367734753, now seen corresponding path program 1 times [2018-11-23 02:33:32,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:33:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:33:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:33:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:33:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:33:32,736 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] RET #66#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~mem4|=1] [?] assume 2 != #t~mem4;havoc #t~mem4; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L628] COND FALSE !(a == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, p={15:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L635] COND FALSE !(t == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, p->h=1, t={20:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] ----- [2018-11-23 02:33:32,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:33:32 BoogieIcfgContainer [2018-11-23 02:33:32,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:33:32,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:33:32,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:33:32,779 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:33:32,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:33:31" (3/4) ... [2018-11-23 02:33:32,782 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|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] RET #66#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~mem4|=1] [?] assume 2 != #t~mem4;havoc #t~mem4; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L628] COND FALSE !(a == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, p={15:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L635] COND FALSE !(t == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, p->h=1, t={20:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] ----- [2018-11-23 02:33:32,835 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5ae5f99-23a3-4b45-8e56-b77e065129ca/bin-2019/uautomizer/witness.graphml [2018-11-23 02:33:32,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:33:32,836 INFO L168 Benchmark]: Toolchain (without parser) took 1548.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.1 MB in the beginning and 979.8 MB in the end (delta: -28.7 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:33:32,836 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:33:32,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:33:32,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.23 ms. Allocated memory is still 1.1 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 02:33:32,837 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:33:32,838 INFO L168 Benchmark]: RCFGBuilder took 241.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:33:32,838 INFO L168 Benchmark]: TraceAbstraction took 882.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.1 MB in the end (delta: 88.9 MB). Peak memory consumption was 88.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:33:32,838 INFO L168 Benchmark]: Witness Printer took 56.54 ms. Allocated memory is still 1.1 GB. Free memory was 985.1 MB in the beginning and 979.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:33:32,839 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.23 ms. Allocated memory is still 1.1 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. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 882.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.1 MB in the end (delta: 88.9 MB). Peak memory consumption was 88.9 MB. Max. memory is 11.5 GB. * Witness Printer took 56.54 ms. Allocated memory is still 1.1 GB. Free memory was 985.1 MB in the beginning and 979.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 644]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L628] COND FALSE !(a == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, p={15:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L635] COND FALSE !(t == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, p->h=1, t={20:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 39 SDslu, 75 SDs, 0 SdLazy, 54 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 4363 SizeOfPredicates, 7 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...