./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/Addition01_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-numeric/Addition01_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 322d6666d3f93c432b488498d9f05628aeb50fb9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:24:21,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:24:21,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:24:21,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:24:21,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:24:21,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:24:21,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:24:21,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:24:21,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:24:21,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:24:21,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:24:21,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:24:21,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:24:21,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:24:21,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:24:21,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:24:21,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:24:21,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:24:21,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:24:21,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:24:21,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:24:21,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:24:21,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:24:21,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:24:21,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:24:21,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:24:21,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:24:21,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:24:21,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:24:21,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:24:21,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:24:21,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:24:21,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:24:21,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:24:21,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:24:21,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:24:21,526 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 06:24:21,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:24:21,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:24:21,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:24:21,534 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:24:21,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:24:21,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:24:21,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:24:21,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:24:21,535 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:24:21,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:24:21,536 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:24:21,536 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:24:21,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:24:21,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:24:21,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:24:21,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:24:21,537 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:24:21,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:24:21,537 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 06:24:21,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:24:21,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:24:21,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 322d6666d3f93c432b488498d9f05628aeb50fb9 [2018-11-23 06:24:21,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:24:21,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:24:21,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:24:21,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:24:21,574 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:24:21,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/../../sv-benchmarks/c/termination-numeric/Addition01_false-no-overflow.c [2018-11-23 06:24:21,614 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/data/5bb1d365d/4169922f55064bcf891a471e2f508bd0/FLAG5e49ca612 [2018-11-23 06:24:22,002 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:24:22,002 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/sv-benchmarks/c/termination-numeric/Addition01_false-no-overflow.c [2018-11-23 06:24:22,006 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/data/5bb1d365d/4169922f55064bcf891a471e2f508bd0/FLAG5e49ca612 [2018-11-23 06:24:22,017 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/data/5bb1d365d/4169922f55064bcf891a471e2f508bd0 [2018-11-23 06:24:22,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:24:22,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:24:22,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:24:22,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:24:22,024 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:24:22,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc0002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22, skipping insertion in model container [2018-11-23 06:24:22,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:24:22,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:24:22,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:24:22,150 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:24:22,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:24:22,168 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:24:22,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22 WrapperNode [2018-11-23 06:24:22,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:24:22,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:24:22,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:24:22,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:24:22,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:24:22,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:24:22,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:24:22,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:24:22,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:24:22,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:24:22,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:24:22,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:24:22,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:24:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/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 06:24:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:24:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:24:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2018-11-23 06:24:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2018-11-23 06:24:22,434 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:24:22,435 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 06:24:22,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:24:22 BoogieIcfgContainer [2018-11-23 06:24:22,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:24:22,435 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:24:22,435 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:24:22,445 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:24:22,445 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:24:22" (1/1) ... [2018-11-23 06:24:22,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:24:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:24:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 33 states and 39 transitions. [2018-11-23 06:24:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 06:24:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:24:22,496 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:24:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:24:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:24:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:24:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:24:22,623 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~m~0=2147483647] [?] assume !(main_~m~0 <= 0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=1] [?] assume !(main_~n~0 <= 0); VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=1] [?] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [|addition_#in~m|=2147483647, |addition_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(0 == ~n); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume ~n > 0; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(1 + ~m <= 2147483647); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28-L30] assume !(main_~m~0 <= 0); [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32-L34] assume !(main_~n~0 <= 0); VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28-L30] assume !(main_~m~0 <= 0); [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32-L34] assume !(main_~n~0 <= 0); VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28] COND FALSE !(main_~m~0 <= 0) [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32] COND FALSE !(main_~n~0 <= 0) VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28] COND FALSE !(main_~m~0 <= 0) [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32] COND FALSE !(main_~n~0 <= 0) VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; [L28] COND FALSE !(~m~0 <= 0) [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~n~0 := #t~nondet3; [L31] havoc #t~nondet3; [L32] COND FALSE !(~n~0 <= 0) [L35] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; [L28] COND FALSE !(~m~0 <= 0) [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~n~0 := #t~nondet3; [L31] havoc #t~nondet3; [L32] COND FALSE !(~n~0 <= 0) [L35] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m <= 0) [L31] int n = __VERIFIER_nondet_int(); [L32] COND FALSE !(n <= 0) [L35] CALL addition(m,n) VAL [\old(m)=2147483647, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L18] m+1 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] ----- [2018-11-23 06:24:22,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 06:24:22 ImpRootNode [2018-11-23 06:24:22,649 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 06:24:22,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:24:22,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:24:22,650 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:24:22,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:24:22" (3/4) ... [2018-11-23 06:24:22,653 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~m~0=2147483647] [?] assume !(main_~m~0 <= 0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=1] [?] assume !(main_~n~0 <= 0); VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=1] [?] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [|addition_#in~m|=2147483647, |addition_#in~n|=1] [?] ~m := #in~m;~n := #in~n; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(0 == ~n); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume ~n > 0; VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] assume !(1 + ~m <= 2147483647); VAL [addition_~m=2147483647, addition_~n=1, |addition_#in~m|=2147483647, |addition_#in~n|=1] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28-L30] assume !(main_~m~0 <= 0); [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32-L34] assume !(main_~n~0 <= 0); VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28-L30] assume !(main_~m~0 <= 0); [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32-L34] assume !(main_~n~0 <= 0); VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14-L16] assume !(0 == ~n); VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17-L19] assume ~n > 0; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28] COND FALSE !(main_~m~0 <= 0) [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32] COND FALSE !(main_~n~0 <= 0) VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0; [L27] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L27] main_~m~0 := main_#t~nondet2; [L27] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L28] COND FALSE !(main_~m~0 <= 0) [L31] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L31] main_~n~0 := main_#t~nondet3; [L31] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=1] [L32] COND FALSE !(main_~n~0 <= 0) VAL [main_~m~0=2147483647, main_~n~0=1] [L35] CALL call main_#t~ret4 := addition(main_~m~0, main_~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; [L28] COND FALSE !(~m~0 <= 0) [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~n~0 := #t~nondet3; [L31] havoc #t~nondet3; [L32] COND FALSE !(~n~0 <= 0) [L35] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L27] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L27] ~m~0 := #t~nondet2; [L27] havoc #t~nondet2; [L28] COND FALSE !(~m~0 <= 0) [L31] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L31] ~n~0 := #t~nondet3; [L31] havoc #t~nondet3; [L32] COND FALSE !(~n~0 <= 0) [L35] CALL call #t~ret4 := addition(~m~0, ~n~0); VAL [#in~m=2147483647, #in~n=1] [L13-L23] ~m := #in~m; [L13-L23] ~n := #in~n; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L14] COND FALSE !(0 == ~n) VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L17] COND TRUE ~n > 0 VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L18] assert 1 + ~m <= 2147483647; VAL [#in~m=2147483647, #in~n=1, ~m=2147483647, ~n=1] [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m <= 0) [L31] int n = __VERIFIER_nondet_int(); [L32] COND FALSE !(n <= 0) [L35] CALL addition(m,n) VAL [\old(m)=2147483647, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L18] m+1 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] ----- [2018-11-23 06:24:22,686 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a3e8c533-c083-4a71-b8a4-4f1ce990d007/bin-2019/ukojak/witness.graphml [2018-11-23 06:24:22,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:24:22,687 INFO L168 Benchmark]: Toolchain (without parser) took 666.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:24:22,688 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:24:22,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.15 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:24:22,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:24:22,689 INFO L168 Benchmark]: Boogie Preprocessor took 12.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:24:22,689 INFO L168 Benchmark]: RCFGBuilder took 235.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:24:22,690 INFO L168 Benchmark]: CodeCheck took 214.03 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:24:22,690 INFO L168 Benchmark]: Witness Printer took 36.63 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:24:22,692 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 2 procedures, 34 locations, 8 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 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, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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: 18]: integer overflow possible integer overflow possible We found a FailurePath: [L27] int m = __VERIFIER_nondet_int(); [L28] COND FALSE !(m <= 0) [L31] int n = __VERIFIER_nondet_int(); [L32] COND FALSE !(n <= 0) [L35] CALL addition(m,n) VAL [\old(m)=2147483647, \old(n)=1] [L14] COND FALSE !(n == 0) VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L17] COND TRUE n > 0 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] [L18] m+1 VAL [\old(m)=2147483647, \old(n)=1, m=2147483647, n=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.15 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 235.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -204.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 214.03 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.63 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...