./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59c5766d3cddc0d41e2678bb5221cccc60217431 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:39,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:35:39,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:35:39,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:35:39,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:35:39,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:35:39,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:35:39,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:35:39,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:35:39,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:35:39,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:35:39,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:35:39,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:35:39,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:35:39,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:35:39,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:35:39,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:35:39,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:35:39,637 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:35:39,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:35:39,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:35:39,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:35:39,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:35:39,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:35:39,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:35:39,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:35:39,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:35:39,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:35:39,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:35:39,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:35:39,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:35:39,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:35:39,645 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:35:39,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:35:39,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:35:39,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:35:39,646 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:35:39,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:35:39,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:35:39,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:35:39,656 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:35:39,657 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:35:39,657 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:35:39,657 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:35:39,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:35:39,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:35:39,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:35:39,659 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:35:39,659 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:35:39,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:35:39,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:35:39,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:35:39,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:35:39,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:35:39,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:35:39,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:35:39,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:35:39,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:35:39,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:35:39,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:35:39,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:35:39,661 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_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59c5766d3cddc0d41e2678bb5221cccc60217431 [2018-11-23 12:35:39,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:35:39,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:35:39,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:35:39,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:35:39,697 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:35:39,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c [2018-11-23 12:35:39,743 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/data/b9702cb6b/2af8714abcac441eb9248bd640b0e973/FLAGe5ef77103 [2018-11-23 12:35:40,139 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:35:40,139 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c [2018-11-23 12:35:40,143 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/data/b9702cb6b/2af8714abcac441eb9248bd640b0e973/FLAGe5ef77103 [2018-11-23 12:35:40,151 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/data/b9702cb6b/2af8714abcac441eb9248bd640b0e973 [2018-11-23 12:35:40,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:35:40,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:35:40,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:35:40,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:35:40,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:35:40,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60090200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40, skipping insertion in model container [2018-11-23 12:35:40,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:35:40,175 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:35:40,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:35:40,285 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:35:40,294 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:35:40,302 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:35:40,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40 WrapperNode [2018-11-23 12:35:40,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:35:40,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:35:40,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:35:40,304 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:35:40,311 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:35:40" (1/1) ... [2018-11-23 12:35:40,315 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:35:40" (1/1) ... [2018-11-23 12:35:40,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:35:40,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:35:40,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:35:40,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:35:40,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... [2018-11-23 12:35:40,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:35:40,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:35:40,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:35:40,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:35:40,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:35:40,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:35:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:35:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-23 12:35:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-23 12:35:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:35:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:35:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:35:40,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:35:40,429 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 12:35:40,430 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 12:35:40,557 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:35:40,557 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:35:40,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:40 BoogieIcfgContainer [2018-11-23 12:35:40,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:35:40,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:35:40,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:35:40,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:35:40,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:35:40" (1/3) ... [2018-11-23 12:35:40,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d050dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:35:40, skipping insertion in model container [2018-11-23 12:35:40,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:35:40" (2/3) ... [2018-11-23 12:35:40,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d050dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:35:40, skipping insertion in model container [2018-11-23 12:35:40,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:40" (3/3) ... [2018-11-23 12:35:40,564 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5_false-unreach-call_true-termination.c [2018-11-23 12:35:40,571 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:35:40,576 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:35:40,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:35:40,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:35:40,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:35:40,614 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:35:40,614 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:35:40,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:35:40,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:35:40,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:35:40,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:35:40,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:35:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 12:35:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:35:40,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:40,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:40,637 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:40,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:40,642 INFO L82 PathProgramCache]: Analyzing trace with hash -550894517, now seen corresponding path program 1 times [2018-11-23 12:35:40,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:40,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:40,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:40,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:40,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:40,780 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:35:40,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:40,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:35:40,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:35:40,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:35:40,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:35:40,794 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-11-23 12:35:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:40,845 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:35:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:35:40,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:35:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:40,852 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:35:40,852 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:35:40,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:35:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:35:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:35:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:35:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 12:35:40,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-11-23 12:35:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:40,885 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 12:35:40,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:35:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:35:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:35:40,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:40,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:40,886 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:40,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 40504409, now seen corresponding path program 1 times [2018-11-23 12:35:40,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:40,950 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:35:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:35:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:35:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:35:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:35:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:35:40,953 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2018-11-23 12:35:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:41,036 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:35:41,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:35:41,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:35:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:41,038 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:35:41,038 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:35:41,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:35:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:35:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:35:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:35:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:35:41,047 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-11-23 12:35:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:41,047 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:35:41,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:35:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:35:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:35:41,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:41,048 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:41,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:41,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1029702107, now seen corresponding path program 1 times [2018-11-23 12:35:41,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:41,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:35:41,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:35:41,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:35:41,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:41,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:35:41,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:35:41,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 12:35:41,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:35:41,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:35:41,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:35:41,193 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-23 12:35:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:41,259 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 12:35:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:35:41,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:35:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:41,261 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:35:41,261 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:35:41,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:35:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:35:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-23 12:35:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:35:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 12:35:41,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-11-23 12:35:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:41,265 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 12:35:41,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:35:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:35:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:35:41,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:41,265 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:41,266 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:41,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -559715991, now seen corresponding path program 1 times [2018-11-23 12:35:41,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:41,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:35:41,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:35:41,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:35:41,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:41,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:35:41,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:35:41,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-23 12:35:41,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:35:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:35:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:35:41,559 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 18 states. [2018-11-23 12:35:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:41,728 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 12:35:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:35:41,728 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-11-23 12:35:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:41,729 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:35:41,729 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:35:41,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:35:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:35:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-11-23 12:35:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:35:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:35:41,735 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2018-11-23 12:35:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:41,735 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:35:41,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:35:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:35:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:35:41,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:41,736 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:41,736 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:41,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2003326827, now seen corresponding path program 2 times [2018-11-23 12:35:41,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:41,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:35:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:35:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:35:41,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:35:41,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:35:41,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:35:41,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:35:41,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:35:41,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:35:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:35:41,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:35:41,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 12:35:41,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:35:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:35:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:35:41,863 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2018-11-23 12:35:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:35:41,932 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 12:35:41,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:35:41,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-11-23 12:35:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:35:41,933 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:35:41,934 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:35:41,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:35:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:35:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-11-23 12:35:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:35:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 12:35:41,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2018-11-23 12:35:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:35:41,938 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 12:35:41,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:35:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:35:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:35:41,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:35:41,939 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:35:41,939 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:35:41,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:35:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1197899385, now seen corresponding path program 2 times [2018-11-23 12:35:41,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:35:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:35:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:35:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:35:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:35:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:35:41,974 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #36#return; [?] CALL call #t~ret3 := main(); [?] ~input~0 := 5; VAL [main_~input~0=5] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=5] [?] ~x := #in~x; VAL [id_~x=5, |id_#in~x|=5] [?] assume !(0 == ~x); VAL [id_~x=5, |id_#in~x|=5] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=4] [?] ~x := #in~x; VAL [id2_~x=4, |id2_#in~x|=4] [?] assume !(0 == ~x); VAL [id2_~x=4, |id2_#in~x|=4] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=3] [?] ~x := #in~x; VAL [id_~x=3, |id_#in~x|=3] [?] assume !(0 == ~x); VAL [id_~x=3, |id_#in~x|=3] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=2] [?] ~x := #in~x; VAL [id2_~x=2, |id2_#in~x|=2] [?] assume !(0 == ~x); VAL [id2_~x=2, |id2_#in~x|=2] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=0] [?] ~x := #in~x; VAL [id2_~x=0, |id2_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id2_~x=0, |id2_#in~x|=0, |id2_#res|=0] [?] assume true; VAL [id2_~x=0, |id2_#in~x|=0, |id2_#res|=0] [?] RET #42#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #34#return; VAL [id2_~x=2, |id2_#in~x|=2, |id2_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; VAL [id2_~x=2, |id2_#in~x|=2, |id2_#res|=2] [?] assume true; VAL [id2_~x=2, |id2_#in~x|=2, |id2_#res|=2] [?] RET #42#return; VAL [id_~x=3, |id_#in~x|=3, |id_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] assume true; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] RET #34#return; VAL [id2_~x=4, |id2_#in~x|=4, |id2_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; VAL [id2_~x=4, |id2_#in~x|=4, |id2_#res|=4] [?] assume true; VAL [id2_~x=4, |id2_#in~x|=4, |id2_#res|=4] [?] RET #42#return; VAL [id_~x=5, |id_#in~x|=5, |id_#t~ret0|=4] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] assume true; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] RET #40#return; VAL [main_~input~0=5, |main_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=5, main_~result~0=5] [?] assume 5 == ~result~0; VAL [main_~input~0=5, main_~result~0=5] [?] assume !false; VAL [main_~input~0=5, main_~result~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] assume 0 == ~x; [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L5] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L5] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L5] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20-L22] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] assume 0 == ~x; [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L5] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L5] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L5] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20-L22] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] [L18] int input = 5; VAL [input=5] [L19] CALL, EXPR id(input) VAL [\old(x)=5] [L8] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L13] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L14] CALL, EXPR id(x-1) VAL [\old(x)=3] [L8] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L13] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L14] CALL, EXPR id(x-1) VAL [\old(x)=1] [L8] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L13] COND TRUE x==0 [L13] return 0; VAL [\old(x)=0, \result=0, x=0] [L9] RET, EXPR id2(x-1) VAL [\old(x)=1, id2(x-1)=0, x=1] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=3, id2(x-1)=2, x=3] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=5, id2(x-1)=4, x=5] [L9] return id2(x-1) + 1; [L19] RET, EXPR id(input) VAL [id(input)=5, input=5] [L19] int result = id(input); [L20] COND TRUE result == 5 VAL [input=5, result=5] [L21] __VERIFIER_error() VAL [input=5, result=5] ----- [2018-11-23 12:35:42,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:35:42 BoogieIcfgContainer [2018-11-23 12:35:42,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:35:42,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:35:42,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:35:42,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:35:42,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:35:40" (3/4) ... [2018-11-23 12:35:42,009 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #36#return; [?] CALL call #t~ret3 := main(); [?] ~input~0 := 5; VAL [main_~input~0=5] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=5] [?] ~x := #in~x; VAL [id_~x=5, |id_#in~x|=5] [?] assume !(0 == ~x); VAL [id_~x=5, |id_#in~x|=5] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=4] [?] ~x := #in~x; VAL [id2_~x=4, |id2_#in~x|=4] [?] assume !(0 == ~x); VAL [id2_~x=4, |id2_#in~x|=4] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=3] [?] ~x := #in~x; VAL [id_~x=3, |id_#in~x|=3] [?] assume !(0 == ~x); VAL [id_~x=3, |id_#in~x|=3] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=2] [?] ~x := #in~x; VAL [id2_~x=2, |id2_#in~x|=2] [?] assume !(0 == ~x); VAL [id2_~x=2, |id2_#in~x|=2] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=0] [?] ~x := #in~x; VAL [id2_~x=0, |id2_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id2_~x=0, |id2_#in~x|=0, |id2_#res|=0] [?] assume true; VAL [id2_~x=0, |id2_#in~x|=0, |id2_#res|=0] [?] RET #42#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #34#return; VAL [id2_~x=2, |id2_#in~x|=2, |id2_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; VAL [id2_~x=2, |id2_#in~x|=2, |id2_#res|=2] [?] assume true; VAL [id2_~x=2, |id2_#in~x|=2, |id2_#res|=2] [?] RET #42#return; VAL [id_~x=3, |id_#in~x|=3, |id_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] assume true; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] RET #34#return; VAL [id2_~x=4, |id2_#in~x|=4, |id2_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := 1 + #t~ret1;havoc #t~ret1; VAL [id2_~x=4, |id2_#in~x|=4, |id2_#res|=4] [?] assume true; VAL [id2_~x=4, |id2_#in~x|=4, |id2_#res|=4] [?] RET #42#return; VAL [id_~x=5, |id_#in~x|=5, |id_#t~ret0|=4] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] assume true; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] RET #40#return; VAL [main_~input~0=5, |main_#t~ret2|=5] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=5, main_~result~0=5] [?] assume 5 == ~result~0; VAL [main_~input~0=5, main_~result~0=5] [?] assume !false; VAL [main_~input~0=5, main_~result~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] assume 0 == ~x; [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L5] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L5] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L5] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20-L22] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] assume 0 == ~x; [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L5] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L5] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L5] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20-L22] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] ~input~0 := 5; VAL [~input~0=5] [L19] CALL call #t~ret2 := id(~input~0); VAL [#in~x=5] [L7-L10] ~x := #in~x; VAL [#in~x=5, ~x=5] [L8] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4] [L12-L15] ~x := #in~x; VAL [#in~x=4, ~x=4] [L13] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=3] [L7-L10] ~x := #in~x; VAL [#in~x=3, ~x=3] [L8] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=2] [L12-L15] ~x := #in~x; VAL [#in~x=2, ~x=2] [L13] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L14] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=1] [L7-L10] ~x := #in~x; VAL [#in~x=1, ~x=1] [L8] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=0] [L12-L15] ~x := #in~x; VAL [#in~x=0, ~x=0] [L13] COND TRUE 0 == ~x [L13] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=2, #t~ret1=1, ~x=2] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=2, #res=2, ~x=2] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L14] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4, #t~ret1=3, ~x=4] [L14] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L14] #res := 1 + #t~ret1; [L14] havoc #t~ret1; VAL [#in~x=4, #res=4, ~x=4] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L9] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L9] #res := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L19] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=5, ~input~0=5] [L19] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L19] ~result~0 := #t~ret2; [L19] havoc #t~ret2; VAL [~input~0=5, ~result~0=5] [L20] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L21] assert false; VAL [~input~0=5, ~result~0=5] [L18] int input = 5; VAL [input=5] [L19] CALL, EXPR id(input) VAL [\old(x)=5] [L8] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L13] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L14] CALL, EXPR id(x-1) VAL [\old(x)=3] [L8] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L13] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L14] CALL, EXPR id(x-1) VAL [\old(x)=1] [L8] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L13] COND TRUE x==0 [L13] return 0; VAL [\old(x)=0, \result=0, x=0] [L9] RET, EXPR id2(x-1) VAL [\old(x)=1, id2(x-1)=0, x=1] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=3, id2(x-1)=2, x=3] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=5, id2(x-1)=4, x=5] [L9] return id2(x-1) + 1; [L19] RET, EXPR id(input) VAL [id(input)=5, input=5] [L19] int result = id(input); [L20] COND TRUE result == 5 VAL [input=5, result=5] [L21] __VERIFIER_error() VAL [input=5, result=5] ----- [2018-11-23 12:35:42,054 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_81e9da9b-a456-4b32-9ba8-ea019a246e06/bin-2019/uautomizer/witness.graphml [2018-11-23 12:35:42,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:35:42,055 INFO L168 Benchmark]: Toolchain (without parser) took 1901.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 959.1 MB in the beginning and 928.2 MB in the end (delta: 30.9 MB). Peak memory consumption was 179.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:35:42,057 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:35:42,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:35:42,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.43 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:35:42,057 INFO L168 Benchmark]: Boogie Preprocessor took 15.40 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:35:42,058 INFO L168 Benchmark]: RCFGBuilder took 221.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:35:42,058 INFO L168 Benchmark]: TraceAbstraction took 1446.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.6 MB in the end (delta: 199.6 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:35:42,058 INFO L168 Benchmark]: Witness Printer took 48.53 ms. Allocated memory is still 1.2 GB. Free memory was 931.6 MB in the beginning and 928.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:35:42,060 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.45 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.43 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.40 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1446.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.6 MB in the end (delta: 199.6 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. * Witness Printer took 48.53 ms. Allocated memory is still 1.2 GB. Free memory was 931.6 MB in the beginning and 928.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int input = 5; VAL [input=5] [L19] CALL, EXPR id(input) VAL [\old(x)=5] [L8] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L13] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L14] CALL, EXPR id(x-1) VAL [\old(x)=3] [L8] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L13] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L14] CALL, EXPR id(x-1) VAL [\old(x)=1] [L8] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L13] COND TRUE x==0 [L13] return 0; VAL [\old(x)=0, \result=0, x=0] [L9] RET, EXPR id2(x-1) VAL [\old(x)=1, id2(x-1)=0, x=1] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=3, id2(x-1)=2, x=3] [L9] return id2(x-1) + 1; [L14] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L14] return id(x-1) + 1; [L9] RET, EXPR id2(x-1) VAL [\old(x)=5, id2(x-1)=4, x=5] [L9] return id2(x-1) + 1; [L19] RET, EXPR id(input) VAL [id(input)=5, input=5] [L19] int result = id(input); [L20] COND TRUE result == 5 VAL [input=5, result=5] [L21] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 68 SDslu, 506 SDs, 0 SdLazy, 311 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 13152 SizeOfPredicates, 15 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 34/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...