./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7efcb16e512d7de15a71f6cd895dcd8493c4b646 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:03:19,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:19,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:19,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:19,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:19,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:19,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:19,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:19,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:19,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:19,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:19,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:19,732 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:19,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:19,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:19,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:19,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:19,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:19,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:19,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:19,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:19,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:19,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:19,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:19,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:19,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:19,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:19,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:19,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:19,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:19,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:19,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:19,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:19,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:19,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:19,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:19,747 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 13:03:19,757 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:19,757 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:19,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:19,757 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:19,758 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:19,758 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:19,758 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:19,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:19,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:19,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:03:19,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:19,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:19,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:19,759 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 13:03:19,760 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 13:03:19,760 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 13:03:19,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:19,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:19,760 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:19,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:19,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:19,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:19,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:19,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:19,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:19,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:19,761 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:19,762 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:19,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_db60f293-eb9c-49b1-90e3-8afa27ac4533/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7efcb16e512d7de15a71f6cd895dcd8493c4b646 [2018-11-23 13:03:19,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:19,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:19,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:19,796 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:19,796 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:19,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c [2018-11-23 13:03:19,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/data/17c57386c/cc9cdc7f94074abd992f905f40b65e77/FLAGf896be462 [2018-11-23 13:03:20,218 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:20,218 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c [2018-11-23 13:03:20,221 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/data/17c57386c/cc9cdc7f94074abd992f905f40b65e77/FLAGf896be462 [2018-11-23 13:03:20,230 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/data/17c57386c/cc9cdc7f94074abd992f905f40b65e77 [2018-11-23 13:03:20,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:20,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 13:03:20,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:20,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:20,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:20,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5fba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20, skipping insertion in model container [2018-11-23 13:03:20,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:20,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:20,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:20,366 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:20,374 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:20,383 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:20,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20 WrapperNode [2018-11-23 13:03:20,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:20,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:20,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:20,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:20,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... [2018-11-23 13:03:20,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:20,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:20,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:20,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:20,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/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 13:03:20,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:20,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:20,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:20,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:20,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:20,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:20,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:20,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:20,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:20,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:20,611 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:20,611 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:03:20,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:20 BoogieIcfgContainer [2018-11-23 13:03:20,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:20,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:20,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:20,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:20,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:20" (1/3) ... [2018-11-23 13:03:20,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b5329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:20, skipping insertion in model container [2018-11-23 13:03:20,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:20" (2/3) ... [2018-11-23 13:03:20,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b5329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:20, skipping insertion in model container [2018-11-23 13:03:20,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:20" (3/3) ... [2018-11-23 13:03:20,619 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes3_false-valid-deref.c [2018-11-23 13:03:20,627 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:20,633 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 13:03:20,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 13:03:20,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:20,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:20,669 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 13:03:20,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:20,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:20,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:20,669 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:20,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:20,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:03:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:03:20,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,691 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:20,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash -197094901, now seen corresponding path program 1 times [2018-11-23 13:03:20,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,783 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 13:03:20,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:20,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:20,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:20,797 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:03:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,807 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:03:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:20,808 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-23 13:03:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,814 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:03:20,814 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:03:20,815 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 13:03:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:03:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:03:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:03:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:03:20,836 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2018-11-23 13:03:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,836 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:03:20,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:03:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:03:20,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:20,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash -197095180, now seen corresponding path program 1 times [2018-11-23 13:03:20,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:20,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:20,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:20,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:20,869 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-23 13:03:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,888 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:03:20,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:20,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:03:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,889 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:03:20,889 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:03:20,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:03:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-23 13:03:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:03:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:03:20,892 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2018-11-23 13:03:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,893 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:03:20,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:03:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:03:20,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,894 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:20,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash -197095125, now seen corresponding path program 1 times [2018-11-23 13:03:20,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,933 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 13:03:20,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:20,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:20,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:20,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:20,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:20,934 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-11-23 13:03:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,953 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:03:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:20,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:03:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,954 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:03:20,954 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:03:20,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:03:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:03:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:03:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:03:20,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2018-11-23 13:03:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,956 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:03:20,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:03:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:03:20,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:20,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash -197095126, now seen corresponding path program 1 times [2018-11-23 13:03:20,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,980 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 13:03:20,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:20,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:20,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:20,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:20,981 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 13:03:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,995 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:03:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:20,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:03:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,996 INFO L225 Difference]: With dead ends: 15 [2018-11-23 13:03:20,996 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:03:20,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:03:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:03:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:03:20,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2018-11-23 13:03:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,998 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:03:20,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:03:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:03:20,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,999 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:20,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash -440617163, now seen corresponding path program 1 times [2018-11-23 13:03:20,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:03:21,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:03:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:03:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:21,120 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:03:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,142 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:03:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:21,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:03:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,144 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:03:21,144 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:03:21,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:03:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-23 13:03:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:03:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:03:21,146 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2018-11-23 13:03:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,147 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:03:21,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:03:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:03:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:03:21,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,149 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,150 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:21,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1004249772, now seen corresponding path program 2 times [2018-11-23 13:03:21,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:21,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:21,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:21,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:03:21,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:03:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:03:21,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:21,281 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-23 13:03:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,316 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:03:21,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:21,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:03:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,317 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:03:21,317 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:03:21,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:03:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 13:03:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:03:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:03:21,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 13:03:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,320 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:03:21,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:03:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:03:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:03:21,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,320 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,321 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:21,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1138822869, now seen corresponding path program 3 times [2018-11-23 13:03:21,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:21,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:21,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:03:21,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:03:21,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:03:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:03:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:21,417 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-11-23 13:03:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,432 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:03:21,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:21,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 13:03:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,433 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:03:21,433 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:03:21,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:03:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 13:03:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:03:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:03:21,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2018-11-23 13:03:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,436 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:03:21,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:03:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:03:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:03:21,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,437 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:21,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,437 INFO L82 PathProgramCache]: Analyzing trace with hash 727015860, now seen corresponding path program 4 times [2018-11-23 13:03:21,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:03:21,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:03:21,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:03:21,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:21,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:21,546 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-11-23 13:03:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,563 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:03:21,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:03:21,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:03:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,563 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:03:21,563 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:03:21,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:03:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 13:03:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:03:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:03:21,566 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2018-11-23 13:03:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,567 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:03:21,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:03:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:03:21,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,567 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:21,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash -988991883, now seen corresponding path program 5 times [2018-11-23 13:03:21,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:21,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:03:21,706 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:03:21,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:03:21,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:21,745 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2018-11-23 13:03:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,799 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:03:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:03:21,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 13:03:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,800 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:03:21,801 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:03:21,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:03:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 13:03:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:03:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:03:21,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2018-11-23 13:03:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,804 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:03:21,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:03:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:03:21,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,805 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,805 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:21,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash 420060692, now seen corresponding path program 6 times [2018-11-23 13:03:21,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,896 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:03:21,922 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:03:21,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:21,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:03:21,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:03:21,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:03:21,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:21,949 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-11-23 13:03:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,972 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:03:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:03:21,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-23 13:03:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,974 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:03:21,974 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:03:21,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:03:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:03:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:03:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:03:21,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 26 [2018-11-23 13:03:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,977 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:03:21,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:03:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:03:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:03:21,978 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,978 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,978 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:21,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1505028587, now seen corresponding path program 7 times [2018-11-23 13:03:21,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:21,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:22,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:22,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:22,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:22,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:22,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:22,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:03:22,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:22,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:22,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:22,145 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2018-11-23 13:03:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,183 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:03:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:03:22,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 13:03:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:22,186 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:03:22,186 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:03:22,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:03:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 13:03:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:03:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 13:03:22,189 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-11-23 13:03:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:22,190 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 13:03:22,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:03:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:03:22,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:22,191 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:22,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:22,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1141435788, now seen corresponding path program 8 times [2018-11-23 13:03:22,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:22,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:22,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:22,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:22,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:22,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:22,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:22,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:22,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:03:22,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:22,351 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2018-11-23 13:03:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,386 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:03:22,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:22,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-23 13:03:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:22,387 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:03:22,388 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:03:22,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:03:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 13:03:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:03:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:03:22,391 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2018-11-23 13:03:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:22,391 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:03:22,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:03:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:03:22,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:22,392 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:22,392 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:22,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1255881291, now seen corresponding path program 9 times [2018-11-23 13:03:22,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:22,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:22,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:22,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:22,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:22,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:22,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:03:22,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:22,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:22,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:22,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:03:22,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:22,559 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 13 states. [2018-11-23 13:03:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,578 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:03:22,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:22,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-23 13:03:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:22,579 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:03:22,579 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:03:22,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:03:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 13:03:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:03:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-23 13:03:22,583 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 35 [2018-11-23 13:03:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:22,583 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-23 13:03:22,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:03:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:03:22,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:22,584 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:22,584 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-11-23 13:03:22,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash -497828140, now seen corresponding path program 10 times [2018-11-23 13:03:22,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:22,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:22,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:03:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:03:22,652 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=50, |#NULL.offset|=42, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] RET #29#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~p~0.base, ~p~0.offset;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 ----- [2018-11-23 13:03:22,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:03:22 BoogieIcfgContainer [2018-11-23 13:03:22,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:03:22,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:03:22,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:03:22,703 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:03:22,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:20" (3/4) ... [2018-11-23 13:03:22,705 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|=50, |#NULL.offset|=42, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] RET #29#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~p~0.base, ~p~0.offset;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 ----- [2018-11-23 13:03:22,832 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db60f293-eb9c-49b1-90e3-8afa27ac4533/bin-2019/uautomizer/witness.graphml [2018-11-23 13:03:22,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:03:22,833 INFO L168 Benchmark]: Toolchain (without parser) took 2600.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 959.2 MB in the beginning and 835.3 MB in the end (delta: 123.9 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,834 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:03:22,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,835 INFO L168 Benchmark]: Boogie Preprocessor took 21.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,835 INFO L168 Benchmark]: RCFGBuilder took 206.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,835 INFO L168 Benchmark]: TraceAbstraction took 2085.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 838.8 MB in the end (delta: 300.5 MB). Peak memory consumption was 300.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,836 INFO L168 Benchmark]: Witness Printer took 133.36 ms. Allocated memory is still 1.2 GB. Free memory was 838.8 MB in the beginning and 835.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,838 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2085.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 838.8 MB in the end (delta: 300.5 MB). Peak memory consumption was 300.5 MB. Max. memory is 11.5 GB. * Witness Printer took 133.36 ms. Allocated memory is still 1.2 GB. Free memory was 838.8 MB in the beginning and 835.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 5 error locations. UNSAFE Result, 2.0s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 123 SDslu, 422 SDs, 0 SdLazy, 189 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=13, 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, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 484 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 24918 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 0/810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...