./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/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 64c66cee5e197d422d57bcbd967acefa86ecac75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 08:11:21,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:11:21,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:11:21,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:11:21,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:11:21,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:11:21,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:11:21,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:11:21,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:11:21,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:11:21,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:11:21,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:11:21,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:11:21,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:11:21,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:11:21,564 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:11:21,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:11:21,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:11:21,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:11:21,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:11:21,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:11:21,568 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:11:21,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:11:21,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:11:21,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:11:21,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:11:21,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:11:21,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:11:21,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:11:21,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:11:21,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:11:21,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:11:21,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:11:21,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:11:21,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:11:21,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:11:21,575 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:11:21,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:11:21,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:11:21,583 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:11:21,583 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:11:21,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:11:21,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:11:21,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:11:21,584 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:11:21,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:11:21,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:11:21,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:11:21,585 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_35b73088-d2c3-441a-b9de-76bafd2bc961/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 -> 64c66cee5e197d422d57bcbd967acefa86ecac75 [2018-11-23 08:11:21,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:11:21,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:11:21,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:11:21,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:11:21,621 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:11:21,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-11-23 08:11:21,662 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/data/6b225e7ca/603b34fd8d3d4536918f8c5d985e97eb/FLAG73a5c412c [2018-11-23 08:11:22,118 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:11:22,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/sv-benchmarks/c/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-11-23 08:11:22,128 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/data/6b225e7ca/603b34fd8d3d4536918f8c5d985e97eb/FLAG73a5c412c [2018-11-23 08:11:22,638 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/data/6b225e7ca/603b34fd8d3d4536918f8c5d985e97eb [2018-11-23 08:11:22,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:11:22,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:11:22,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:11:22,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:11:22,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:11:22,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:22,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e643ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22, skipping insertion in model container [2018-11-23 08:11:22,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:22,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:11:22,679 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:11:22,867 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:11:22,874 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:11:22,947 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:11:22,971 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:11:22,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22 WrapperNode [2018-11-23 08:11:22,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:11:22,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:11:22,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:11:22,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:11:22,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:22,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:22,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:11:22,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:11:22,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:11:22,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:11:22,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:22,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:23,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:23,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:23,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:23,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:23,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... [2018-11-23 08:11:23,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:11:23,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:11:23,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:11:23,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:11:23,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/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 08:11:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:11:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:11:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 08:11:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 08:11:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:11:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:11:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:11:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:11:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:11:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 08:11:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 08:11:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:11:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:11:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:11:23,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:11:23,266 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 08:11:23,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:23 BoogieIcfgContainer [2018-11-23 08:11:23,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:11:23,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:11:23,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:11:23,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:11:23,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:11:22" (1/3) ... [2018-11-23 08:11:23,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17df9bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:23, skipping insertion in model container [2018-11-23 08:11:23,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:22" (2/3) ... [2018-11-23 08:11:23,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17df9bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:23, skipping insertion in model container [2018-11-23 08:11:23,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:23" (3/3) ... [2018-11-23 08:11:23,274 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-11-23 08:11:23,281 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:11:23,287 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:11:23,297 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:11:23,321 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:11:23,322 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:11:23,322 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:11:23,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:11:23,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:11:23,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:11:23,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:11:23,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:11:23,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:11:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 08:11:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 08:11:23,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:23,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:23,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:23,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash 853425561, now seen corresponding path program 1 times [2018-11-23 08:11:23,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:11:23,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:11:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:23,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:23,429 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 08:11:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:23,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:11:23,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 08:11:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 08:11:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 08:11:23,443 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 08:11:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:23,458 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2018-11-23 08:11:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 08:11:23,459 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 08:11:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:23,464 INFO L225 Difference]: With dead ends: 65 [2018-11-23 08:11:23,464 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 08:11:23,466 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 08:11:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 08:11:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 08:11:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 08:11:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 08:11:23,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2018-11-23 08:11:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:23,489 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 08:11:23,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 08:11:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 08:11:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 08:11:23,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:23,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:23,490 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:23,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1145487297, now seen corresponding path program 1 times [2018-11-23 08:11:23,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:11:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:11:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:11:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:11:23,554 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] RET #125#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~i~0 := 0;~y~0 := 0;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] #t~short2 := ~i~0 < 10; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short2|=true] [?] assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false] [?] assume !#t~short2;havoc #t~nondet1;havoc #t~short2; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] #t~short7 := ~y~0 < 10; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short7|=true] [?] assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet6|=0, |main_#t~short7|=false] [?] assume !#t~short7;havoc #t~short7;havoc #t~nondet6; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~i~0 := 0;~y~0 := 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem11|=3] [?] assume !(1 == #t~mem11);havoc #t~mem11; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem14|=3] [?] assume !(2 == #t~mem14);havoc #t~mem14; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem17|=3] [?] assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;havoc #t~mem17; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0.base, ~t~0.offset; [L632] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] assume #t~short7; [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641-L648] assume !#t~short7; [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653-L656] assume !(1 == #t~mem11); [L653] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657] call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657-L660] assume !(2 == #t~mem14); [L657] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661] call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661-L662] assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20; [L661] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L662] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0.base, ~t~0.offset; [L632] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] assume #t~short7; [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641-L648] assume !#t~short7; [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653-L656] assume !(1 == #t~mem11); [L653] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657] call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657-L660] assume !(2 == #t~mem14); [L657] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661] call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661-L662] assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20; [L661] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L662] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L627] int i = 0; [L628] int y = 0; [L629] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0] [L630] COND FALSE !(a == 0) VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0] [L631] List t; [L632] List p = a; VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={10:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L653] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L653] COND FALSE !(p->h == 1) [L657] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L657] COND FALSE !(p->h == 2) [L661] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L661] COND TRUE p->h != 3 || (i + y) < 20 [L662] __VERIFIER_error() VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] ----- [2018-11-23 08:11:23,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:11:23 BoogieIcfgContainer [2018-11-23 08:11:23,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:11:23,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:11:23,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:11:23,594 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:11:23,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:23" (3/4) ... [2018-11-23 08:11:23,596 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|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] RET #125#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~i~0 := 0;~y~0 := 0;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] #t~short2 := ~i~0 < 10; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short2|=true] [?] assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false] [?] assume !#t~short2;havoc #t~nondet1;havoc #t~short2; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] #t~short7 := ~y~0 < 10; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short7|=true] [?] assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet6|=0, |main_#t~short7|=false] [?] assume !#t~short7;havoc #t~short7;havoc #t~nondet6; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~i~0 := 0;~y~0 := 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem11|=3] [?] assume !(1 == #t~mem11);havoc #t~mem11; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem14|=3] [?] assume !(2 == #t~mem14);havoc #t~mem14; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem17|=3] [?] assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;havoc #t~mem17; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0.base, ~t~0.offset; [L632] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] assume #t~short7; [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641-L648] assume !#t~short7; [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653-L656] assume !(1 == #t~mem11); [L653] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657] call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657-L660] assume !(2 == #t~mem14); [L657] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661] call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661-L662] assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20; [L661] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L662] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0.base, ~t~0.offset; [L632] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633] assume #t~short2; [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L633-L640] assume !#t~short2; [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641] assume #t~short7; [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L641-L648] assume !#t~short7; [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653] call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L653-L656] assume !(1 == #t~mem11); [L653] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657] call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L657-L660] assume !(2 == #t~mem14); [L657] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661] call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L661-L662] assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20; [L661] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [L662] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~i~0 := 0; [L628] ~y~0 := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0] [L631] havoc ~t~0; [L632] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] #t~short2 := ~i~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633] COND TRUE #t~short2 [L633] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L633] #t~short2 := 0 != #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L633-L640] COND TRUE !#t~short2 [L633] havoc #t~nondet1; [L633] havoc #t~short2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] #t~short7 := ~y~0 < 10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641] COND TRUE #t~short7 [L641] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L641] #t~short7 := 0 != #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L641-L648] COND TRUE !#t~short7 [L641] havoc #t~short7; [L641] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] ~i~0 := 0; [L651] ~y~0 := 0; [L652] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653] FCALL call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L653-L656] COND TRUE !(1 == #t~mem11) [L653] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657] FCALL call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L657-L660] COND TRUE !(2 == #t~mem14) [L657] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] FCALL call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L661] COND TRUE 3 != #t~mem17 || ~i~0 + ~y~0 < 20 [L661] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L662] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0] [L627] int i = 0; [L628] int y = 0; [L629] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0] [L630] COND FALSE !(a == 0) VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0] [L631] List t; [L632] List p = a; VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={10:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L653] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L653] COND FALSE !(p->h == 1) [L657] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L657] COND FALSE !(p->h == 2) [L661] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L661] COND TRUE p->h != 3 || (i + y) < 20 [L662] __VERIFIER_error() VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] ----- [2018-11-23 08:11:23,637 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_35b73088-d2c3-441a-b9de-76bafd2bc961/bin-2019/uautomizer/witness.graphml [2018-11-23 08:11:23,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:11:23,638 INFO L168 Benchmark]: Toolchain (without parser) took 997.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -100.0 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:23,640 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:11:23,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:23,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:23,641 INFO L168 Benchmark]: Boogie Preprocessor took 21.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:11:23,641 INFO L168 Benchmark]: RCFGBuilder took 252.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:23,641 INFO L168 Benchmark]: TraceAbstraction took 326.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:23,641 INFO L168 Benchmark]: Witness Printer took 43.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:11:23,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 252.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 326.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 662]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int i = 0; [L628] int y = 0; [L629] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0] [L630] COND FALSE !(a == 0) VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0] [L631] List t; [L632] List p = a; VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={10:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] p->h = 3 [L650] i = 0 [L651] y = 0 [L652] p = a VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] [L653] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L653] COND FALSE !(p->h == 1) [L657] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L657] COND FALSE !(p->h == 2) [L661] EXPR p->h VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0] [L661] COND TRUE p->h != 3 || (i + y) < 20 [L662] __VERIFIER_error() VAL [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...