./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_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_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/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 aeae4642ea0f346b37f312868ec7e7128e333d20 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:27:35,948 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:27:35,949 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:27:35,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:27:35,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:27:35,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:27:35,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:27:35,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:27:35,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:27:35,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:27:35,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:27:35,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:27:35,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:27:35,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:27:35,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:27:35,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:27:35,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:27:35,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:27:35,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:27:35,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:27:35,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:27:35,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:27:35,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:27:35,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:27:35,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:27:35,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:27:35,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:27:35,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:27:35,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:27:35,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:27:35,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:27:35,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:27:35,975 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:27:35,975 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:27:35,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:27:35,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:27:35,976 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 00:27:35,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:27:35,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:27:35,987 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:27:35,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:27:35,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:27:35,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 00:27:35,988 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 00:27:35,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:27:35,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:27:35,989 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:27:35,989 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 00:27:35,989 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 00:27:35,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:27:35,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:27:35,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 00:27:35,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:27:35,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:27:35,990 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 00:27:35,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:27:35,990 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_ab490f62-7ea7-41a7-a64e-65823ccdafd0/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 -> aeae4642ea0f346b37f312868ec7e7128e333d20 [2018-11-23 00:27:36,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:27:36,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:27:36,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:27:36,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:27:36,027 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:27:36,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.c [2018-11-23 00:27:36,072 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/data/16f5ea1b6/60e66f6ed6c4489d982ce1cdc892cccc/FLAG7ec17398e [2018-11-23 00:27:36,412 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:27:36,412 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.c [2018-11-23 00:27:36,418 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/data/16f5ea1b6/60e66f6ed6c4489d982ce1cdc892cccc/FLAG7ec17398e [2018-11-23 00:27:36,829 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/data/16f5ea1b6/60e66f6ed6c4489d982ce1cdc892cccc [2018-11-23 00:27:36,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:27:36,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:27:36,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:27:36,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:27:36,836 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:27:36,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:36,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e96cc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36, skipping insertion in model container [2018-11-23 00:27:36,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:36,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:27:36,858 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:27:36,964 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:27:36,969 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:27:36,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:27:36,990 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:27:36,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36 WrapperNode [2018-11-23 00:27:36,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:27:36,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:27:36,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:27:36,991 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:27:36,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:27:37,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:27:37,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:27:37,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:27:37,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... [2018-11-23 00:27:37,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:27:37,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:27:37,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:27:37,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:27:37,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/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 00:27:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:27:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:27:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:27:37,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:27:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:27:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:27:37,296 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:27:37,296 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 00:27:37,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:37 BoogieIcfgContainer [2018-11-23 00:27:37,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:27:37,297 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 00:27:37,297 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 00:27:37,305 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 00:27:37,305 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:37" (1/1) ... [2018-11-23 00:27:37,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:27:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:27:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 19 states and 22 transitions. [2018-11-23 00:27:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 00:27:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 00:27:37,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:27:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:27:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:27:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:27:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 20 states and 24 transitions. [2018-11-23 00:27:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2018-11-23 00:27:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 00:27:37,458 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:27:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:27:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:27:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:27:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:27:37,512 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0.base, main_~#b~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400);main_~i~1 := 0; VAL [ULTIMATE.start_main_~i~1=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(main_~i~1 < 100);foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~n := foo_#in~n;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~0=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~1=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_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(foo_~i~0 < 1 + foo_~size); VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~0=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~1=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_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !(0 <= foo_~i~0 && foo_~i~0 < foo_~n); VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~0=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~1=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_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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0.base, main_~#b~0.offset; [L21] havoc main_~i~1; [L21] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L22-L24] assume !!(main_~i~1 < 100); [L23] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L14-L16] assume !!(foo_~i~0 < 1 + foo_~size); 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0.base, main_~#b~0.offset; [L21] havoc main_~i~1; [L21] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L22-L24] assume !!(main_~i~1 < 100); [L23] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L14-L16] assume !!(foo_~i~0 < 1 + foo_~size); 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0; [L21] havoc main_~i~1; [L21] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L22-L24] COND FALSE !(!(main_~i~1 < 100)) [L23] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~1, main_~#b~0, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b := foo_#in~b; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L14-L16] COND FALSE !(!(foo_~i~0 < 1 + foo_~size)) 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0; [L21] havoc main_~i~1; [L21] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L22-L24] COND FALSE !(!(main_~i~1 < 100)) [L23] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~1, main_~#b~0, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b := foo_#in~b; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L14-L16] COND FALSE !(!(foo_~i~0 < 1 + foo_~size)) 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; 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; [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#NULL!base=0, #NULL!offset=0] [L21] int i, b[100]; [L22] i = 0 [L22] COND TRUE i < 100 [L13] int a[n], i; [L14] i = 0 [L14] COND TRUE i < size + 1 [L15] a[i] ----- [2018-11-23 00:27:37,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:27:37 ImpRootNode [2018-11-23 00:27:37,537 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 00:27:37,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:27:37,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:27:37,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:27:37,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:37" (3/4) ... [2018-11-23 00:27:37,540 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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0.base, main_~#b~0.offset;havoc main_~i~1;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400);main_~i~1 := 0; VAL [ULTIMATE.start_main_~i~1=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(main_~i~1 < 100);foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~i~1;havoc foo_#res;havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0;foo_~n := foo_#in~n;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;havoc foo_~a~0;havoc foo_~i~0;foo_~i~0 := 0; VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~0=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~1=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_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(foo_~i~0 < 1 + foo_~size); VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~0=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~1=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_main_~#b~0.base|=3, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !(0 <= foo_~i~0 && foo_~i~0 < foo_~n); VAL [ULTIMATE.start_foo_~b.base=3, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~0=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=0, ULTIMATE.start_main_~i~1=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_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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0.base, main_~#b~0.offset; [L21] havoc main_~i~1; [L21] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L22-L24] assume !!(main_~i~1 < 100); [L23] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L14-L16] assume !!(foo_~i~0 < 1 + foo_~size); 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0.base, main_~#b~0.offset; [L21] havoc main_~i~1; [L21] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L22-L24] assume !!(main_~i~1 < 100); [L23] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~1, main_~#b~0.base, main_~#b~0.offset, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L14-L16] assume !!(foo_~i~0 < 1 + foo_~size); 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b.base=3, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0.base=3, main_~#b~0.offset=0, main_~i~1=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0; [L21] havoc main_~i~1; [L21] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L22-L24] COND FALSE !(!(main_~i~1 < 100)) [L23] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~1, main_~#b~0, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b := foo_#in~b; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L14-L16] COND FALSE !(!(foo_~i~0 < 1 + foo_~size)) 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=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~ret3, main_#t~post2, main_#t~mem4, main_~i~1, main_~#b~0; [L21] havoc main_~i~1; [L21] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L22] main_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L22-L24] COND FALSE !(!(main_~i~1 < 100)) [L23] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~1, main_~#b~0, main_~i~1; [L23] havoc foo_#res; [L23] havoc foo_#t~mem1, foo_#t~post0, foo_~n, foo_~b, foo_~size, foo_~a~0, foo_~i~0; [L12-L18] foo_~n := foo_#in~n; [L12-L18] foo_~b := foo_#in~b; [L12-L18] foo_~size := foo_#in~size; [L13] havoc foo_~a~0; [L13] havoc foo_~i~0; [L14] foo_~i~0 := 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L14-L16] COND FALSE !(!(foo_~i~0 < 1 + foo_~size)) 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [L15] assert 0 <= foo_~i~0 && foo_~i~0 < foo_~n; 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_~b!base=3, foo_~b!offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, main_~#b~0!base=3, main_~#b~0!offset=0, main_~i~1=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; 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; [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#NULL!base=0, #NULL!offset=0] [L21] int i, b[100]; [L22] i = 0 [L22] COND TRUE i < 100 [L13] int a[n], i; [L14] i = 0 [L14] COND TRUE i < size + 1 [L15] a[i] ----- [2018-11-23 00:27:37,568 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ab490f62-7ea7-41a7-a64e-65823ccdafd0/bin-2019/ukojak/witness.graphml [2018-11-23 00:27:37,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:27:37,569 INFO L168 Benchmark]: Toolchain (without parser) took 737.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -122.0 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:27:37,570 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:27:37,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.52 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 00:27:37,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.27 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:27:37,572 INFO L168 Benchmark]: Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:27:37,572 INFO L168 Benchmark]: RCFGBuilder took 268.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:27:37,573 INFO L168 Benchmark]: CodeCheck took 240.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:27:37,573 INFO L168 Benchmark]: Witness Printer took 30.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:27:37,575 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, 30 locations, 8 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: 15]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L21] int i, b[100]; [L22] i = 0 [L22] COND TRUE i < 100 [L13] int a[n], i; [L14] i = 0 [L14] COND TRUE i < size + 1 [L15] a[i] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 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 157.52 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 21.27 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.64 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 268.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * CodeCheck took 240.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Witness Printer took 30.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...