./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_flag_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_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/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 6ebd5b9a3160cad0f8876c1414f4b918e994ed8d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:55:23,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:55:23,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:55:23,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:55:23,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:55:23,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:55:23,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:55:23,530 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:55:23,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:55:23,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:55:23,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:55:23,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:55:23,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:55:23,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:55:23,535 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:55:23,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:55:23,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:55:23,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:55:23,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:55:23,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:55:23,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:55:23,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:55:23,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:55:23,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:55:23,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:55:23,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:55:23,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:55:23,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:55:23,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:55:23,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:55:23,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:55:23,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:55:23,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:55:23,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:55:23,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:55:23,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:55:23,550 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:55:23,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:55:23,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:55:23,561 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:55:23,561 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:55:23,562 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:55:23,562 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:55:23,562 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:55:23,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:55:23,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:55:23,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:55:23,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:55:23,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:55:23,563 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:55:23,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:55:23,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:55:23,564 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:55:23,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:55:23,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:55:23,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:55:23,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:55:23,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:55:23,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:55:23,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:55:23,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:55:23,565 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_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/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 -> 6ebd5b9a3160cad0f8876c1414f4b918e994ed8d [2018-11-23 07:55:23,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:55:23,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:55:23,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:55:23,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:55:23,603 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:55:23,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 07:55:23,649 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/data/45e9095b5/f3761d0f1fb643b085d3ab796832cb77/FLAG15322fc99 [2018-11-23 07:55:24,016 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:55:24,017 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/sv-benchmarks/c/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 07:55:24,026 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/data/45e9095b5/f3761d0f1fb643b085d3ab796832cb77/FLAG15322fc99 [2018-11-23 07:55:24,413 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/data/45e9095b5/f3761d0f1fb643b085d3ab796832cb77 [2018-11-23 07:55:24,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:55:24,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:55:24,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:55:24,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:55:24,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:55:24,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762406c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24, skipping insertion in model container [2018-11-23 07:55:24,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:55:24,461 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:55:24,647 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:55:24,655 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:55:24,684 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:55:24,758 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:55:24,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24 WrapperNode [2018-11-23 07:55:24,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:55:24,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:55:24,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:55:24,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:55:24,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:55:24,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:55:24,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:55:24,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:55:24,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... [2018-11-23 07:55:24,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:55:24,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:55:24,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:55:24,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:55:24,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/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 07:55:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:55:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:55:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 07:55:24,833 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 07:55:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:55:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:55:24,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:55:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:55:24,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:55:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 07:55:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 07:55:24,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:55:24,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:55:24,988 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:55:24,989 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 07:55:24,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:55:24 BoogieIcfgContainer [2018-11-23 07:55:24,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:55:24,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:55:24,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:55:24,992 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:55:24,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:55:24" (1/3) ... [2018-11-23 07:55:24,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6389071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:55:24, skipping insertion in model container [2018-11-23 07:55:24,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:55:24" (2/3) ... [2018-11-23 07:55:24,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6389071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:55:24, skipping insertion in model container [2018-11-23 07:55:24,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:55:24" (3/3) ... [2018-11-23 07:55:24,995 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 07:55:25,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:55:25,006 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:55:25,015 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:55:25,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:55:25,037 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:55:25,037 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:55:25,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:55:25,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:55:25,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:55:25,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:55:25,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:55:25,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:55:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 07:55:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:55:25,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:55:25,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:55:25,058 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:55:25,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:55:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1959867314, now seen corresponding path program 1 times [2018-11-23 07:55:25,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:55:25,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:55:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:55:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:55:25,142 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 07:55:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:55:25,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:55:25,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 07:55:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:55:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:55:25,157 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 07:55:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:55:25,169 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-23 07:55:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:55:25,170 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 07:55:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:55:25,174 INFO L225 Difference]: With dead ends: 46 [2018-11-23 07:55:25,175 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 07:55:25,177 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 07:55:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 07:55:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 07:55:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 07:55:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 07:55:25,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-11-23 07:55:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:55:25,199 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 07:55:25,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 07:55:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 07:55:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 07:55:25,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:55:25,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:55:25,200 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:55:25,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:55:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1959498088, now seen corresponding path program 1 times [2018-11-23 07:55:25,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:55:25,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:55:25,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:55:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:55:25,304 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 07:55:25,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:55:25,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:55:25,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:55:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:55:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:55:25,307 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2018-11-23 07:55:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:55:25,426 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 07:55:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:55:25,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 07:55:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:55:25,427 INFO L225 Difference]: With dead ends: 48 [2018-11-23 07:55:25,427 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 07:55:25,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:55:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 07:55:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-11-23 07:55:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 07:55:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 07:55:25,434 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2018-11-23 07:55:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:55:25,434 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 07:55:25,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:55:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 07:55:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 07:55:25,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:55:25,435 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:55:25,435 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:55:25,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:55:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1930663235, now seen corresponding path program 1 times [2018-11-23 07:55:25,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:55:25,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:55:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:55:25,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:55:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:55:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:55:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:55:25,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:55:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:55:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:55:25,492 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 5 states. [2018-11-23 07:55:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:55:25,569 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 07:55:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:55:25,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 07:55:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:55:25,570 INFO L225 Difference]: With dead ends: 50 [2018-11-23 07:55:25,570 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 07:55:25,571 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 07:55:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 07:55:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 07:55:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 07:55:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 07:55:25,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2018-11-23 07:55:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:55:25,575 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 07:55:25,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:55:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 07:55:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 07:55:25,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:55:25,576 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:55:25,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:55:25,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:55:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash 686921714, now seen corresponding path program 1 times [2018-11-23 07:55:25,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:55:25,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:55:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:55:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:55:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:55:25,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:55:25,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:55:25,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:55:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:55:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:55:25,618 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 07:55:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:55:25,681 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 07:55:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:55:25,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 07:55:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:55:25,682 INFO L225 Difference]: With dead ends: 48 [2018-11-23 07:55:25,683 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 07:55:25,683 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 07:55:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 07:55:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-11-23 07:55:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 07:55:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 07:55:25,686 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-11-23 07:55:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:55:25,686 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 07:55:25,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:55:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 07:55:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:55:25,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:55:25,687 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:55:25,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:55:25,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:55:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234719, now seen corresponding path program 1 times [2018-11-23 07:55:25,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:55:25,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:55:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:55:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:55:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:55:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:55:25,731 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(0 != ~flag~0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem7|=2] [?] assume !(1 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem9|=2] [?] assume 3 != #t~mem9;havoc #t~mem9; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L630] COND FALSE !(a == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L631] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L639] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(\read(flag)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L649] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] ----- [2018-11-23 07:55:25,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:55:25 BoogieIcfgContainer [2018-11-23 07:55:25,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:55:25,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:55:25,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:55:25,779 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:55:25,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:55:24" (3/4) ... [2018-11-23 07:55:25,781 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|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(0 != ~flag~0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem7|=2] [?] assume !(1 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem9|=2] [?] assume 3 != #t~mem9;havoc #t~mem9; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L630] COND FALSE !(a == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L631] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L639] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(\read(flag)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L649] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] ----- [2018-11-23 07:55:25,833 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_47f0dc1f-8b8d-4e42-a10e-9c6cd3c3d74b/bin-2019/uautomizer/witness.graphml [2018-11-23 07:55:25,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:55:25,834 INFO L168 Benchmark]: Toolchain (without parser) took 1417.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -62.1 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,835 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:55:25,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,836 INFO L168 Benchmark]: Boogie Preprocessor took 17.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,836 INFO L168 Benchmark]: RCFGBuilder took 190.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,837 INFO L168 Benchmark]: TraceAbstraction took 788.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,837 INFO L168 Benchmark]: Witness Printer took 54.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:55:25,840 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 788.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L630] COND FALSE !(a == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L631] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L639] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(\read(flag)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L649] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 63 SDslu, 159 SDs, 0 SdLazy, 127 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/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...