./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/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 59acfc6d5178664a3f2144603274c2b6e876292a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-02 08:25:37,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:25:37,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:25:37,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:25:37,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:25:37,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:25:37,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:25:37,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:25:37,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:25:37,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:25:37,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:25:37,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:25:37,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:25:37,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:25:37,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:25:37,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:25:37,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:25:37,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:25:37,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:25:37,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:25:37,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:25:37,878 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:25:37,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:25:37,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:25:37,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:25:37,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:25:37,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:25:37,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:25:37,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:25:37,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:25:37,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:25:37,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:25:37,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:25:37,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:25:37,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:25:37,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:25:37,883 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 08:25:37,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:25:37,890 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:25:37,891 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:25:37,891 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 08:25:37,891 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:25:37,891 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:25:37,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:25:37,892 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:25:37,893 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 08:25:37,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 08:25:37,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:25:37,893 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 08:25:37,894 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:25:37,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:25:37,894 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_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 59acfc6d5178664a3f2144603274c2b6e876292a [2018-12-02 08:25:37,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:25:37,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:25:37,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:25:37,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:25:37,921 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:25:37,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-12-02 08:25:37,955 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/data/555ba4ddc/a4d4a12f7181445aa59d02714640659a/FLAG1e789aba5 [2018-12-02 08:25:38,399 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:25:38,399 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-12-02 08:25:38,403 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/data/555ba4ddc/a4d4a12f7181445aa59d02714640659a/FLAG1e789aba5 [2018-12-02 08:25:38,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/data/555ba4ddc/a4d4a12f7181445aa59d02714640659a [2018-12-02 08:25:38,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:25:38,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:25:38,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:25:38,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:25:38,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:25:38,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59185f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38, skipping insertion in model container [2018-12-02 08:25:38,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:25:38,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:25:38,514 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:25:38,516 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:25:38,524 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:25:38,532 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:25:38,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38 WrapperNode [2018-12-02 08:25:38,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:25:38,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:25:38,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:25:38,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:25:38,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:25:38,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:25:38,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:25:38,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:25:38,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:25:38,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:25:38,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:25:38,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:25:38,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:25:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 08:25:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:25:38,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:25:38,626 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-12-02 08:25:38,627 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-12-02 08:25:38,712 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:25:38,712 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 08:25:38,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:38 BoogieIcfgContainer [2018-12-02 08:25:38,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:25:38,713 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 08:25:38,713 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 08:25:38,719 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 08:25:38,719 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:38" (1/1) ... [2018-12-02 08:25:38,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:25:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-12-02 08:25:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-02 08:25:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 08:25:38,751 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:25:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 16 states and 18 transitions. [2018-12-02 08:25:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-02 08:25:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 08:25:38,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 08:25:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 23 transitions. [2018-12-02 08:25:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-02 08:25:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:25:38,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 08:25:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 22 states and 29 transitions. [2018-12-02 08:25:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2018-12-02 08:25:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:25:39,097 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 08:25:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 25 states and 36 transitions. [2018-12-02 08:25:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2018-12-02 08:25:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 08:25:39,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 08:25:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 28 states and 44 transitions. [2018-12-02 08:25:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2018-12-02 08:25:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 08:25:39,298 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 08:25:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 31 states and 53 transitions. [2018-12-02 08:25:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. [2018-12-02 08:25:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 08:25:39,419 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 08:25:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 34 states and 63 transitions. [2018-12-02 08:25:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 63 transitions. [2018-12-02 08:25:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 08:25:39,558 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 08:25:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 37 states and 74 transitions. [2018-12-02 08:25:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 74 transitions. [2018-12-02 08:25:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 08:25:39,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 08:25:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 40 states and 86 transitions. [2018-12-02 08:25:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 86 transitions. [2018-12-02 08:25:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 08:25:39,820 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 08:25:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 43 states and 99 transitions. [2018-12-02 08:25:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 99 transitions. [2018-12-02 08:25:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 08:25:39,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 08:25:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 46 states and 113 transitions. [2018-12-02 08:25:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 113 transitions. [2018-12-02 08:25:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 08:25:40,143 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-02 08:25:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 49 states and 128 transitions. [2018-12-02 08:25:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 128 transitions. [2018-12-02 08:25:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 08:25:40,306 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-02 08:25:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 52 states and 144 transitions. [2018-12-02 08:25:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 144 transitions. [2018-12-02 08:25:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 08:25:40,466 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-02 08:25:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 55 states and 161 transitions. [2018-12-02 08:25:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 161 transitions. [2018-12-02 08:25:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:25:40,623 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-02 08:25:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 58 states and 179 transitions. [2018-12-02 08:25:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 179 transitions. [2018-12-02 08:25:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 08:25:40,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-02 08:25:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 61 states and 198 transitions. [2018-12-02 08:25:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 198 transitions. [2018-12-02 08:25:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 08:25:41,008 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-02 08:25:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 64 states and 218 transitions. [2018-12-02 08:25:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 218 transitions. [2018-12-02 08:25:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 08:25:41,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-02 08:25:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 67 states and 239 transitions. [2018-12-02 08:25:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 239 transitions. [2018-12-02 08:25:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 08:25:41,467 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-02 08:25:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 70 states and 261 transitions. [2018-12-02 08:25:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 261 transitions. [2018-12-02 08:25:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 08:25:41,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-02 08:25:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 73 states and 284 transitions. [2018-12-02 08:25:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 284 transitions. [2018-12-02 08:25:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 08:25:41,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-12-02 08:25:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 76 states and 308 transitions. [2018-12-02 08:25:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 308 transitions. [2018-12-02 08:25:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-02 08:25:42,162 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-12-02 08:25:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 79 states and 333 transitions. [2018-12-02 08:25:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 333 transitions. [2018-12-02 08:25:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 08:25:42,430 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-12-02 08:25:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 82 states and 359 transitions. [2018-12-02 08:25:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 359 transitions. [2018-12-02 08:25:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 08:25:42,669 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-12-02 08:25:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 85 states and 386 transitions. [2018-12-02 08:25:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 386 transitions. [2018-12-02 08:25:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 08:25:42,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:25:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-12-02 08:25:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 08:25:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 88 states and 414 transitions. [2018-12-02 08:25:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 414 transitions. [2018-12-02 08:25:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 08:25:43,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 08:25:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:25:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:25:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:25:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:25:43,316 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 26 iterations. [2018-12-02 08:25:43,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 08:25:43 ImpRootNode [2018-12-02 08:25:43,358 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 08:25:43,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:25:43,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:25:43,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:25:43,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:25:38" (3/4) ... [2018-12-02 08:25:43,361 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 08:25:43,415 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9155456c-5408-413a-8c72-632389500270/bin-2019/ukojak/witness.graphml [2018-12-02 08:25:43,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:25:43,416 INFO L168 Benchmark]: Toolchain (without parser) took 5002.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 957.1 MB in the beginning and 863.8 MB in the end (delta: 93.3 MB). Peak memory consumption was 403.1 MB. Max. memory is 11.5 GB. [2018-12-02 08:25:43,417 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:25:43,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.80 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:25:43,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.85 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:25:43,417 INFO L168 Benchmark]: Boogie Preprocessor took 9.08 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:25:43,417 INFO L168 Benchmark]: RCFGBuilder took 152.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:25:43,418 INFO L168 Benchmark]: CodeCheck took 4645.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 873.4 MB in the end (delta: 240.2 MB). Peak memory consumption was 415.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:25:43,418 INFO L168 Benchmark]: Witness Printer took 56.96 ms. Allocated memory is still 1.3 GB. Free memory was 873.4 MB in the beginning and 863.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:25:43,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 4.5s OverallTime, 26 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234881024 SDtfs, 218103800 SDslu, 352321520 SDs, 0 SdLazy, 1023409942 SolverSat, 184549370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37043 GetRequests, 35418 SyntacticMatches, 1523 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3683 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 540800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/15000 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.80 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 17.85 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.08 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 152.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * CodeCheck took 4645.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 873.4 MB in the end (delta: 240.2 MB). Peak memory consumption was 415.8 MB. Max. memory is 11.5 GB. * Witness Printer took 56.96 ms. Allocated memory is still 1.3 GB. Free memory was 873.4 MB in the beginning and 863.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...