./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_15x0_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_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/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 31319b3dce926b7eddaa50d24c240f6870931f21 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 12:51:46,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:51:46,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:51:46,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:51:46,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:51:46,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:51:46,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:51:46,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:51:46,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:51:46,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:51:46,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:51:46,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:51:46,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:51:46,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:51:46,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:51:46,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:51:46,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:51:46,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:51:46,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:51:46,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:51:46,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:51:46,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:51:46,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:51:46,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:51:46,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:51:46,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:51:46,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:51:46,923 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:51:46,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:51:46,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:51:46,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:51:46,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:51:46,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:51:46,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:51:46,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:51:46,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:51:46,927 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:51:46,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:51:46,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:51:46,938 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:51:46,938 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:51:46,938 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:51:46,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:51:46,939 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:51:46,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:51:46,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:51:46,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:51:46,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:51:46,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:51:46,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:51:46,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:51:46,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:51:46,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:51:46,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:51:46,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:51:46,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:51:46,942 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:51:46,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:51:46,942 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:51:46,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:51:46,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:51:46,942 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_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/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 -> 31319b3dce926b7eddaa50d24c240f6870931f21 [2018-11-23 12:51:46,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:51:46,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:51:46,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:51:46,981 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:51:46,981 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:51:46,982 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c [2018-11-23 12:51:47,028 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/data/6bbda787e/350b486516de46bc95b15d4cf5f5d82a/FLAG8a8c4c0e0 [2018-11-23 12:51:47,357 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:51:47,357 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/sv-benchmarks/c/recursive-simple/sum_15x0_false-unreach-call_true-termination.c [2018-11-23 12:51:47,362 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/data/6bbda787e/350b486516de46bc95b15d4cf5f5d82a/FLAG8a8c4c0e0 [2018-11-23 12:51:47,814 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/data/6bbda787e/350b486516de46bc95b15d4cf5f5d82a [2018-11-23 12:51:47,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:51:47,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:51:47,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:51:47,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:51:47,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:51:47,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,822 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 12:51:47, skipping insertion in model container [2018-11-23 12:51:47,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:51:47,838 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:51:47,945 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:51:47,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:51:47,956 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:51:47,964 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:51:47,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47 WrapperNode [2018-11-23 12:51:47,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:51:47,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:51:47,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:51:47,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:51:47,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:51:47,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:51:47,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:51:47,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:51:47,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... [2018-11-23 12:51:47,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:51:47,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:51:47,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:51:47,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:51:47,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/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 12:51:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:51:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:51:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:51:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:51:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 12:51:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 12:51:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:51:48,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:51:48,150 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:51:48,150 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:51:48,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:51:48 BoogieIcfgContainer [2018-11-23 12:51:48,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:51:48,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:51:48,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:51:48,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:51:48,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:51:47" (1/3) ... [2018-11-23 12:51:48,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557d478f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:51:48, skipping insertion in model container [2018-11-23 12:51:48,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:51:47" (2/3) ... [2018-11-23 12:51:48,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557d478f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:51:48, skipping insertion in model container [2018-11-23 12:51:48,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:51:48" (3/3) ... [2018-11-23 12:51:48,156 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0_false-unreach-call_true-termination.c [2018-11-23 12:51:48,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:51:48,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:51:48,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:51:48,193 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:51:48,193 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:51:48,193 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:51:48,193 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:51:48,193 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:51:48,193 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:51:48,193 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:51:48,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:51:48,194 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:51:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 12:51:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:51:48,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:48,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:48,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:48,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-11-23 12:51:48,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:48,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:48,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:48,331 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 12:51:48,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:51:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:51:48,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:51:48,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:51:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:51:48,345 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 12:51:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:48,410 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:51:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:51:48,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:51:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:48,419 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:51:48,419 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:51:48,422 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 12:51:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:51:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:51:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:51:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:51:48,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:51:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:48,452 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:51:48,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:51:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:51:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:51:48,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:48,454 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 12:51:48,454 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-11-23 12:51:48,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:48,521 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 12:51:48,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:48,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/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 12:51:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:48,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:48,591 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 12:51:48,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:48,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:51:48,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:51:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:51:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:51:48,607 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 12:51:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:48,678 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:51:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:51:48,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:51:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:48,679 INFO L225 Difference]: With dead ends: 25 [2018-11-23 12:51:48,680 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:51:48,680 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 12:51:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:51:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:51:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:51:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:51:48,685 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 12:51:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:48,685 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:51:48,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:51:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:51:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:51:48,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:48,687 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 12:51:48,687 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:48,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-11-23 12:51:48,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:48,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:48,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:51:48,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:48,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:51:48,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:51:48,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:48,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:51:48,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:48,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 12:51:48,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:51:48,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:51:48,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:51:48,814 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 12:51:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:48,859 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:51:48,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:51:48,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 12:51:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:48,860 INFO L225 Difference]: With dead ends: 28 [2018-11-23 12:51:48,860 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:51:48,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:51:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:51:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:51:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:51:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 12:51:48,864 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 12:51:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:48,864 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 12:51:48,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:51:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:51:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:51:48,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:48,865 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:48,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:48,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-11-23 12:51:48,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:48,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:48,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:48,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:51:48,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:48,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:48,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:51:48,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:51:48,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:48,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:51:49,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:49,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 12:51:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:51:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:51:49,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:51:49,008 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-23 12:51:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:49,075 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:51:49,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:51:49,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-23 12:51:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:49,076 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:51:49,076 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:51:49,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:51:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:51:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:51:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:51:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:51:49,082 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 12:51:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:49,082 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:51:49,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:51:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:51:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:51:49,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:49,083 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:49,083 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:49,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-11-23 12:51:49,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:49,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:49,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:49,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 12:51:49,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:49,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:49,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:51:49,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:51:49,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:49,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 12:51:49,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:49,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 12:51:49,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:51:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:51:49,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:51:49,229 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 12:51:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:49,298 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:51:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:51:49,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 12:51:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:49,299 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:51:49,299 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:51:49,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:51:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:51:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:51:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:51:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 12:51:49,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 12:51:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:49,304 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 12:51:49,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:51:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:51:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:51:49,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:49,305 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:49,305 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:49,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-11-23 12:51:49,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:49,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:49,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:49,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:51:49,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:49,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:49,415 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:51:49,446 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:51:49,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:49,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:51:49,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:49,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 12:51:49,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:51:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:51:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:51:49,479 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-11-23 12:51:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:49,564 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:51:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:51:49,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 12:51:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:49,565 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:51:49,565 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:51:49,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:51:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:51:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:51:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:51:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:51:49,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 12:51:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:49,571 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:51:49,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:51:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:51:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:51:49,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:49,572 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:49,573 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:49,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-11-23 12:51:49,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:49,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:49,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:49,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:51:49,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:49,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:51:49,698 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:51:49,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:49,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:51:49,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 12:51:49,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:51:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:51:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:51:49,734 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 12:51:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:49,804 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:51:49,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:51:49,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-23 12:51:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:49,805 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:51:49,806 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:51:49,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:51:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:51:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:51:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:51:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:51:49,810 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 12:51:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:49,810 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:51:49,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:51:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:51:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:51:49,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:49,811 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:49,811 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:49,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-11-23 12:51:49,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:49,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 12:51:49,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:49,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:49,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:49,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 12:51:49,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:49,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 12:51:49,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:51:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:51:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:51:49,949 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-23 12:51:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:50,069 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:51:50,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:51:50,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 12:51:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:50,070 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:51:50,070 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:51:50,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:51:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:51:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:51:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:51:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:51:50,075 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 12:51:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:50,076 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:51:50,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:51:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:51:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:51:50,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:50,077 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:50,077 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:50,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-11-23 12:51:50,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:50,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:50,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:51:50,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:50,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:51:50,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:51:50,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:50,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:51:50,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:50,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 12:51:50,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:51:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:51:50,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:51:50,256 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-23 12:51:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:50,356 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:51:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:51:50,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-23 12:51:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:50,357 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:51:50,358 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:51:50,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:51:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:51:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:51:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:51:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:51:50,361 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 12:51:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:50,361 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:51:50,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:51:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:51:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:51:50,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:50,362 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:50,362 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:50,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-11-23 12:51:50,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:50,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 12:51:50,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:50,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:50,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:51:50,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:51:50,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:50,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 12:51:50,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:50,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 12:51:50,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:51:50,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:51:50,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:51:50,543 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-11-23 12:51:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:50,656 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:51:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:51:50,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:51:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:50,657 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:51:50,657 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:51:50,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:51:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:51:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:51:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:51:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:51:50,662 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 12:51:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:50,663 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:51:50,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:51:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:51:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:51:50,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:50,664 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:50,664 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:50,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-11-23 12:51:50,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:50,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:50,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:50,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:50,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 12:51:50,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:50,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:50,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:51:50,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:51:50,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:50,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 12:51:50,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:50,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 12:51:50,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:51:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:51:50,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:51:50,865 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-11-23 12:51:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:51,001 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:51:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:51:51,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-11-23 12:51:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:51,003 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:51:51,003 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:51:51,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:51:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:51:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:51:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:51:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 12:51:51,008 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-23 12:51:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:51,008 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 12:51:51,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:51:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:51:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:51:51,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:51,009 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:51,009 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:51,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2018-11-23 12:51:51,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:51,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:51:51,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:51,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:51,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:51:51,196 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:51:51,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:51,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:51:51,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:51,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 12:51:51,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:51:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:51:51,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:51:51,233 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-11-23 12:51:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:51,371 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:51:51,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:51:51,371 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-11-23 12:51:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:51,372 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:51:51,372 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:51:51,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:51:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:51:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 12:51:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:51:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 12:51:51,378 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-23 12:51:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:51,378 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 12:51:51,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:51:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:51:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:51:51,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:51,379 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:51,379 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:51,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2018-11-23 12:51:51,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:51,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:51,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 12:51:51,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:51,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:51,529 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:51:51,566 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:51:51,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:51,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 12:51:51,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:51,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 12:51:51,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:51:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:51:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:51:51,625 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2018-11-23 12:51:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:51,785 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:51:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:51:51,785 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-23 12:51:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:51,786 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:51:51,786 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:51:51,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:51:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:51:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 12:51:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:51:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 12:51:51,789 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-23 12:51:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:51,789 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 12:51:51,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:51:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:51:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:51:51,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:51,790 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:51,790 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:51,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2018-11-23 12:51:51,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:51,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:51,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 12:51:51,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:51,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:51,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 12:51:51,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:51,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 12:51:51,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:51:51,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:51:51,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:51:51,957 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2018-11-23 12:51:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:52,104 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:51:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:51:52,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-11-23 12:51:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:52,105 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:51:52,105 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:51:52,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:51:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:51:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 12:51:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:51:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 12:51:52,109 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-23 12:51:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:52,109 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 12:51:52,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:51:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:51:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:51:52,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:52,110 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:52,110 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:52,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2018-11-23 12:51:52,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:51:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:51:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 12:51:52,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:51:52,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:51:52,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:51:52,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:51:52,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:51:52,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:51:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 12:51:52,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:51:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 12:51:52,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:51:52,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:51:52,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:51:52,318 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-11-23 12:51:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:51:52,469 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 12:51:52,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:51:52,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-11-23 12:51:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:51:52,470 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:51:52,470 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:51:52,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:51:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:51:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 12:51:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:51:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 12:51:52,474 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-23 12:51:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:51:52,475 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 12:51:52,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:51:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:51:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:51:52,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:51:52,476 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:51:52,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:51:52,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:51:52,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2018-11-23 12:51:52,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:51:52,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:51:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:52,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:51:52,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:51:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:51:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:51:52,516 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 := 15;~b~0 := 0; VAL [main_~a~0=15, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=15] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=14] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=13] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=12] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=11] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=11, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=12, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=13, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=14, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=15, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] assume true; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] assume true; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] assume true; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] assume true; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] assume true; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] assume true; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] assume true; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] assume true; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] assume true; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] assume true; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] assume true; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] assume true; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] assume true; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] assume true; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] assume true; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] assume true; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] RET #32#return; VAL [main_~a~0=15, main_~b~0=0, |main_#t~ret1|=15] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume !false; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L12] int a = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] ----- [2018-11-23 12:51:52,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:51:52 BoogieIcfgContainer [2018-11-23 12:51:52,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:51:52,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:51:52,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:51:52,657 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:51:52,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:51:48" (3/4) ... [2018-11-23 12:51:52,660 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 := 15;~b~0 := 0; VAL [main_~a~0=15, main_~b~0=0] [?] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [|sum_#in~m|=0, |sum_#in~n|=15] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] assume !(~n <= 0); VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=1, |sum_#in~n|=14] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] assume !(~n <= 0); VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=2, |sum_#in~n|=13] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] assume !(~n <= 0); VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=3, |sum_#in~n|=12] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] assume !(~n <= 0); VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=4, |sum_#in~n|=11] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] assume !(~n <= 0); VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=5, |sum_#in~n|=10] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] assume !(~n <= 0); VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=6, |sum_#in~n|=9] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] assume !(~n <= 0); VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=7, |sum_#in~n|=8] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] assume !(~n <= 0); VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=8, |sum_#in~n|=7] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] assume !(~n <= 0); VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=9, |sum_#in~n|=6] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] assume !(~n <= 0); VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=10, |sum_#in~n|=5] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] assume !(~n <= 0); VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=11, |sum_#in~n|=4] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] assume !(~n <= 0); VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=12, |sum_#in~n|=3] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] assume !(~n <= 0); VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=13, |sum_#in~n|=2] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] assume !(~n <= 0); VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=14, |sum_#in~n|=1] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] assume !(~n <= 0); VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1] [?] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [|sum_#in~m|=15, |sum_#in~n|=0] [?] ~n := #in~n;~m := #in~m; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0] [?] assume ~n <= 0;#res := ~m + ~n; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] assume true; VAL [sum_~m=15, sum_~n=0, |sum_#in~m|=15, |sum_#in~n|=0, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] assume true; VAL [sum_~m=14, sum_~n=1, |sum_#in~m|=14, |sum_#in~n|=1, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] assume true; VAL [sum_~m=13, sum_~n=2, |sum_#in~m|=13, |sum_#in~n|=2, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] assume true; VAL [sum_~m=12, sum_~n=3, |sum_#in~m|=12, |sum_#in~n|=3, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] assume true; VAL [sum_~m=11, sum_~n=4, |sum_#in~m|=11, |sum_#in~n|=4, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] assume true; VAL [sum_~m=10, sum_~n=5, |sum_#in~m|=10, |sum_#in~n|=5, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] assume true; VAL [sum_~m=9, sum_~n=6, |sum_#in~m|=9, |sum_#in~n|=6, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] assume true; VAL [sum_~m=8, sum_~n=7, |sum_#in~m|=8, |sum_#in~n|=7, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] assume true; VAL [sum_~m=7, sum_~n=8, |sum_#in~m|=7, |sum_#in~n|=8, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] assume true; VAL [sum_~m=6, sum_~n=9, |sum_#in~m|=6, |sum_#in~n|=9, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] assume true; VAL [sum_~m=5, sum_~n=10, |sum_#in~m|=5, |sum_#in~n|=10, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] assume true; VAL [sum_~m=4, sum_~n=11, |sum_#in~m|=4, |sum_#in~n|=11, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] assume true; VAL [sum_~m=3, sum_~n=12, |sum_#in~m|=3, |sum_#in~n|=12, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] assume true; VAL [sum_~m=2, sum_~n=13, |sum_#in~m|=2, |sum_#in~n|=13, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] assume true; VAL [sum_~m=1, sum_~n=14, |sum_#in~m|=1, |sum_#in~n|=14, |sum_#res|=15] [?] RET #30#return; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] assume true; VAL [sum_~m=0, sum_~n=15, |sum_#in~m|=0, |sum_#in~n|=15, |sum_#res|=15] [?] RET #32#return; VAL [main_~a~0=15, main_~b~0=0, |main_#t~ret1|=15] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume ~result~0 == ~a~0 + ~b~0; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] assume !false; VAL [main_~a~0=15, main_~b~0=0, main_~result~0=15] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4-L8] assume !(~n <= 0); VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4-L8] assume !(~n <= 0); VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4-L8] assume !(~n <= 0); VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4-L8] assume !(~n <= 0); VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4-L8] assume !(~n <= 0); VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4-L8] assume !(~n <= 0); VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4-L8] assume !(~n <= 0); VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4-L8] assume !(~n <= 0); VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4-L8] assume !(~n <= 0); VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4-L8] assume !(~n <= 0); VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4-L8] assume !(~n <= 0); VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4-L8] assume !(~n <= 0); VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4-L8] assume !(~n <= 0); VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4-L8] assume !(~n <= 0); VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4-L8] assume !(~n <= 0); VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4-L8] assume ~n <= 0; [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L3-L9] ensures true; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L3-L9] ensures true; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L3-L9] ensures true; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L3-L9] ensures true; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L3-L9] ensures true; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L3-L9] ensures true; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L3-L9] ensures true; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L3-L9] ensures true; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L3-L9] ensures true; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L3-L9] ensures true; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L3-L9] ensures true; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L3-L9] ensures true; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L3-L9] ensures true; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L3-L9] ensures true; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L3-L9] ensures true; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L3-L9] ensures true; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15-L17] assume ~result~0 == ~a~0 + ~b~0; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] ~a~0 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] ----- ----- 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 := 15; [L13] ~b~0 := 0; VAL [~a~0=15, ~b~0=0] [L14] CALL call #t~ret1 := sum(~a~0, ~b~0); VAL [#in~m=0, #in~n=15] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L4] COND FALSE !(~n <= 0) VAL [#in~m=0, #in~n=15, ~m=0, ~n=15] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L4] COND FALSE !(~n <= 0) VAL [#in~m=1, #in~n=14, ~m=1, ~n=14] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L4] COND FALSE !(~n <= 0) VAL [#in~m=2, #in~n=13, ~m=2, ~n=13] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L4] COND FALSE !(~n <= 0) VAL [#in~m=3, #in~n=12, ~m=3, ~n=12] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L4] COND FALSE !(~n <= 0) VAL [#in~m=4, #in~n=11, ~m=4, ~n=11] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L4] COND FALSE !(~n <= 0) VAL [#in~m=5, #in~n=10, ~m=5, ~n=10] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L4] COND FALSE !(~n <= 0) VAL [#in~m=6, #in~n=9, ~m=6, ~n=9] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L4] COND FALSE !(~n <= 0) VAL [#in~m=7, #in~n=8, ~m=7, ~n=8] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L4] COND FALSE !(~n <= 0) VAL [#in~m=8, #in~n=7, ~m=8, ~n=7] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L4] COND FALSE !(~n <= 0) VAL [#in~m=9, #in~n=6, ~m=9, ~n=6] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L4] COND FALSE !(~n <= 0) VAL [#in~m=10, #in~n=5, ~m=10, ~n=5] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L4] COND FALSE !(~n <= 0) VAL [#in~m=11, #in~n=4, ~m=11, ~n=4] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L4] COND FALSE !(~n <= 0) VAL [#in~m=12, #in~n=3, ~m=12, ~n=3] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L4] COND FALSE !(~n <= 0) VAL [#in~m=13, #in~n=2, ~m=13, ~n=2] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L4] COND FALSE !(~n <= 0) VAL [#in~m=14, #in~n=1, ~m=14, ~n=1] [L7] CALL call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=15, #in~n=0] [L3-L9] ~n := #in~n; [L3-L9] ~m := #in~m; VAL [#in~m=15, #in~n=0, ~m=15, ~n=0] [L4] COND TRUE ~n <= 0 [L5] #res := ~m + ~n; VAL [#in~m=15, #in~n=0, #res=15, ~m=15, ~n=0] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=14, #in~n=1, #t~ret0=15, ~m=14, ~n=1] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=14, #in~n=1, #res=15, ~m=14, ~n=1] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=13, #in~n=2, #t~ret0=15, ~m=13, ~n=2] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=13, #in~n=2, #res=15, ~m=13, ~n=2] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=12, #in~n=3, #t~ret0=15, ~m=12, ~n=3] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=12, #in~n=3, #res=15, ~m=12, ~n=3] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=11, #in~n=4, #t~ret0=15, ~m=11, ~n=4] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=11, #in~n=4, #res=15, ~m=11, ~n=4] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=10, #in~n=5, #t~ret0=15, ~m=10, ~n=5] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=10, #in~n=5, #res=15, ~m=10, ~n=5] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=9, #in~n=6, #t~ret0=15, ~m=9, ~n=6] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=9, #in~n=6, #res=15, ~m=9, ~n=6] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=8, #in~n=7, #t~ret0=15, ~m=8, ~n=7] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=8, #in~n=7, #res=15, ~m=8, ~n=7] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=7, #in~n=8, #t~ret0=15, ~m=7, ~n=8] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=7, #in~n=8, #res=15, ~m=7, ~n=8] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=6, #in~n=9, #t~ret0=15, ~m=6, ~n=9] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=6, #in~n=9, #res=15, ~m=6, ~n=9] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=5, #in~n=10, #t~ret0=15, ~m=5, ~n=10] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=5, #in~n=10, #res=15, ~m=5, ~n=10] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=4, #in~n=11, #t~ret0=15, ~m=4, ~n=11] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=4, #in~n=11, #res=15, ~m=4, ~n=11] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=3, #in~n=12, #t~ret0=15, ~m=3, ~n=12] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=3, #in~n=12, #res=15, ~m=3, ~n=12] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=2, #in~n=13, #t~ret0=15, ~m=2, ~n=13] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=2, #in~n=13, #res=15, ~m=2, ~n=13] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=1, #in~n=14, #t~ret0=15, ~m=1, ~n=14] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=1, #in~n=14, #res=15, ~m=1, ~n=14] [L7] RET call #t~ret0 := sum(~n - 1, 1 + ~m); VAL [#in~m=0, #in~n=15, #t~ret0=15, ~m=0, ~n=15] [L7] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L7] #res := #t~ret0; [L7] havoc #t~ret0; VAL [#in~m=0, #in~n=15, #res=15, ~m=0, ~n=15] [L14] RET call #t~ret1 := sum(~a~0, ~b~0); VAL [#t~ret1=15, ~a~0=15, ~b~0=0] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] ~result~0 := #t~ret1; [L14] havoc #t~ret1; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L15] COND TRUE ~result~0 == ~a~0 + ~b~0 VAL [~a~0=15, ~b~0=0, ~result~0=15] [L16] assert false; VAL [~a~0=15, ~b~0=0, ~result~0=15] [L12] int a = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] ----- [2018-11-23 12:51:53,094 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b4f6d8d-27e1-40a8-b59f-87df7c385d52/bin-2019/uautomizer/witness.graphml [2018-11-23 12:51:53,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:51:53,095 INFO L168 Benchmark]: Toolchain (without parser) took 5278.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 952.7 MB in the beginning and 944.5 MB in the end (delta: 8.2 MB). Peak memory consumption was 290.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:53,096 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:51:53,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:53,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.69 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:51:53,097 INFO L168 Benchmark]: Boogie Preprocessor took 10.81 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:53,097 INFO L168 Benchmark]: RCFGBuilder took 162.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -212.0 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:53,097 INFO L168 Benchmark]: TraceAbstraction took 4505.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.2 GB in the beginning and 951.1 MB in the end (delta: 200.2 MB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:53,098 INFO L168 Benchmark]: Witness Printer took 437.20 ms. Allocated memory is still 1.3 GB. Free memory was 951.1 MB in the beginning and 944.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:53,099 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 11.69 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.81 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 162.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -212.0 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4505.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.2 GB in the beginning and 951.1 MB in the end (delta: 200.2 MB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. * Witness Printer took 437.20 ms. Allocated memory is still 1.3 GB. Free memory was 951.1 MB in the beginning and 944.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 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 = 15; [L13] int b = 0; VAL [a=15, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=15, b=0, sum(a, b)=15] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=15, b=0, result=15] [L16] __VERIFIER_error() VAL [a=15, b=0, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 318 SDslu, 1152 SDs, 0 SdLazy, 900 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1203 GetRequests, 933 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1740 NumberOfCodeBlocks, 1740 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 267360 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2408 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 3150/6300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...