./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17db2a72807ac377d533a347dbb668103ea580a0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-02 03:45:13,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 03:45:13,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 03:45:13,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 03:45:13,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 03:45:13,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 03:45:13,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 03:45:13,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 03:45:13,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 03:45:13,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 03:45:13,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 03:45:13,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 03:45:13,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 03:45:13,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 03:45:13,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 03:45:13,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 03:45:13,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 03:45:13,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 03:45:13,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 03:45:13,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 03:45:13,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 03:45:13,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 03:45:13,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 03:45:13,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 03:45:13,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 03:45:13,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 03:45:13,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 03:45:13,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 03:45:13,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 03:45:13,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 03:45:13,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 03:45:13,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 03:45:13,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 03:45:13,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 03:45:13,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 03:45:13,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 03:45:13,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 03:45:13,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 03:45:13,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 03:45:13,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 03:45:13,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 03:45:13,980 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 03:45:13,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 03:45:13,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 03:45:13,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 03:45:13,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 03:45:13,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 03:45:13,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 03:45:13,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 03:45:13,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 03:45:13,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 03:45:13,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 03:45:13,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 03:45:13,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 03:45:13,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 03:45:13,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 03:45:13,995 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 03:45:13,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 03:45:13,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 03:45:13,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 03:45:13,996 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 03:45:13,996 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 03:45:13,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 03:45:13,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 03:45:13,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 03:45:13,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 03:45:13,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 03:45:13,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 03:45:13,997 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 03:45:13,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 03:45:13,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 03:45:13,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17db2a72807ac377d533a347dbb668103ea580a0 [2019-12-02 03:45:14,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 03:45:14,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 03:45:14,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 03:45:14,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 03:45:14,114 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 03:45:14,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/../../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2019-12-02 03:45:14,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/data/dd501f64c/56bccb3153ce4ba0b58293d833311eaa/FLAG42743f009 [2019-12-02 03:45:14,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 03:45:14,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2019-12-02 03:45:14,559 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/data/dd501f64c/56bccb3153ce4ba0b58293d833311eaa/FLAG42743f009 [2019-12-02 03:45:14,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/data/dd501f64c/56bccb3153ce4ba0b58293d833311eaa [2019-12-02 03:45:14,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 03:45:14,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 03:45:14,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 03:45:14,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 03:45:14,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 03:45:14,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d6bff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14, skipping insertion in model container [2019-12-02 03:45:14,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 03:45:14,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 03:45:14,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 03:45:14,690 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 03:45:14,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 03:45:14,742 INFO L208 MainTranslator]: Completed translation [2019-12-02 03:45:14,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14 WrapperNode [2019-12-02 03:45:14,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 03:45:14,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 03:45:14,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 03:45:14,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 03:45:14,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 03:45:14,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 03:45:14,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 03:45:14,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 03:45:14,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 03:45:14,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 03:45:14,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 03:45:14,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 03:45:14,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:45:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 03:45:14,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 03:45:14,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 03:45:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-12-02 03:45:14,819 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-12-02 03:45:14,919 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 03:45:14,919 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-02 03:45:14,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:45:14 BoogieIcfgContainer [2019-12-02 03:45:14,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 03:45:14,920 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 03:45:14,920 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 03:45:14,927 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 03:45:14,927 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:45:14" (1/1) ... [2019-12-02 03:45:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 03:45:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2019-12-02 03:45:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-12-02 03:45:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 03:45:14,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:45:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 18 states and 22 transitions. [2019-12-02 03:45:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-12-02 03:45:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-02 03:45:15,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 03:45:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 23 states and 32 transitions. [2019-12-02 03:45:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2019-12-02 03:45:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 03:45:15,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 03:45:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 28 states and 44 transitions. [2019-12-02 03:45:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2019-12-02 03:45:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 03:45:15,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 03:45:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 33 states and 58 transitions. [2019-12-02 03:45:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. [2019-12-02 03:45:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-02 03:45:16,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-02 03:45:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 38 states and 74 transitions. [2019-12-02 03:45:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 74 transitions. [2019-12-02 03:45:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 03:45:17,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-02 03:45:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 43 states and 92 transitions. [2019-12-02 03:45:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 92 transitions. [2019-12-02 03:45:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-02 03:45:17,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-02 03:45:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 48 states and 112 transitions. [2019-12-02 03:45:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 112 transitions. [2019-12-02 03:45:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 03:45:18,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-02 03:45:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 53 states and 134 transitions. [2019-12-02 03:45:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 134 transitions. [2019-12-02 03:45:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 03:45:19,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 03:45:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 58 states and 158 transitions. [2019-12-02 03:45:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 158 transitions. [2019-12-02 03:45:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 03:45:20,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-02 03:45:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 63 states and 184 transitions. [2019-12-02 03:45:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 184 transitions. [2019-12-02 03:45:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 03:45:22,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-02 03:45:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 68 states and 212 transitions. [2019-12-02 03:45:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 212 transitions. [2019-12-02 03:45:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 03:45:23,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-02 03:45:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 73 states and 242 transitions. [2019-12-02 03:45:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 242 transitions. [2019-12-02 03:45:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-02 03:45:25,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-02 03:45:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 78 states and 274 transitions. [2019-12-02 03:45:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 274 transitions. [2019-12-02 03:45:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-02 03:45:26,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-02 03:45:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 83 states and 308 transitions. [2019-12-02 03:45:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 308 transitions. [2019-12-02 03:45:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-02 03:45:28,025 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-02 03:45:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 88 states and 344 transitions. [2019-12-02 03:45:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 344 transitions. [2019-12-02 03:45:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-02 03:45:29,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-12-02 03:45:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 93 states and 382 transitions. [2019-12-02 03:45:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 382 transitions. [2019-12-02 03:45:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-02 03:45:31,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-12-02 03:45:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 98 states and 422 transitions. [2019-12-02 03:45:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 422 transitions. [2019-12-02 03:45:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 03:45:33,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-12-02 03:45:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 103 states and 464 transitions. [2019-12-02 03:45:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 464 transitions. [2019-12-02 03:45:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 03:45:36,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-12-02 03:45:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 108 states and 508 transitions. [2019-12-02 03:45:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 508 transitions. [2019-12-02 03:45:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 03:45:38,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:45:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-02 03:45:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:45:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 113 states and 554 transitions. [2019-12-02 03:45:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 554 transitions. [2019-12-02 03:45:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-02 03:45:40,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:45:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:45:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:45:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:45:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:45:40,877 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 iterations. [2019-12-02 03:45:40,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 03:45:40 ImpRootNode [2019-12-02 03:45:40,914 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 03:45:40,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 03:45:40,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 03:45:40,915 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 03:45:40,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:45:14" (3/4) ... [2019-12-02 03:45:40,917 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 03:45:40,988 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0125e2e2-a4cf-4e2c-b5bf-1f73707c2bec/bin/ukojak/witness.graphml [2019-12-02 03:45:40,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 03:45:40,989 INFO L168 Benchmark]: Toolchain (without parser) took 26418.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -77.2 MB). Peak memory consumption was 265.7 MB. Max. memory is 11.5 GB. [2019-12-02 03:45:40,990 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 03:45:40,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-02 03:45:40,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 03:45:40,991 INFO L168 Benchmark]: Boogie Preprocessor took 10.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 03:45:40,991 INFO L168 Benchmark]: RCFGBuilder took 143.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-12-02 03:45:40,992 INFO L168 Benchmark]: CodeCheck took 25994.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2019-12-02 03:45:40,992 INFO L168 Benchmark]: Witness Printer took 73.35 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-12-02 03:45:40,994 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: UNSAFE, OverallTime: 25.9s, OverallIterations: 21, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5767168 SDtfs, 4194300 SDslu, 5242872 SDs, 0 SdLazy, 67632756 SolverSat, 15204332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30038 GetRequests, 28678 SyntacticMatches, 1048 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52404 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1300 ConstructedInterpolants, 0 QuantifiedInterpolants, 635040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 143.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * CodeCheck took 25994.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.6 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. * Witness Printer took 73.35 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...