./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/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 a033d09eab07f8bc6e49bb4301ebd6c89110f535 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:05:08,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:05:08,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:05:08,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:05:08,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:05:08,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:05:08,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:05:08,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:05:08,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:05:08,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:05:08,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:05:08,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:05:08,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:05:08,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:05:08,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:05:08,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:05:08,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:05:08,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:05:08,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:05:08,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:05:08,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:05:08,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:05:08,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:05:08,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:05:08,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:05:08,329 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:05:08,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:05:08,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:05:08,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:05:08,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:05:08,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:05:08,332 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:05:08,332 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:05:08,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:05:08,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:05:08,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:05:08,334 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 12:05:08,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:05:08,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:05:08,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:05:08,342 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 12:05:08,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:05:08,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:05:08,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:05:08,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:05:08,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:05:08,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:05:08,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:05:08,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:05:08,345 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 12:05:08,345 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 12:05:08,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:05:08,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:05:08,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:05:08,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:05:08,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:05:08,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:05:08,348 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 12:05:08,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:05:08,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:05:08,348 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_3aa688d6-f0fb-4900-a55e-9f77da869b1f/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 -> a033d09eab07f8bc6e49bb4301ebd6c89110f535 [2018-11-23 12:05:08,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:05:08,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:08,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:08,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:08,383 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:08,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 12:05:08,419 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/data/7267afaa1/e942defe7eba4200a5147f64a09f1a88/FLAG04803586c [2018-11-23 12:05:08,821 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:08,821 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 12:05:08,826 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/data/7267afaa1/e942defe7eba4200a5147f64a09f1a88/FLAG04803586c [2018-11-23 12:05:08,838 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/data/7267afaa1/e942defe7eba4200a5147f64a09f1a88 [2018-11-23 12:05:08,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:08,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:08,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:08,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:08,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:08,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:08,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f370fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08, skipping insertion in model container [2018-11-23 12:05:08,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:08,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:08,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:08,975 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:08,977 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:08,986 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:08,994 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:08,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08 WrapperNode [2018-11-23 12:05:08,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:08,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:08,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:08,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:09,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:09,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:09,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:09,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:09,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... [2018-11-23 12:05:09,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:09,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:09,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:09,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:09,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:05:09,093 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-23 12:05:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-23 12:05:09,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:09,093 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 12:05:09,093 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 12:05:09,214 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:09,214 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:05:09,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:09 BoogieIcfgContainer [2018-11-23 12:05:09,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:09,215 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 12:05:09,215 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 12:05:09,223 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 12:05:09,223 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:09" (1/1) ... [2018-11-23 12:05:09,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:05:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 20 states and 23 transitions. [2018-11-23 12:05:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 12:05:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 12:05:09,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:05:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:05:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 24 states and 28 transitions. [2018-11-23 12:05:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:05:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:05:09,494 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:05:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:05:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 31 states and 38 transitions. [2018-11-23 12:05:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 12:05:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:05:09,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:05:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:09,992 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 3 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] CALL call main_#t~ret3 := id(main_~input~0); VAL [|id_#in~x|=(- 8589934590)] [?] ~x := #in~x; VAL [id_~x=(- 8589934590), |id_#in~x|=(- 8589934590)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 8589934590), |id_#in~x|=(- 8589934590)] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=(- 8589934591)] [?] ~x := #in~x; VAL [id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591)] [?] assume !(0 == ~x % 4294967296); VAL [id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591)] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=(- 8589934592)] [?] ~x := #in~x; VAL [id_~x=(- 8589934592), |id_#in~x|=(- 8589934592)] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=(- 8589934592), |id_#in~x|=(- 8589934592), |id_#res|=0] [?] assume true; VAL [id_~x=(- 8589934592), |id_#in~x|=(- 8589934592), |id_#res|=0] [?] RET #40#return; VAL [id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591), |id2_#t~ret1|=0] [?] ~ret~1 := 1 + #t~ret1;havoc #t~ret1;BeginParallelComposition{ParallelCodeBlock0: assume ~ret~1 % 4294967296 > 3;#res := 3;ParallelCodeBlock1: assume !(~ret~1 % 4294967296 > 3);#res := ~ret~1;}EndParallelComposition VAL [id2_~ret~1=1, id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591), |id2_#res|=1] [?] assume true; VAL [id2_~ret~1=1, id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591), |id2_#res|=1] [?] RET #44#return; VAL [id_~x=(- 8589934590), |id_#in~x|=(- 8589934590), |id_#t~ret0|=1] [?] ~ret~0 := 1 + #t~ret0;havoc #t~ret0;BeginParallelComposition{ParallelCodeBlock0: assume ~ret~0 % 4294967296 > 3;#res := 3;ParallelCodeBlock1: assume !(~ret~0 % 4294967296 > 3);#res := ~ret~0;}EndParallelComposition VAL [id_~ret~0=2, id_~x=(- 8589934590), |id_#in~x|=(- 8589934590), |id_#res|=2] [?] assume true; VAL [id_~ret~0=2, id_~x=(- 8589934590), |id_#in~x|=(- 8589934590), |id_#res|=2] [?] RET #42#return; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), |ULTIMATE.start_main_#t~ret3|=2] [?] main_~result~0 := main_#t~ret3;havoc main_#t~ret3; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), ULTIMATE.start_main_~result~0=2] [?] assume 2 == main_~result~0 % 4294967296; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), ULTIMATE.start_main_~result~0=2] [?] assume !false; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), ULTIMATE.start_main_~result~0=2] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L4] ensures true; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L5] ensures true; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L4] ensures true; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24-L26] assume 2 == main_~result~0 % 4294967296; VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L4] ensures true; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L5] ensures true; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L4] ensures true; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24-L26] assume 2 == main_~result~0 % 4294967296; VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24] COND TRUE 2 == main_~result~0 % 4294967296 VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24] COND TRUE 2 == main_~result~0 % 4294967296 VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call #t~ret3 := id(~input~0); [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; [L24] COND TRUE 2 == ~result~0 % 4294967296 [L25] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call #t~ret3 := id(~input~0); [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; [L24] COND TRUE 2 == ~result~0 % 4294967296 [L25] assert false; [L22] unsigned int input = __VERIFIER_nondet_uint(); [L23] CALL, EXPR id(input) VAL [\old(x)=2] [L8] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=1] [L15] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L16] CALL, EXPR id(x-1) VAL [\old(x)=0] [L8] COND TRUE x==0 [L8] return 0; VAL [\old(x)=0, \result=0, x=0] [L16] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L16] unsigned int ret = id(x-1) + 1; [L17] COND FALSE !(ret > 3) [L18] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L9] RET, EXPR id2(x-1) VAL [\old(x)=2, id2(x-1)=1, x=2] [L9] unsigned int ret = id2(x-1) + 1; [L10] COND FALSE !(ret > 3) [L11] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L23] RET, EXPR id(input) [L23] unsigned int result = id(input); [L24] COND TRUE result == 2 [L25] __VERIFIER_error() ----- [2018-11-23 12:05:10,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:05:10 ImpRootNode [2018-11-23 12:05:10,041 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 12:05:10,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:05:10,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:05:10,042 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:05:10,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:09" (3/4) ... [2018-11-23 12:05:10,044 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] CALL call main_#t~ret3 := id(main_~input~0); VAL [|id_#in~x|=(- 8589934590)] [?] ~x := #in~x; VAL [id_~x=(- 8589934590), |id_#in~x|=(- 8589934590)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 8589934590), |id_#in~x|=(- 8589934590)] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=(- 8589934591)] [?] ~x := #in~x; VAL [id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591)] [?] assume !(0 == ~x % 4294967296); VAL [id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591)] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=(- 8589934592)] [?] ~x := #in~x; VAL [id_~x=(- 8589934592), |id_#in~x|=(- 8589934592)] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=(- 8589934592), |id_#in~x|=(- 8589934592), |id_#res|=0] [?] assume true; VAL [id_~x=(- 8589934592), |id_#in~x|=(- 8589934592), |id_#res|=0] [?] RET #40#return; VAL [id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591), |id2_#t~ret1|=0] [?] ~ret~1 := 1 + #t~ret1;havoc #t~ret1;BeginParallelComposition{ParallelCodeBlock0: assume ~ret~1 % 4294967296 > 3;#res := 3;ParallelCodeBlock1: assume !(~ret~1 % 4294967296 > 3);#res := ~ret~1;}EndParallelComposition VAL [id2_~ret~1=1, id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591), |id2_#res|=1] [?] assume true; VAL [id2_~ret~1=1, id2_~x=(- 8589934591), |id2_#in~x|=(- 8589934591), |id2_#res|=1] [?] RET #44#return; VAL [id_~x=(- 8589934590), |id_#in~x|=(- 8589934590), |id_#t~ret0|=1] [?] ~ret~0 := 1 + #t~ret0;havoc #t~ret0;BeginParallelComposition{ParallelCodeBlock0: assume ~ret~0 % 4294967296 > 3;#res := 3;ParallelCodeBlock1: assume !(~ret~0 % 4294967296 > 3);#res := ~ret~0;}EndParallelComposition VAL [id_~ret~0=2, id_~x=(- 8589934590), |id_#in~x|=(- 8589934590), |id_#res|=2] [?] assume true; VAL [id_~ret~0=2, id_~x=(- 8589934590), |id_#in~x|=(- 8589934590), |id_#res|=2] [?] RET #42#return; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), |ULTIMATE.start_main_#t~ret3|=2] [?] main_~result~0 := main_#t~ret3;havoc main_#t~ret3; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), ULTIMATE.start_main_~result~0=2] [?] assume 2 == main_~result~0 % 4294967296; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), ULTIMATE.start_main_~result~0=2] [?] assume !false; VAL [ULTIMATE.start_main_~input~0=(- 8589934590), ULTIMATE.start_main_~result~0=2] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L4] ensures true; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L5] ensures true; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L4] ensures true; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24-L26] assume 2 == main_~result~0 % 4294967296; VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L4] ensures true; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L5] ensures true; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L4] ensures true; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24-L26] assume 2 == main_~result~0 % 4294967296; VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24] COND TRUE 2 == main_~result~0 % 4294967296 VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~result~0; [L22] main_~input~0 := main_#t~nondet2; [L22] havoc main_#t~nondet2; [L23] CALL call main_#t~ret3 := id(main_~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call main_#t~ret3 := id(main_~input~0); VAL [main_#t~ret3=2, main_~input~0=-8589934590] [L23] main_~result~0 := main_#t~ret3; [L23] havoc main_#t~ret3; VAL [main_~input~0=-8589934590, main_~result~0=2] [L24] COND TRUE 2 == main_~result~0 % 4294967296 VAL [main_~input~0=-8589934590, main_~result~0=2] [L25] assert false; VAL [main_~input~0=-8589934590, main_~result~0=2] [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call #t~ret3 := id(~input~0); [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; [L24] COND TRUE 2 == ~result~0 % 4294967296 [L25] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=-8589934590] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934590, ~x=-8589934590] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934590, ~x=-8589934590] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934591] [L14-L19] ~x := #in~x; VAL [#in~x=-8589934591, ~x=-8589934591] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-8589934591, ~x=-8589934591] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934592] [L7-L12] ~x := #in~x; VAL [#in~x=-8589934592, ~x=-8589934592] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=-8589934592, #res=0, ~x=-8589934592] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=-8589934591, #t~ret1=0, ~x=-8589934591] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=-8589934591, #res=1, ~ret~1=1, ~x=-8589934591] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=-8589934590, #t~ret0=1, ~x=-8589934590] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=-8589934590, #res=2, ~ret~0=2, ~x=-8589934590] [L23] RET call #t~ret3 := id(~input~0); [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; [L24] COND TRUE 2 == ~result~0 % 4294967296 [L25] assert false; [L22] unsigned int input = __VERIFIER_nondet_uint(); [L23] CALL, EXPR id(input) VAL [\old(x)=2] [L8] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=1] [L15] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L16] CALL, EXPR id(x-1) VAL [\old(x)=0] [L8] COND TRUE x==0 [L8] return 0; VAL [\old(x)=0, \result=0, x=0] [L16] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L16] unsigned int ret = id(x-1) + 1; [L17] COND FALSE !(ret > 3) [L18] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L9] RET, EXPR id2(x-1) VAL [\old(x)=2, id2(x-1)=1, x=2] [L9] unsigned int ret = id2(x-1) + 1; [L10] COND FALSE !(ret > 3) [L11] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L23] RET, EXPR id(input) [L23] unsigned int result = id(input); [L24] COND TRUE result == 2 [L25] __VERIFIER_error() ----- [2018-11-23 12:05:10,095 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3aa688d6-f0fb-4900-a55e-9f77da869b1f/bin-2019/ukojak/witness.graphml [2018-11-23 12:05:10,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:05:10,095 INFO L168 Benchmark]: Toolchain (without parser) took 1254.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -49.3 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:10,096 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:05:10,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:10,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.08 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:10,098 INFO L168 Benchmark]: Boogie Preprocessor took 10.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:05:10,098 INFO L168 Benchmark]: RCFGBuilder took 191.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:10,099 INFO L168 Benchmark]: CodeCheck took 826.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:10,099 INFO L168 Benchmark]: Witness Printer took 53.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:10,103 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 3 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 3 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 50 SDtfs, 12 SDslu, 16 SDs, 0 SdLazy, 68 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 25]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] unsigned int input = __VERIFIER_nondet_uint(); [L23] CALL, EXPR id(input) VAL [\old(x)=2] [L8] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=1] [L15] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L16] CALL, EXPR id(x-1) VAL [\old(x)=0] [L8] COND TRUE x==0 [L8] return 0; VAL [\old(x)=0, \result=0, x=0] [L16] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L16] unsigned int ret = id(x-1) + 1; [L17] COND FALSE !(ret > 3) [L18] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L9] RET, EXPR id2(x-1) VAL [\old(x)=2, id2(x-1)=1, x=2] [L9] unsigned int ret = id2(x-1) + 1; [L10] COND FALSE !(ret > 3) [L11] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L23] RET, EXPR id(input) [L23] unsigned int result = id(input); [L24] COND TRUE result == 2 [L25] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.08 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 191.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * CodeCheck took 826.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * Witness Printer took 53.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...