./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_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan --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 Taipan --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 06:11:26,472 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:11:26,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:11:26,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:11:26,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:11:26,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:11:26,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:11:26,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:11:26,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:11:26,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:11:26,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:11:26,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:11:26,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:11:26,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:11:26,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:11:26,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:11:26,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:11:26,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:11:26,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:11:26,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:11:26,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:11:26,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:11:26,494 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:11:26,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:11:26,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:11:26,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:11:26,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:11:26,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:11:26,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:11:26,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:11:26,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:11:26,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:11:26,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:11:26,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:11:26,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:11:26,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:11:26,499 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:11:26,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:11:26,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:11:26,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:11:26,508 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:11:26,508 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:11:26,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:11:26,509 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:11:26,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:11:26,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:11:26,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:11:26,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:11:26,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:11:26,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:11:26,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:11:26,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:11:26,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:11:26,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:11:26,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:11:26,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:11:26,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:11:26,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:11:26,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:11:26,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:11:26,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:11:26,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:11:26,513 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan 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 -> Taipan 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 06:11:26,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:11:26,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:11:26,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:11:26,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:11:26,550 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:11:26,551 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c [2018-11-23 06:11:26,591 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/data/efa0394eb/d86ebf8fa8b54148a6111d4a72ef6d20/FLAG5cb923592 [2018-11-23 06:11:26,991 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:11:26,992 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/sv-benchmarks/c/recursive-simple/id2_i5_o5_false-unreach-call_true-termination.c [2018-11-23 06:11:26,995 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/data/efa0394eb/d86ebf8fa8b54148a6111d4a72ef6d20/FLAG5cb923592 [2018-11-23 06:11:27,007 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/data/efa0394eb/d86ebf8fa8b54148a6111d4a72ef6d20 [2018-11-23 06:11:27,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:11:27,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:11:27,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:11:27,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:11:27,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:11:27,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d53af0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27, skipping insertion in model container [2018-11-23 06:11:27,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:11:27,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:11:27,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:11:27,162 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:11:27,170 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:11:27,179 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:11:27,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27 WrapperNode [2018-11-23 06:11:27,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:11:27,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:11:27,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:11:27,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:11:27,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:11:27,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:11:27,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:11:27,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:11:27,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... [2018-11-23 06:11:27,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:11:27,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:11:27,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:11:27,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:11:27,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/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 06:11:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:11:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:11:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-23 06:11:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-23 06:11:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:11:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:11:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:11:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:11:27,285 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 06:11:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 06:11:27,382 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:11:27,382 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:11:27,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:11:27 BoogieIcfgContainer [2018-11-23 06:11:27,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:11:27,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:11:27,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:11:27,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:11:27,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:11:27" (1/3) ... [2018-11-23 06:11:27,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@947da40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:11:27, skipping insertion in model container [2018-11-23 06:11:27,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:11:27" (2/3) ... [2018-11-23 06:11:27,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@947da40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:11:27, skipping insertion in model container [2018-11-23 06:11:27,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:11:27" (3/3) ... [2018-11-23 06:11:27,387 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5_false-unreach-call_true-termination.c [2018-11-23 06:11:27,393 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:11:27,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:11:27,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:11:27,425 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:11:27,425 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:11:27,426 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:11:27,426 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:11:27,426 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:11:27,426 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:11:27,426 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:11:27,426 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:11:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 06:11:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 06:11:27,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:11:27,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:11:27,443 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:11:27,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -550894517, now seen corresponding path program 1 times [2018-11-23 06:11:27,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:11:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:27,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:11:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:27,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:11:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:11:27,555 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 06:11:27,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:11:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:11:27,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:11:27,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:11:27,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:11:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:11:27,573 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2018-11-23 06:11:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:11:27,649 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 06:11:27,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:11:27,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 06:11:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:11:27,656 INFO L225 Difference]: With dead ends: 36 [2018-11-23 06:11:27,656 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 06:11:27,659 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 06:11:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 06:11:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 06:11:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 06:11:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 06:11:27,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-11-23 06:11:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:11:27,688 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 06:11:27,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:11:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 06:11:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 06:11:27,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:11:27,690 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 06:11:27,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:11:27,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 40504409, now seen corresponding path program 1 times [2018-11-23 06:11:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:11:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:27,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:11:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:27,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:11:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:11:27,739 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 06:11:27,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:11:27,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:11:27,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:11:27,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:11:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:11:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:11:27,742 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2018-11-23 06:11:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:11:27,834 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 06:11:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:11:27,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 06:11:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:11:27,835 INFO L225 Difference]: With dead ends: 33 [2018-11-23 06:11:27,835 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 06:11:27,836 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 06:11:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 06:11:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 06:11:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 06:11:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 06:11:27,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-11-23 06:11:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:11:27,840 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 06:11:27,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:11:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 06:11:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 06:11:27,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:11:27,841 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 06:11:27,842 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:11:27,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1029702107, now seen corresponding path program 1 times [2018-11-23 06:11:27,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:11:27,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:27,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:11:27,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:27,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:11:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:11:27,900 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 06:11:27,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:11:27,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:11:27,902 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-23 06:11:27,903 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [8], [12], [14], [17], [19], [25], [28], [29], [31], [32], [33], [34], [35], [36], [37], [39], [40], [41], [42] [2018-11-23 06:11:27,930 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:11:27,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:11:28,051 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:11:28,052 INFO L272 AbstractInterpreter]: Visited 22 different actions 66 times. Never merged. Widened at 2 different actions 4 times. Performed 141 root evaluator evaluations with a maximum evaluation depth of 3. Performed 141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-23 06:11:28,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:28,063 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:11:28,100 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 58.89% of their original sizes. [2018-11-23 06:11:28,100 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:11:28,216 INFO L415 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-11-23 06:11:28,216 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:11:28,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:11:28,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-11-23 06:11:28,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:11:28,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 06:11:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 06:11:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-23 06:11:28,217 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-11-23 06:11:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:11:28,535 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 06:11:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:11:28,535 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 06:11:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:11:28,536 INFO L225 Difference]: With dead ends: 63 [2018-11-23 06:11:28,536 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 06:11:28,537 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-11-23 06:11:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 06:11:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-11-23 06:11:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 06:11:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 06:11:28,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 25 [2018-11-23 06:11:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:11:28,542 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 06:11:28,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 06:11:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 06:11:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 06:11:28,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:11:28,543 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 06:11:28,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:11:28,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -559715991, now seen corresponding path program 1 times [2018-11-23 06:11:28,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:11:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:11:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:28,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:11:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:11:28,621 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 06:11:28,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:11:28,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:11:28,622 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-23 06:11:28,622 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [8], [12], [14], [17], [19], [25], [29], [31], [32], [33], [34], [35], [36], [37], [39], [40], [41], [42] [2018-11-23 06:11:28,623 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:11:28,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:11:28,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:11:28,666 INFO L272 AbstractInterpreter]: Visited 23 different actions 82 times. Merged at 8 different actions 19 times. Widened at 2 different actions 4 times. Performed 231 root evaluator evaluations with a maximum evaluation depth of 3. Performed 231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-23 06:11:28,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:28,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:11:28,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:11:28,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/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 06:11:28,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:11:28,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:11:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:11:28,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:11:28,798 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 06:11:28,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:11:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 06:11:29,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:11:29,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 23 [2018-11-23 06:11:29,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:11:29,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 06:11:29,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 06:11:29,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-11-23 06:11:29,174 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 18 states. [2018-11-23 06:11:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:11:29,282 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 06:11:29,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:11:29,283 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-11-23 06:11:29,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:11:29,284 INFO L225 Difference]: With dead ends: 67 [2018-11-23 06:11:29,284 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 06:11:29,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2018-11-23 06:11:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 06:11:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-23 06:11:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 06:11:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 06:11:29,291 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 31 [2018-11-23 06:11:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:11:29,291 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 06:11:29,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 06:11:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 06:11:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:11:29,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:11:29,292 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 06:11:29,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:11:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2003326827, now seen corresponding path program 2 times [2018-11-23 06:11:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:11:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:29,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:11:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:29,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:11:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:11:29,350 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 06:11:29,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:11:29,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:11:29,351 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:11:29,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:11:29,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:11:29,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/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 06:11:29,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:11:29,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:11:29,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:11:29,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:11:29,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:11:29,473 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 06:11:29,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:11:29,841 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 06:11:29,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 06:11:29,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 21 [2018-11-23 06:11:29,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:11:29,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 06:11:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 06:11:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:11:29,856 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 21 states. [2018-11-23 06:11:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:11:30,015 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-23 06:11:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 06:11:30,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-11-23 06:11:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:11:30,016 INFO L225 Difference]: With dead ends: 72 [2018-11-23 06:11:30,016 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 06:11:30,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-11-23 06:11:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 06:11:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-11-23 06:11:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 06:11:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-23 06:11:30,022 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2018-11-23 06:11:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:11:30,023 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-23 06:11:30,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 06:11:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 06:11:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 06:11:30,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:11:30,026 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 06:11:30,026 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:11:30,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:11:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1197899385, now seen corresponding path program 2 times [2018-11-23 06:11:30,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:11:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:30,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:11:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:11:30,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:11:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:11:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:11:30,057 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 06:11:30,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:11:30 BoogieIcfgContainer [2018-11-23 06:11:30,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:11:30,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:11:30,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:11:30,087 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:11:30,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:11:27" (3/4) ... [2018-11-23 06:11:30,089 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 06:11:30,135 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_74ae1ce3-1aaf-4341-a448-454a40e670ea/bin-2019/utaipan/witness.graphml [2018-11-23 06:11:30,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:11:30,136 INFO L168 Benchmark]: Toolchain (without parser) took 3125.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 961.9 MB in the beginning and 869.0 MB in the end (delta: 93.0 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:11:30,137 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:11:30,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.46 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:11:30,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:11:30,138 INFO L168 Benchmark]: Boogie Preprocessor took 11.33 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:11:30,138 INFO L168 Benchmark]: RCFGBuilder took 179.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:11:30,138 INFO L168 Benchmark]: TraceAbstraction took 2703.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.1 MB in the end (delta: 249.6 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:11:30,139 INFO L168 Benchmark]: Witness Printer took 48.51 ms. Allocated memory is still 1.2 GB. Free memory was 874.1 MB in the beginning and 869.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:11:30,141 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.46 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 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 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.33 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2703.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.1 MB in the end (delta: 249.6 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. * Witness Printer took 48.51 ms. Allocated memory is still 1.2 GB. Free memory was 874.1 MB in the beginning and 869.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 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, 2.6s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 72 SDslu, 822 SDs, 0 SdLazy, 361 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 216 GetRequests, 113 SyntacticMatches, 19 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.6805555555555557 AbsIntWeakeningRatio, 0.5833333333333334 AbsIntAvgWeakeningVarsNumRemoved, 0.9583333333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 16656 SizeOfPredicates, 6 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 44/94 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...