./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_2x3_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_2x3_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5417ea5971c5cfa3624e07fbe8bf33ef4632cb6f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:31:07,332 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:31:07,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:31:07,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:31:07,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:31:07,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:31:07,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:31:07,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:31:07,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:31:07,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:31:07,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:31:07,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:31:07,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:31:07,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:31:07,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:31:07,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:31:07,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:31:07,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:31:07,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:31:07,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:31:07,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:31:07,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:31:07,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:31:07,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:31:07,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:31:07,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:31:07,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:31:07,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:31:07,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:31:07,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:31:07,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:31:07,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:31:07,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:31:07,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:31:07,369 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:31:07,369 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:31:07,370 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:31:07,379 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:31:07,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:31:07,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:31:07,380 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:31:07,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:31:07,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:31:07,381 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:31:07,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:31:07,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:31:07,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:31:07,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:31:07,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:31:07,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:31:07,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:31:07,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:31:07,382 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:31:07,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:31:07,384 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:31:07,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:31:07,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:31:07,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:31:07,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:31:07,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:31:07,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:31:07,386 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:31:07,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:31:07,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:31:07,386 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:31:07,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:31:07,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:31:07,387 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_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5417ea5971c5cfa3624e07fbe8bf33ef4632cb6f [2018-11-23 03:31:07,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:31:07,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:31:07,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:31:07,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:31:07,433 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:31:07,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/sum_2x3_false-unreach-call_true-termination.c [2018-11-23 03:31:07,489 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/data/6040fe63b/eeb999301d8a4b6fa1d436533e47f13a/FLAGbd320931a [2018-11-23 03:31:07,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:31:07,854 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/sv-benchmarks/c/recursive-simple/sum_2x3_false-unreach-call_true-termination.c [2018-11-23 03:31:07,858 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/data/6040fe63b/eeb999301d8a4b6fa1d436533e47f13a/FLAGbd320931a [2018-11-23 03:31:08,272 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/data/6040fe63b/eeb999301d8a4b6fa1d436533e47f13a [2018-11-23 03:31:08,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:31:08,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:31:08,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:31:08,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:31:08,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:31:08,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337624aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08, skipping insertion in model container [2018-11-23 03:31:08,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:31:08,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:31:08,427 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:31:08,430 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:31:08,440 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:31:08,450 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:31:08,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08 WrapperNode [2018-11-23 03:31:08,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:31:08,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:31:08,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:31:08,451 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:31:08,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:31:08,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:31:08,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:31:08,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:31:08,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... [2018-11-23 03:31:08,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:31:08,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:31:08,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:31:08,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:31:08,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:31:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:31:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:31:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:31:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:31:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 03:31:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 03:31:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:31:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:31:08,669 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:31:08,669 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:31:08,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:08 BoogieIcfgContainer [2018-11-23 03:31:08,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:31:08,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:31:08,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:31:08,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:31:08,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:31:08" (1/3) ... [2018-11-23 03:31:08,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5c68fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:08, skipping insertion in model container [2018-11-23 03:31:08,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:08" (2/3) ... [2018-11-23 03:31:08,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5c68fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:08, skipping insertion in model container [2018-11-23 03:31:08,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:08" (3/3) ... [2018-11-23 03:31:08,675 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_2x3_false-unreach-call_true-termination.c [2018-11-23 03:31:08,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:31:08,687 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:31:08,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:31:08,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:31:08,728 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:31:08,728 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:31:08,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:31:08,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:31:08,728 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:31:08,728 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:31:08,729 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:31:08,729 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:31:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 03:31:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 03:31:08,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:31:08,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:31:08,755 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:31:08,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:31:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-11-23 03:31:08,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:31:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:31:08,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:31:08,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:31:08,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:31:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:31:08,906 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 03:31:08,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:31:08,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:31:08,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:31:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:31:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:31:08,923 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 03:31:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:31:08,998 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 03:31:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:31:08,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 03:31:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:31:09,010 INFO L225 Difference]: With dead ends: 30 [2018-11-23 03:31:09,010 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 03:31:09,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:31:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 03:31:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 03:31:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:31:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 03:31:09,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 03:31:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:31:09,054 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 03:31:09,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:31:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 03:31:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:31:09,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:31:09,056 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:31:09,057 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:31:09,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:31:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-11-23 03:31:09,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:31:09,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:31:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:31:09,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:31:09,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:31:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:31:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:31:09,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:31:09,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:31:09,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:31:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:31:09,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:31:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:31:09,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:31:09,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 03:31:09,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:31:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:31:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:31:09,215 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 03:31:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:31:09,283 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 03:31:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:31:09,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 03:31:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:31:09,284 INFO L225 Difference]: With dead ends: 25 [2018-11-23 03:31:09,284 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 03:31:09,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:31:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 03:31:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 03:31:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 03:31:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 03:31:09,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 03:31:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:31:09,291 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 03:31:09,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:31:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 03:31:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:31:09,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:31:09,292 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:31:09,292 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:31:09,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:31:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-11-23 03:31:09,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:31:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:31:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:31:09,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:31:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:31:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:31:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:31:09,337 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~a~0 := 2;~b~0 := 3; VAL [main_~a~0=2, main_~b~0=3] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=3, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=0, |sum_#in~m|=5, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=5, sum_~n=0, |sum_#in~m|=5, |sum_#in~n|=0, |sum_#res|=5] [?] assume true; VAL [sum_~m=5, sum_~n=0, |sum_#in~m|=5, |sum_#in~n|=0, |sum_#res|=5] [?] RET #30#return; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1, |sum_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1, |sum_#res|=5] [?] assume true; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1, |sum_#res|=5] [?] RET #30#return; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2, |sum_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2, |sum_#res|=5] [?] assume true; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2, |sum_#res|=5] [?] RET #32#return; VAL [main_~a~0=2, main_~b~0=3, |main_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=2, main_~b~0=3, main_~result~0=5] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=2, main_~b~0=3, main_~result~0=5] [?] assume !false; VAL [main_~a~0=2, main_~b~0=3, main_~result~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L3-L9] ensures true; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L3-L9] ensures true; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L3-L9] ensures true; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L3-L9] ensures true; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L3-L9] ensures true; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L3-L9] ensures true; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L12] int a = 2; [L13] int b = 3; VAL [a=2, b=3] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=3, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=2, m=3, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=1, m=4, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=5, \old(n)=0, \result=5, m=5, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1, m=4, n=1, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=2, m=3, n=2, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=2, b=3, sum(a, b)=5] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=2, b=3, result=5] [L16] __VERIFIER_error() VAL [a=2, b=3, result=5] ----- [2018-11-23 03:31:09,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:31:09 BoogieIcfgContainer [2018-11-23 03:31:09,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:31:09,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:31:09,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:31:09,386 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:31:09,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:08" (3/4) ... [2018-11-23 03:31:09,393 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~a~0 := 2;~b~0 := 3; VAL [main_~a~0=2, main_~b~0=3] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=3, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=0, |sum_#in~m|=5, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=5, sum_~n=0, |sum_#in~m|=5, |sum_#in~n|=0, |sum_#res|=5] [?] assume true; VAL [sum_~m=5, sum_~n=0, |sum_#in~m|=5, |sum_#in~n|=0, |sum_#res|=5] [?] RET #30#return; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1, |sum_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1, |sum_#res|=5] [?] assume true; VAL [sum_~m=4, sum_~n=1, |sum_#in~m|=4, |sum_#in~n|=1, |sum_#res|=5] [?] RET #30#return; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2, |sum_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2, |sum_#res|=5] [?] assume true; VAL [sum_~m=3, sum_~n=2, |sum_#in~m|=3, |sum_#in~n|=2, |sum_#res|=5] [?] RET #32#return; VAL [main_~a~0=2, main_~b~0=3, |main_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=2, main_~b~0=3, main_~result~0=5] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=2, main_~b~0=3, main_~result~0=5] [?] assume !false; VAL [main_~a~0=2, main_~b~0=3, main_~result~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L3-L9] ensures true; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L3-L9] ensures true; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L3-L9] ensures true; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L3-L9] ensures true; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L3-L9] ensures true; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L3-L9] ensures true; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 2; [L13] ~b~0 := 3; VAL [~a~0=2, ~b~0=3] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=3, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=2, ~m=3, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=1, ~m=4, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=0, ~m=5, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=5, #in~n=0, #res=5, ~m=5, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=1, #t~ret0=5, ~m=4, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=1, #res=5, ~m=4, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=2, #t~ret0=5, ~m=3, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=2, #res=5, ~m=3, ~n=2] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=5, ~a~0=2, ~b~0=3] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=2, ~b~0=3, ~result~0=5] [L16] assert false; VAL [~a~0=2, ~b~0=3, ~result~0=5] [L12] int a = 2; [L13] int b = 3; VAL [a=2, b=3] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=3, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=2, m=3, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=1, m=4, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=5, \old(n)=0, \result=5, m=5, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1, m=4, n=1, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=2, m=3, n=2, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=2, b=3, sum(a, b)=5] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=2, b=3, result=5] [L16] __VERIFIER_error() VAL [a=2, b=3, result=5] ----- [2018-11-23 03:31:09,455 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0da239c-09df-4835-a0aa-97a471f49c77/bin-2019/uautomizer/witness.graphml [2018-11-23 03:31:09,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:31:09,456 INFO L168 Benchmark]: Toolchain (without parser) took 1180.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -104.0 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:31:09,457 INFO L168 Benchmark]: CDTParser took 0.18 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 03:31:09,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.19 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 03:31:09,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.05 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:31:09,458 INFO L168 Benchmark]: Boogie Preprocessor took 12.24 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 03:31:09,458 INFO L168 Benchmark]: RCFGBuilder took 191.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:31:09,459 INFO L168 Benchmark]: TraceAbstraction took 715.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:31:09,459 INFO L168 Benchmark]: Witness Printer took 69.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:31:09,462 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 174.19 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 14.05 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.24 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. * RCFGBuilder took 191.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 715.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * Witness Printer took 69.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 2; [L13] int b = 3; VAL [a=2, b=3] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=3, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=2, m=3, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=1, m=4, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=5, \old(n)=0, \result=5, m=5, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1, m=4, n=1, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=2, m=3, n=2, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=2, b=3, sum(a, b)=5] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=2, b=3, result=5] [L16] __VERIFIER_error() VAL [a=2, b=3, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 19 SDslu, 65 SDs, 0 SdLazy, 50 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1536 SizeOfPredicates, 3 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...