./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular_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_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/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 95b20088216028e3d05e3cb41d4ed5c20af6a751 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:41:36,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:41:36,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:41:36,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:41:36,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:41:36,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:41:36,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:41:36,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:41:36,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:41:36,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:41:36,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:41:36,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:41:36,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:41:36,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:41:36,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:41:36,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:41:36,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:41:36,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:41:36,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:41:36,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:41:36,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:41:36,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:41:36,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:41:36,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:41:36,915 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:41:36,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:41:36,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:41:36,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:41:36,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:41:36,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:41:36,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:41:36,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:41:36,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:41:36,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:41:36,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:41:36,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:41:36,920 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:41:36,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:41:36,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:41:36,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:41:36,932 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:41:36,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:41:36,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:41:36,933 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:41:36,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:41:36,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:41:36,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:41:36,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:41:36,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:41:36,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:41:36,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:41:36,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:41:36,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:41:36,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:41:36,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:41:36,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:41:36,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:41:36,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:41:36,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:41:36,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:41:36,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:41:36,936 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_c097fa59-1c21-452d-8676-7b3ce46ab7ef/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 -> 95b20088216028e3d05e3cb41d4ed5c20af6a751 [2018-11-23 00:41:36,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:41:36,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:41:36,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:41:36,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:41:36,974 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:41:36,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-23 00:41:37,021 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/data/5508707c4/1e75b157f5e74ed686ec9c850f1c276c/FLAG0cc430bd6 [2018-11-23 00:41:37,389 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:41:37,390 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/sv-benchmarks/c/forester-heap/dll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-23 00:41:37,396 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/data/5508707c4/1e75b157f5e74ed686ec9c850f1c276c/FLAG0cc430bd6 [2018-11-23 00:41:37,780 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/data/5508707c4/1e75b157f5e74ed686ec9c850f1c276c [2018-11-23 00:41:37,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:41:37,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:41:37,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:41:37,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:41:37,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:41:37,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:37" (1/1) ... [2018-11-23 00:41:37,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2bcbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:37, skipping insertion in model container [2018-11-23 00:41:37,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:41:37" (1/1) ... [2018-11-23 00:41:37,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:41:37,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:41:38,014 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:41:38,021 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:41:38,093 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:41:38,124 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:41:38,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38 WrapperNode [2018-11-23 00:41:38,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:41:38,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:41:38,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:41:38,125 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:41:38,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:41:38,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:41:38,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:41:38,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:41:38,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... [2018-11-23 00:41:38,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:41:38,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:41:38,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:41:38,180 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:41:38,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/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 00:41:38,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:41:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:41:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:41:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:41:38,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:41:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:41:38,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:41:38,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:41:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:41:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:41:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:41:38,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:41:38,480 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:41:38,480 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 00:41:38,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:38 BoogieIcfgContainer [2018-11-23 00:41:38,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:41:38,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:41:38,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:41:38,483 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:41:38,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:41:37" (1/3) ... [2018-11-23 00:41:38,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4415caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:38, skipping insertion in model container [2018-11-23 00:41:38,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:41:38" (2/3) ... [2018-11-23 00:41:38,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4415caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:41:38, skipping insertion in model container [2018-11-23 00:41:38,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:38" (3/3) ... [2018-11-23 00:41:38,485 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-23 00:41:38,493 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:41:38,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 00:41:38,513 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 00:41:38,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:41:38,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:41:38,534 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:41:38,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:41:38,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:41:38,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:41:38,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:41:38,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:41:38,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:41:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 00:41:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:41:38,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:38,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:38,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:38,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1481134361, now seen corresponding path program 1 times [2018-11-23 00:41:38,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:38,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:38,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:38,655 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 00:41:38,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:41:38,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:41:38,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:41:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:41:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:41:38,670 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 00:41:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:41:38,685 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2018-11-23 00:41:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:41:38,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 00:41:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:41:38,692 INFO L225 Difference]: With dead ends: 70 [2018-11-23 00:41:38,693 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 00:41:38,695 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 00:41:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 00:41:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 00:41:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 00:41:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 00:41:38,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2018-11-23 00:41:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:41:38,722 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 00:41:38,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:41:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 00:41:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:41:38,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:38,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:38,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:38,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1288506705, now seen corresponding path program 1 times [2018-11-23 00:41:38,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:38,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:38,865 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 00:41:38,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:41:38,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:41:38,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:41:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:41:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:41:38,868 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2018-11-23 00:41:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:41:38,953 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 00:41:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:41:38,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 00:41:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:41:38,954 INFO L225 Difference]: With dead ends: 46 [2018-11-23 00:41:38,954 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 00:41:38,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:41:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 00:41:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-23 00:41:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 00:41:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 00:41:38,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2018-11-23 00:41:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:41:38,962 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 00:41:38,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:41:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 00:41:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:41:38,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:38,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:41:38,963 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:38,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1834766102, now seen corresponding path program 1 times [2018-11-23 00:41:38,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:38,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:38,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:38,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:38,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:41:38,995 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 00:41:38,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:41:38,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:41:38,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:41:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:41:38,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:41:38,996 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 00:41:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:41:39,019 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-23 00:41:39,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:41:39,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 00:41:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:41:39,021 INFO L225 Difference]: With dead ends: 75 [2018-11-23 00:41:39,021 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 00:41:39,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:41:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 00:41:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-23 00:41:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 00:41:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 00:41:39,026 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2018-11-23 00:41:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:41:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 00:41:39,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:41:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 00:41:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 00:41:39,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:41:39,026 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 00:41:39,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:41:39,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:41:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -959873059, now seen corresponding path program 1 times [2018-11-23 00:41:39,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:41:39,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:41:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:41:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:41:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:41:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:41:39,069 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=19, |#NULL.offset|=13, |old(#NULL.base)|=19, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=13] [?] RET #129#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~mem7|=1] [?] assume !!(0 != #t~mem7);havoc #t~mem7; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4);#t~short13 := 0 != #t~mem9; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~mem8.base|=20, |main_#t~mem8.offset|=0, |main_#t~mem9|=1, |main_#t~short13|=true] [?] assume #t~short13;call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem12 := read~int(#t~mem10.base, 8 + #t~mem10.offset, 4);#t~short13 := #t~mem11 > #t~mem12; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~mem10.base|=20, |main_#t~mem10.offset|=0, |main_#t~mem11|=1, |main_#t~mem12|=1, |main_#t~mem8.base|=20, |main_#t~mem8.offset|=0, |main_#t~mem9|=1, |main_#t~short13|=false] [?] assume !#t~short13;havoc #t~mem12;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;havoc #t~short13;havoc #t~mem11;havoc #t~mem9; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=13, old(#NULL.base)=19, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L988] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L991] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994-L1015] assume !(0 != #t~nondet1); [L994] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1016] call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); [L1018] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1018] ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; [L1018] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1019] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021] call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem7=1, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021-L1025] assume !!(0 != #t~mem7); [L1021] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=true, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume #t~short13; [L1023] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L1023] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem12 := read~int(#t~mem10.base, 8 + #t~mem10.offset, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11=1, #t~mem12=1, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=false, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume !#t~short13; [L1023] havoc #t~mem12; [L1023] havoc #t~mem8.base, #t~mem8.offset; [L1023] havoc #t~mem10.base, #t~mem10.offset; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=13, old(#NULL.base)=19, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L988] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L991] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994-L1015] assume !(0 != #t~nondet1); [L994] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1016] call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); [L1018] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1018] ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; [L1018] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1019] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021] call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem7=1, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021-L1025] assume !!(0 != #t~mem7); [L1021] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=true, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume #t~short13; [L1023] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L1023] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem12 := read~int(#t~mem10.base, 8 + #t~mem10.offset, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11=1, #t~mem12=1, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=false, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume !#t~short13; [L1023] havoc #t~mem12; [L1023] havoc #t~mem8.base, #t~mem8.offset; [L1023] havoc #t~mem10.base, #t~mem10.offset; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = head [L988] head->data = 0 [L990] SLL* x = head; [L991] int state = 1; VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state [L1018] EXPR head->next [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] [L1021] EXPR x->data VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] EXPR x->data [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}, x->data=1, x->next={20:0}, x->next={20:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] ----- [2018-11-23 00:41:39,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:41:39 BoogieIcfgContainer [2018-11-23 00:41:39,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:41:39,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:41:39,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:41:39,106 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:41:39,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:41:38" (3/4) ... [2018-11-23 00:41:39,108 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=19, |#NULL.offset|=13, |old(#NULL.base)|=19, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=13] [?] RET #129#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~mem7|=1] [?] assume !!(0 != #t~mem7);havoc #t~mem7; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4);#t~short13 := 0 != #t~mem9; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~mem8.base|=20, |main_#t~mem8.offset|=0, |main_#t~mem9|=1, |main_#t~short13|=true] [?] assume #t~short13;call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem12 := read~int(#t~mem10.base, 8 + #t~mem10.offset, 4);#t~short13 := #t~mem11 > #t~mem12; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0, |main_#t~mem10.base|=20, |main_#t~mem10.offset|=0, |main_#t~mem11|=1, |main_#t~mem12|=1, |main_#t~mem8.base|=20, |main_#t~mem8.offset|=0, |main_#t~mem9|=1, |main_#t~short13|=false] [?] assume !#t~short13;havoc #t~mem12;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;havoc #t~short13;havoc #t~mem11;havoc #t~mem9; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~head~0.base=20, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=20, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=20, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=13, old(#NULL.base)=19, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L988] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L991] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994-L1015] assume !(0 != #t~nondet1); [L994] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1016] call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); [L1018] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1018] ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; [L1018] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1019] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021] call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem7=1, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021-L1025] assume !!(0 != #t~mem7); [L1021] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=true, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume #t~short13; [L1023] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L1023] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem12 := read~int(#t~mem10.base, 8 + #t~mem10.offset, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11=1, #t~mem12=1, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=false, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume !#t~short13; [L1023] havoc #t~mem12; [L1023] havoc #t~mem8.base, #t~mem8.offset; [L1023] havoc #t~mem10.base, #t~mem10.offset; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=13, old(#NULL.base)=19, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L988] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L991] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L994-L1015] assume !(0 != #t~nondet1); [L994] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1016] call write~int(~state~0, ~x~0.base, 8 + ~x~0.offset, 4); [L1018] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1018] ~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset; [L1018] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1019] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021] call #t~mem7 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem7=1, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1021-L1025] assume !!(0 != #t~mem7); [L1021] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem9 := read~int(#t~mem8.base, 8 + #t~mem8.offset, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=true, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume #t~short13; [L1023] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); [L1023] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1023] call #t~mem12 := read~int(#t~mem10.base, 8 + #t~mem10.offset, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11=1, #t~mem12=1, #t~mem8.base=20, #t~mem8.offset=0, #t~mem9=1, #t~short13=false, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assume !#t~short13; [L1023] havoc #t~mem12; [L1023] havoc #t~mem8.base, #t~mem8.offset; [L1023] havoc #t~mem10.base, #t~mem10.offset; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [L1023] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=20, #t~malloc0.offset=0, ~head~0.base=20, ~head~0.offset=0, ~state~0=1, ~x~0.base=20, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=13, old(#NULL!base)=19, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$(~head~0, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~x~0 := ~head~0; [L991] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L994-L1015] COND TRUE !(0 != #t~nondet1) [L994] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1016] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1018] FCALL call #t~mem6 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1018] ~x~0 := #t~mem6; [L1018] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1019] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem7=1, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1021-L1025] COND FALSE !(!(0 != #t~mem7)) [L1021] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem9 := read~int({ base: #t~mem8!base, offset: 8 + #t~mem8!offset }, 4); [L1023] #t~short13 := 0 != #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=true, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE #t~short13 [L1023] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1023] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1023] FCALL call #t~mem12 := read~int({ base: #t~mem10!base, offset: 8 + #t~mem10!offset }, 4); [L1023] #t~short13 := #t~mem11 > #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11=1, #t~mem12=1, #t~mem8!base=20, #t~mem8!offset=0, #t~mem9=1, #t~short13=false, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] COND TRUE !#t~short13 [L1023] havoc #t~mem12; [L1023] havoc #t~mem8; [L1023] havoc #t~mem10; [L1023] havoc #t~short13; [L1023] havoc #t~mem11; [L1023] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L1023] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=20, #t~malloc0!offset=0, ~head~0!base=20, ~head~0!offset=0, ~state~0=1, ~x~0!base=20, ~x~0!offset=0] [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = head [L988] head->data = 0 [L990] SLL* x = head; [L991] int state = 1; VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state [L1018] EXPR head->next [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] [L1021] EXPR x->data VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] EXPR x->data [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}, x->data=1, x->next={20:0}, x->next={20:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] ----- [2018-11-23 00:41:39,158 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c097fa59-1c21-452d-8676-7b3ce46ab7ef/bin-2019/uautomizer/witness.graphml [2018-11-23 00:41:39,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:41:39,159 INFO L168 Benchmark]: Toolchain (without parser) took 1376.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 955.4 MB in the beginning and 1.0 GB in the end (delta: -50.4 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:39,161 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:41:39,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:39,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:39,163 INFO L168 Benchmark]: Boogie Preprocessor took 28.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:41:39,163 INFO L168 Benchmark]: RCFGBuilder took 300.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:39,163 INFO L168 Benchmark]: TraceAbstraction took 624.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:39,164 INFO L168 Benchmark]: Witness Printer took 52.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:41:39,166 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 300.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 624.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = head [L988] head->data = 0 [L990] SLL* x = head; [L991] int state = 1; VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] x->data = state [L1018] EXPR head->next [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] [L1021] EXPR x->data VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] EXPR x->data [L1023] EXPR x->next [L1023] EXPR x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}, x->data=1, x->next={20:0}, x->next={20:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={20:0}, malloc(sizeof(SLL))={20:0}, state=1, x={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 44 SDslu, 61 SDs, 0 SdLazy, 35 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...