./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-read.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_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-read.c -s /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 639853f2f40cff84155fe09902eff2b5a20185f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:26:20,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:26:20,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:26:20,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:26:20,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:26:20,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:26:20,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:26:20,974 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:26:20,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:26:20,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:26:20,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:26:20,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:26:20,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:26:20,979 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:26:20,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:26:20,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:26:20,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:26:20,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:26:20,983 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:26:20,985 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:26:20,986 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:26:20,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:26:20,988 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:26:20,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:26:20,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:26:20,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:26:20,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:26:20,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:26:20,991 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:26:20,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:26:20,992 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:26:20,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:26:20,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:26:20,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:26:20,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:26:20,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:26:20,995 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 02:26:21,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:26:21,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:26:21,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:26:21,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:26:21,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:26:21,006 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:26:21,006 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:26:21,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:26:21,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:26:21,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:26:21,007 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 02:26:21,007 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 02:26:21,007 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 02:26:21,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:26:21,007 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:26:21,007 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:26:21,007 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:26:21,008 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:26:21,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:26:21,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:26:21,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:26:21,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:26:21,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:26:21,010 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:26:21,010 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:26:21,010 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_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak 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 -> Kojak 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 -> 639853f2f40cff84155fe09902eff2b5a20185f5 [2018-11-23 02:26:21,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:26:21,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:26:21,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:26:21,046 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:26:21,046 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:26:21,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-read.c [2018-11-23 02:26:21,080 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/data/4839733f8/8f6d6b15a7ab484fb20ab5b1c1d1cc62/FLAG607f3241b [2018-11-23 02:26:21,465 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:26:21,466 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-read.c [2018-11-23 02:26:21,469 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/data/4839733f8/8f6d6b15a7ab484fb20ab5b1c1d1cc62/FLAG607f3241b [2018-11-23 02:26:21,479 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/data/4839733f8/8f6d6b15a7ab484fb20ab5b1c1d1cc62 [2018-11-23 02:26:21,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:26:21,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:26:21,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:26:21,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:26:21,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:26:21,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21, skipping insertion in model container [2018-11-23 02:26:21,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:26:21,505 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:26:21,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:26:21,619 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:26:21,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:26:21,642 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:26:21,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21 WrapperNode [2018-11-23 02:26:21,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:26:21,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:26:21,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:26:21,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:26:21,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:26:21,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:26:21,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:26:21,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:26:21,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... [2018-11-23 02:26:21,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:26:21,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:26:21,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:26:21,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:26:21,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:26:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:26:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:26:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:26:21,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:26:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:26:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:26:22,117 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:26:22,118 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 02:26:22,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:22 BoogieIcfgContainer [2018-11-23 02:26:22,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:26:22,118 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:26:22,118 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:26:22,128 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:26:22,128 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:22" (1/1) ... [2018-11-23 02:26:22,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:26:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:26:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 24 states and 28 transitions. [2018-11-23 02:26:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 02:26:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 02:26:22,172 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:26:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:26:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:26:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:26:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 25 states and 30 transitions. [2018-11-23 02:26:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 02:26:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 02:26:22,290 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:26:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:26:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:26:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:26:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 26 states and 32 transitions. [2018-11-23 02:26:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-11-23 02:26:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 02:26:22,362 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:26:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:26:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:26:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:26:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 27 states and 35 transitions. [2018-11-23 02:26:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 02:26:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 02:26:22,430 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:26:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:26:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:26:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:26:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 29 states and 39 transitions. [2018-11-23 02:26:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-11-23 02:26:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 02:26:22,637 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:26:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:26:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:26:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:26:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:26:22,695 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 5 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset;havoc main_~i~2;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400);main_~i~2 := 0; VAL [ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(main_~i~2 < 100);foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, main_~i~2;havoc foo_#res;havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1;foo_~n := foo_#in~n;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n);havoc foo_~i~1;foo_~i~1 := 0; VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(foo_~i~1 < foo_~size);}EndParallelCompositionbar_#in~b.base, bar_#in~b.offset, bar_#in~size := foo_~#a~0.base, foo_~#a~0.offset, 1 + foo_~size;havoc bar_#res;havoc bar_#t~mem1, bar_#t~post0, bar_~b.base, bar_~b.offset, bar_~size, bar_~res~0, bar_~i~0;bar_~b.base, bar_~b.offset := bar_#in~b.base, bar_#in~b.offset;bar_~size := bar_#in~size;bar_~res~0 := 0;havoc bar_~i~0;bar_~i~0 := 0; VAL [ULTIMATE.start_bar_~b.base=2, ULTIMATE.start_bar_~b.offset=0, ULTIMATE.start_bar_~i~0=0, ULTIMATE.start_bar_~res~0=0, ULTIMATE.start_bar_~size=1, ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_bar_#in~b.base|=2, |ULTIMATE.start_bar_#in~b.offset|=0, |ULTIMATE.start_bar_#in~size|=1, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(bar_~i~0 < bar_~size); VAL [ULTIMATE.start_bar_~b.base=2, ULTIMATE.start_bar_~b.offset=0, ULTIMATE.start_bar_~i~0=0, ULTIMATE.start_bar_~res~0=0, ULTIMATE.start_bar_~size=1, ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_bar_#in~b.base|=2, |ULTIMATE.start_bar_#in~b.offset|=0, |ULTIMATE.start_bar_#in~size|=1, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !(4 + (bar_~b.offset + 4 * bar_~i~0) <= #length[bar_~b.base] && 0 <= bar_~b.offset + 4 * bar_~i~0); VAL [ULTIMATE.start_bar_~b.base=2, ULTIMATE.start_bar_~b.offset=0, ULTIMATE.start_bar_~i~0=0, ULTIMATE.start_bar_~res~0=0, ULTIMATE.start_bar_~size=1, ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_bar_#in~b.base|=2, |ULTIMATE.start_bar_#in~b.offset|=0, |ULTIMATE.start_bar_#in~size|=1, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !(foo_~i~1 < foo_~size); [L25] bar_#in~b.base, bar_#in~b.offset, bar_#in~size := foo_~#a~0.base, foo_~#a~0.offset, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b.base, bar_~b.offset, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b.base, bar_~b.offset := bar_#in~b.base, bar_#in~b.offset; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L13-L15] assume !!(bar_~i~0 < bar_~size); VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L14] call bar_#t~mem1 := read~int(bar_~b.base, bar_~b.offset + 4 * bar_~i~0, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !(foo_~i~1 < foo_~size); [L25] bar_#in~b.base, bar_#in~b.offset, bar_#in~size := foo_~#a~0.base, foo_~#a~0.offset, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b.base, bar_~b.offset, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b.base, bar_~b.offset := bar_#in~b.base, bar_#in~b.offset; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L13-L15] assume !!(bar_~i~0 < bar_~size); VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L14] call bar_#t~mem1 := read~int(bar_~b.base, bar_~b.offset + 4 * bar_~i~0, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND TRUE !(foo_~i~1 < foo_~size) [L25] bar_#in~b, bar_#in~size := foo_~#a~0, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b := bar_#in~b; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L13-L15] COND FALSE !(!(bar_~i~0 < bar_~size)) VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L14] FCALL call bar_#t~mem1 := read~int({ base: bar_~b!base, offset: bar_~b!offset + 4 * bar_~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND TRUE !(foo_~i~1 < foo_~size) [L25] bar_#in~b, bar_#in~size := foo_~#a~0, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b := bar_#in~b; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L13-L15] COND FALSE !(!(bar_~i~0 < bar_~size)) VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L14] FCALL call bar_#t~mem1 := read~int({ base: bar_~b!base, offset: bar_~b!offset + 4 * bar_~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND TRUE !(~i~1 < ~size) [L11-L17] ~b := #in~b; [L11-L17] ~size := #in~size; [L12] ~res~0 := 0; [L12] havoc ~i~0; [L13] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call #t~mem1 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND TRUE !(~i~1 < ~size) [L11-L17] ~b := #in~b; [L11-L17] ~size := #in~size; [L12] ~res~0 := 0; [L12] havoc ~i~0; [L13] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call #t~mem1 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] [L32] int i, b[100]; [L33] i = 0 [L33] COND TRUE i < 100 [L21] int a[n], i; [L22] i = 0 [L22] COND FALSE !(i < size) [L12] int res = 0, i; [L13] i = 0 [L13] COND TRUE i < size [L14] b[i] ----- [2018-11-23 02:26:22,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:26:22 ImpRootNode [2018-11-23 02:26:22,734 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:26:22,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:26:22,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:26:22,734 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:26:22,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:22" (3/4) ... [2018-11-23 02:26:22,737 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset;havoc main_~i~2;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400);main_~i~2 := 0; VAL [ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(main_~i~2 < 100);foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, main_~i~2;havoc foo_#res;havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1;foo_~n := foo_#in~n;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n);havoc foo_~i~1;foo_~i~1 := 0; VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(foo_~i~1 < foo_~size);}EndParallelCompositionbar_#in~b.base, bar_#in~b.offset, bar_#in~size := foo_~#a~0.base, foo_~#a~0.offset, 1 + foo_~size;havoc bar_#res;havoc bar_#t~mem1, bar_#t~post0, bar_~b.base, bar_~b.offset, bar_~size, bar_~res~0, bar_~i~0;bar_~b.base, bar_~b.offset := bar_#in~b.base, bar_#in~b.offset;bar_~size := bar_#in~size;bar_~res~0 := 0;havoc bar_~i~0;bar_~i~0 := 0; VAL [ULTIMATE.start_bar_~b.base=2, ULTIMATE.start_bar_~b.offset=0, ULTIMATE.start_bar_~i~0=0, ULTIMATE.start_bar_~res~0=0, ULTIMATE.start_bar_~size=1, ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_bar_#in~b.base|=2, |ULTIMATE.start_bar_#in~b.offset|=0, |ULTIMATE.start_bar_#in~size|=1, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(bar_~i~0 < bar_~size); VAL [ULTIMATE.start_bar_~b.base=2, ULTIMATE.start_bar_~b.offset=0, ULTIMATE.start_bar_~i~0=0, ULTIMATE.start_bar_~res~0=0, ULTIMATE.start_bar_~size=1, ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_bar_#in~b.base|=2, |ULTIMATE.start_bar_#in~b.offset|=0, |ULTIMATE.start_bar_#in~size|=1, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !(4 + (bar_~b.offset + 4 * bar_~i~0) <= #length[bar_~b.base] && 0 <= bar_~b.offset + 4 * bar_~i~0); VAL [ULTIMATE.start_bar_~b.base=2, ULTIMATE.start_bar_~b.offset=0, ULTIMATE.start_bar_~i~0=0, ULTIMATE.start_bar_~res~0=0, ULTIMATE.start_bar_~size=1, ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_bar_#in~b.base|=2, |ULTIMATE.start_bar_#in~b.offset|=0, |ULTIMATE.start_bar_#in~size|=1, |ULTIMATE.start_foo_#in~b.base|=3, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=0, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !(foo_~i~1 < foo_~size); [L25] bar_#in~b.base, bar_#in~b.offset, bar_#in~size := foo_~#a~0.base, foo_~#a~0.offset, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b.base, bar_~b.offset, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b.base, bar_~b.offset := bar_#in~b.base, bar_#in~b.offset; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L13-L15] assume !!(bar_~i~0 < bar_~size); VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L14] call bar_#t~mem1 := read~int(bar_~b.base, bar_~b.offset + 4 * bar_~i~0, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !(foo_~i~1 < foo_~size); [L25] bar_#in~b.base, bar_#in~b.offset, bar_#in~size := foo_~#a~0.base, foo_~#a~0.offset, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b.base, bar_~b.offset, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b.base, bar_~b.offset := bar_#in~b.base, bar_#in~b.offset; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L13-L15] assume !!(bar_~i~0 < bar_~size); VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [L14] call bar_#t~mem1 := read~int(bar_~b.base, bar_~b.offset + 4 * bar_~i~0, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, bar_#in~b.base=2, bar_#in~b.offset=0, bar_#in~size=1, bar_~b.base=2, bar_~b.offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b.base=3, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=3, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND TRUE !(foo_~i~1 < foo_~size) [L25] bar_#in~b, bar_#in~size := foo_~#a~0, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b := bar_#in~b; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L13-L15] COND FALSE !(!(bar_~i~0 < bar_~size)) VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L14] FCALL call bar_#t~mem1 := read~int({ base: bar_~b!base, offset: bar_~b!offset + 4 * bar_~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND TRUE !(foo_~i~1 < foo_~size) [L25] bar_#in~b, bar_#in~size := foo_~#a~0, 1 + foo_~size; [L25] havoc bar_#res; [L25] havoc bar_#t~mem1, bar_#t~post0, bar_~b, bar_~size, bar_~res~0, bar_~i~0; [L11-L17] bar_~b := bar_#in~b; [L11-L17] bar_~size := bar_#in~size; [L12] bar_~res~0 := 0; [L12] havoc bar_~i~0; [L13] bar_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L13-L15] COND FALSE !(!(bar_~i~0 < bar_~size)) VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [L14] FCALL call bar_#t~mem1 := read~int({ base: bar_~b!base, offset: bar_~b!offset + 4 * bar_~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, bar_#in~b!base=2, bar_#in~b!offset=0, bar_#in~size=1, bar_~b!base=2, bar_~b!offset=0, bar_~i~0=0, bar_~res~0=0, bar_~size=1, foo_#in~b!base=3, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=0, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=3, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND TRUE !(~i~1 < ~size) [L11-L17] ~b := #in~b; [L11-L17] ~size := #in~size; [L12] ~res~0 := 0; [L12] havoc ~i~0; [L13] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call #t~mem1 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND TRUE !(~i~1 < ~size) [L11-L17] ~b := #in~b; [L11-L17] ~size := #in~size; [L12] ~res~0 := 0; [L12] havoc ~i~0; [L13] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L13-L15] COND FALSE !(!(~i~0 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L14] FCALL call #t~mem1 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~0 }, 4); [?] requires #sizeOfReadType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] [L32] int i, b[100]; [L33] i = 0 [L33] COND TRUE i < 100 [L21] int a[n], i; [L22] i = 0 [L22] COND FALSE !(i < size) [L12] int res = 0, i; [L13] i = 0 [L13] COND TRUE i < size [L14] b[i] ----- [2018-11-23 02:26:22,775 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_be262b9c-49d8-4c5b-a477-69bf08860603/bin-2019/ukojak/witness.graphml [2018-11-23 02:26:22,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:26:22,776 INFO L168 Benchmark]: Toolchain (without parser) took 1294.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -70.8 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,778 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:26:22,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.82 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -207.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,779 INFO L168 Benchmark]: Boogie Preprocessor took 21.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,780 INFO L168 Benchmark]: RCFGBuilder took 392.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,780 INFO L168 Benchmark]: CodeCheck took 615.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,781 INFO L168 Benchmark]: Witness Printer took 41.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:26:22,784 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 40 locations, 11 error locations. UNSAFE Result, 0.5s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 6 SDslu, 0 SDs, 0 SdLazy, 176 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 14]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 [L33] COND TRUE i < 100 [L21] int a[n], i; [L22] i = 0 [L22] COND FALSE !(i < size) [L12] int res = 0, i; [L13] i = 0 [L13] COND TRUE i < size [L14] b[i] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.82 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -207.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * CodeCheck took 615.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. * Witness Printer took 41.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...