./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i10_o10_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_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i10_o10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/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 0aae719d835771c4602eac7b24cfefa200f147c0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:12:45,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:12:45,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:12:45,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:12:45,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:12:45,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:12:45,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:12:45,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:12:45,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:12:45,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:12:45,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:12:45,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:12:45,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:12:45,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:12:45,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:12:45,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:12:45,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:12:45,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:12:45,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:12:45,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:12:45,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:12:45,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:12:45,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:12:45,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:12:45,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:12:45,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:12:45,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:12:45,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:12:45,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:12:45,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:12:45,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:12:45,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:12:45,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:12:45,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:12:45,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:12:45,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:12:45,636 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:12:45,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:12:45,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:12:45,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:12:45,647 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:12:45,648 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:12:45,648 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:12:45,648 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:12:45,648 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:12:45,648 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:12:45,648 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:12:45,648 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:12:45,649 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:12:45,649 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:12:45,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:12:45,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:12:45,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:12:45,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:12:45,651 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:12:45,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:12:45,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:12:45,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:12:45,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:12:45,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:12:45,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:12:45,653 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:12:45,653 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_c6854e07-5eff-4376-8b35-9d7a46bdaa15/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 -> 0aae719d835771c4602eac7b24cfefa200f147c0 [2018-11-23 12:12:45,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:12:45,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:12:45,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:12:45,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:12:45,686 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:12:45,687 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_i10_o10_false-unreach-call_true-termination.c [2018-11-23 12:12:45,722 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/data/88b8c6ebf/139c9040e70444989ad9cfd1cb5a9571/FLAG0cbabb31f [2018-11-23 12:12:46,104 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:12:46,105 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/sv-benchmarks/c/recursive-simple/id_i10_o10_false-unreach-call_true-termination.c [2018-11-23 12:12:46,108 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/data/88b8c6ebf/139c9040e70444989ad9cfd1cb5a9571/FLAG0cbabb31f [2018-11-23 12:12:46,116 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/data/88b8c6ebf/139c9040e70444989ad9cfd1cb5a9571 [2018-11-23 12:12:46,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:12:46,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:12:46,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:12:46,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:12:46,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:12:46,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c486bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46, skipping insertion in model container [2018-11-23 12:12:46,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:12:46,143 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:12:46,241 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:12:46,243 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:12:46,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:12:46,259 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:12:46,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46 WrapperNode [2018-11-23 12:12:46,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:12:46,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:12:46,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:12:46,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:12:46,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:12:46,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:12:46,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:12:46,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:12:46,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... [2018-11-23 12:12:46,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:12:46,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:12:46,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:12:46,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:12:46,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/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 12:12:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:12:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:12:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:12:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:12:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:12:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:12:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 12:12:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 12:12:46,463 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:12:46,463 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:12:46,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:12:46 BoogieIcfgContainer [2018-11-23 12:12:46,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:12:46,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:12:46,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:12:46,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:12:46,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:12:46" (1/3) ... [2018-11-23 12:12:46,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4cbf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:12:46, skipping insertion in model container [2018-11-23 12:12:46,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:12:46" (2/3) ... [2018-11-23 12:12:46,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4cbf6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:12:46, skipping insertion in model container [2018-11-23 12:12:46,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:12:46" (3/3) ... [2018-11-23 12:12:46,470 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10_false-unreach-call_true-termination.c [2018-11-23 12:12:46,478 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:12:46,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:12:46,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:12:46,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:12:46,522 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:12:46,522 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:12:46,522 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:12:46,522 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:12:46,522 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:12:46,522 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:12:46,523 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:12:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 12:12:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:12:46,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:46,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:46,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:46,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 12:12:46,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:46,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:46,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:46,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:46,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:12:46,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:12:46,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:12:46,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:12:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:12:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:12:46,686 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 12:12:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:46,759 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:12:46,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:12:46,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:12:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:46,766 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:12:46,766 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:12:46,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:12:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:12:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:12:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:12:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:12:46,797 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:12:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:46,797 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:12:46,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:12:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:12:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:12:46,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:46,799 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:46,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:46,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 12:12:46,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:46,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:12:46,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:46,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:46,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-23 12:12:46,848 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-11-23 12:12:46,869 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:12:46,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:12:46,975 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 12:12:46,976 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Never merged. Widened at 1 different actions 2 times. Performed 105 root evaluator evaluations with a maximum evaluation depth of 3. Performed 105 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 12:12:46,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:46,980 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 12:12:47,013 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 58.33% of their original sizes. [2018-11-23 12:12:47,014 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 12:12:47,091 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-23 12:12:47,091 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 12:12:47,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:12:47,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-23 12:12:47,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:12:47,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:12:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:12:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:12:47,094 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-11-23 12:12:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:47,376 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:12:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:12:47,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-23 12:12:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:47,377 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:12:47,377 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:12:47,378 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:12:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:12:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 12:12:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:12:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 12:12:47,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2018-11-23 12:12:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:47,384 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 12:12:47,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:12:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:12:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:12:47,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:47,384 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:47,385 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:47,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 12:12:47,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:47,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:47,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:12:47,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:47,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:47,430 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:47,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:47,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:47,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/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 12:12:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:12:47,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 12:12:47,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:12:47,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:47,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:12:47,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:12:47,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:47,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-11-23 12:12:47,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:47,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:12:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:12:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:12:47,771 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-11-23 12:12:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:47,820 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:12:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:12:47,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 12:12:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:47,822 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:12:47,822 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:12:47,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:12:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:12:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-11-23 12:12:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:12:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 12:12:47,827 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2018-11-23 12:12:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:47,827 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 12:12:47,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:12:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:12:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:12:47,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:47,828 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:47,829 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:47,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 12:12:47,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:47,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:47,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:12:47,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:47,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:47,894 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:47,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:47,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:47,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/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 12:12:47,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:12:47,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 12:12:47,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:12:47,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:47,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:12:47,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:12:48,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 22 [2018-11-23 12:12:48,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:48,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:12:48,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:12:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:12:48,308 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 17 states. [2018-11-23 12:12:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:48,397 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 12:12:48,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:12:48,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-23 12:12:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:48,399 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:12:48,399 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:12:48,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:12:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:12:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-11-23 12:12:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:12:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:12:48,404 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-11-23 12:12:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:48,404 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:12:48,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:12:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:12:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:12:48,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:48,405 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:48,406 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:48,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 12:12:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:48,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:48,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 12:12:48,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:48,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:48,465 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:48,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:48,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:48,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:48,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:12:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:48,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 12:12:48,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:12:48,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:48,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-11-23 12:12:48,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:48,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:12:48,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:12:48,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:12:48,932 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 9 states. [2018-11-23 12:12:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:48,974 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-23 12:12:48,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:12:48,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 12:12:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:48,975 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:12:48,975 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:12:48,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:12:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:12:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-23 12:12:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:12:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:12:48,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 37 [2018-11-23 12:12:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:48,980 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:12:48,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:12:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:12:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:12:48,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:48,981 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:48,981 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:48,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 12:12:48,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:48,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:48,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:48,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:12:49,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:49,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:49,053 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:49,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:49,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:49,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:49,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:12:49,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 12:12:49,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:12:49,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:49,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:12:49,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:12:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:49,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 15] total 30 [2018-11-23 12:12:49,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:49,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:12:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:12:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:12:49,860 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 23 states. [2018-11-23 12:12:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:50,040 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 12:12:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:12:50,040 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-11-23 12:12:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:50,041 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:12:50,041 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:12:50,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:12:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:12:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-11-23 12:12:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:12:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:12:50,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 43 [2018-11-23 12:12:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:50,047 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:12:50,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:12:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:12:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:12:50,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:50,048 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:50,048 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:50,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-23 12:12:50,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:50,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:50,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:12:50,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:50,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:50,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:50,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:50,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:50,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:12:50,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 12:12:50,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:12:50,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:50,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:12:50,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:12:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 17] total 34 [2018-11-23 12:12:51,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:12:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:12:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:12:51,062 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-11-23 12:12:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:51,231 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-23 12:12:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:12:51,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-11-23 12:12:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:51,232 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:12:51,232 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:12:51,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:12:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:12:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2018-11-23 12:12:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:12:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:12:51,238 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 49 [2018-11-23 12:12:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:51,238 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:12:51,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:12:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:12:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:12:51,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:51,240 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:51,240 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:51,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-23 12:12:51,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:51,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:51,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:51,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:51,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 12:12:51,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:51,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:51,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:51,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:51,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:51,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:51,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:51,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:12:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:51,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 12:12:51,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:12:52,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 19] total 38 [2018-11-23 12:12:52,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:52,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:12:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:12:52,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:12:52,621 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 29 states. [2018-11-23 12:12:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:52,801 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:12:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:12:52,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-11-23 12:12:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:52,803 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:12:52,803 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:12:52,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:12:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:12:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 12:12:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:12:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:12:52,809 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 55 [2018-11-23 12:12:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:52,809 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:12:52,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:12:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:12:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:12:52,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:52,810 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:52,810 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:52,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-23 12:12:52,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:52,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:52,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:12:52,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:52,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:52,884 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:52,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:52,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:52,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:12:52,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 12:12:52,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:12:52,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:52,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:12:53,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:12:54,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:54,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 36 [2018-11-23 12:12:54,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:54,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:12:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:12:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:12:54,402 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 32 states. [2018-11-23 12:12:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:54,626 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 12:12:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:12:54,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-11-23 12:12:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:54,627 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:12:54,627 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:12:54,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 15 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:12:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:12:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-11-23 12:12:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:12:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 12:12:54,631 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 61 [2018-11-23 12:12:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:54,632 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 12:12:54,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:12:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:12:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:12:54,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:54,633 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:54,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:54,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-23 12:12:54,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:54,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:54,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 12:12:54,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:54,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:12:54,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 12:12:54,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 12:12:54,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:54,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:54,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:12:54,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 12:12:54,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:12:54,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:54,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 12:12:54,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:12:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:12:56,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:12:56,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2018-11-23 12:12:56,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:12:56,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:12:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:12:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:12:56,672 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 14 states. [2018-11-23 12:12:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:56,747 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-23 12:12:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:12:56,747 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:12:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:56,748 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:12:56,748 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:12:56,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:12:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:12:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-11-23 12:12:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:12:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 12:12:56,753 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 67 [2018-11-23 12:12:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:56,753 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 12:12:56,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:12:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:12:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:12:56,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:56,754 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:56,755 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:56,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-23 12:12:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:12:56,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:56,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:56,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:12:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:12:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:12:56,783 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~input~0 := 10; VAL [main_~input~0=10] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=10] [?] ~x := #in~x; VAL [id_~x=10, |id_#in~x|=10] [?] assume !(0 == ~x); VAL [id_~x=10, |id_#in~x|=10] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=9] [?] ~x := #in~x; VAL [id_~x=9, |id_#in~x|=9] [?] assume !(0 == ~x); VAL [id_~x=9, |id_#in~x|=9] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=8] [?] ~x := #in~x; VAL [id_~x=8, |id_#in~x|=8] [?] assume !(0 == ~x); VAL [id_~x=8, |id_#in~x|=8] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=7] [?] ~x := #in~x; VAL [id_~x=7, |id_#in~x|=7] [?] assume !(0 == ~x); VAL [id_~x=7, |id_#in~x|=7] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=6] [?] ~x := #in~x; VAL [id_~x=6, |id_#in~x|=6] [?] assume !(0 == ~x); VAL [id_~x=6, |id_#in~x|=6] [?] CALL call #t~ret0 := id(~x - 1); 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 := id(~x - 1); VAL [|id_#in~x|=4] [?] ~x := #in~x; VAL [id_~x=4, |id_#in~x|=4] [?] assume !(0 == ~x); VAL [id_~x=4, |id_#in~x|=4] [?] CALL call #t~ret0 := 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 := id(~x - 1); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := 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 := id(~x - 1); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #32#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 #32#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #32#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 #32#return; VAL [id_~x=4, |id_#in~x|=4, |id_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] assume true; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] RET #32#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 #32#return; VAL [id_~x=6, |id_#in~x|=6, |id_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] assume true; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] RET #32#return; VAL [id_~x=7, |id_#in~x|=7, |id_#t~ret0|=6] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] assume true; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] RET #32#return; VAL [id_~x=8, |id_#in~x|=8, |id_#t~ret0|=7] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] assume true; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] RET #32#return; VAL [id_~x=9, |id_#in~x|=9, |id_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] assume true; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] RET #32#return; VAL [id_~x=10, |id_#in~x|=10, |id_#t~ret0|=9] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] assume true; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] RET #30#return; VAL [main_~input~0=10, |main_#t~ret1|=10] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=10, main_~result~0=10] [?] assume 10 == ~result~0; VAL [main_~input~0=10, main_~result~0=10] [?] assume !false; VAL [main_~input~0=10, main_~result~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12-L14] assume 10 == ~result~0; VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12-L14] assume 10 == ~result~0; VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] [L10] int input = 10; VAL [input=10] [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] ----- [2018-11-23 12:12:56,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:12:56 BoogieIcfgContainer [2018-11-23 12:12:56,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:12:56,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:12:56,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:12:56,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:12:56,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:12:46" (3/4) ... [2018-11-23 12:12:56,826 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 #26#return; [?] CALL call #t~ret2 := main(); [?] ~input~0 := 10; VAL [main_~input~0=10] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=10] [?] ~x := #in~x; VAL [id_~x=10, |id_#in~x|=10] [?] assume !(0 == ~x); VAL [id_~x=10, |id_#in~x|=10] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=9] [?] ~x := #in~x; VAL [id_~x=9, |id_#in~x|=9] [?] assume !(0 == ~x); VAL [id_~x=9, |id_#in~x|=9] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=8] [?] ~x := #in~x; VAL [id_~x=8, |id_#in~x|=8] [?] assume !(0 == ~x); VAL [id_~x=8, |id_#in~x|=8] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=7] [?] ~x := #in~x; VAL [id_~x=7, |id_#in~x|=7] [?] assume !(0 == ~x); VAL [id_~x=7, |id_#in~x|=7] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=6] [?] ~x := #in~x; VAL [id_~x=6, |id_#in~x|=6] [?] assume !(0 == ~x); VAL [id_~x=6, |id_#in~x|=6] [?] CALL call #t~ret0 := id(~x - 1); 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 := id(~x - 1); VAL [|id_#in~x|=4] [?] ~x := #in~x; VAL [id_~x=4, |id_#in~x|=4] [?] assume !(0 == ~x); VAL [id_~x=4, |id_#in~x|=4] [?] CALL call #t~ret0 := 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 := id(~x - 1); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := 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 := id(~x - 1); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #32#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 #32#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #32#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 #32#return; VAL [id_~x=4, |id_#in~x|=4, |id_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] assume true; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] RET #32#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 #32#return; VAL [id_~x=6, |id_#in~x|=6, |id_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] assume true; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] RET #32#return; VAL [id_~x=7, |id_#in~x|=7, |id_#t~ret0|=6] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] assume true; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] RET #32#return; VAL [id_~x=8, |id_#in~x|=8, |id_#t~ret0|=7] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] assume true; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] RET #32#return; VAL [id_~x=9, |id_#in~x|=9, |id_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] assume true; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] RET #32#return; VAL [id_~x=10, |id_#in~x|=10, |id_#t~ret0|=9] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] assume true; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] RET #30#return; VAL [main_~input~0=10, |main_#t~ret1|=10] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=10, main_~result~0=10] [?] assume 10 == ~result~0; VAL [main_~input~0=10, main_~result~0=10] [?] assume !false; VAL [main_~input~0=10, main_~result~0=10] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12-L14] assume 10 == ~result~0; VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12-L14] assume 10 == ~result~0; VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 10; VAL [~input~0=10] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=10, ~input~0=10] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=10, ~result~0=10] [L12] COND TRUE 10 == ~result~0 VAL [~input~0=10, ~result~0=10] [L13] assert false; VAL [~input~0=10, ~result~0=10] [L10] int input = 10; VAL [input=10] [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] ----- [2018-11-23 12:12:56,965 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c6854e07-5eff-4376-8b35-9d7a46bdaa15/bin-2019/utaipan/witness.graphml [2018-11-23 12:12:56,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:12:56,966 INFO L168 Benchmark]: Toolchain (without parser) took 10847.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 959.1 MB in the beginning and 961.0 MB in the end (delta: -1.9 MB). Peak memory consumption was 430.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:12:56,967 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:12:56,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:12:56,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.86 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:12:56,968 INFO L168 Benchmark]: Boogie Preprocessor took 10.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:12:56,968 INFO L168 Benchmark]: RCFGBuilder took 181.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:12:56,969 INFO L168 Benchmark]: TraceAbstraction took 10357.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 972.4 MB in the end (delta: 165.0 MB). Peak memory consumption was 443.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:12:56,969 INFO L168 Benchmark]: Witness Printer took 142.54 ms. Allocated memory is still 1.5 GB. Free memory was 972.4 MB in the beginning and 961.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:12:56,976 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.86 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10357.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 972.4 MB in the end (delta: 165.0 MB). Peak memory consumption was 443.9 MB. Max. memory is 11.5 GB. * Witness Printer took 142.54 ms. Allocated memory is still 1.5 GB. Free memory was 972.4 MB in the beginning and 961.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 10; VAL [input=10] [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 10.3s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 141 SDslu, 1245 SDs, 0 SdLazy, 732 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 963 GetRequests, 570 SyntacticMatches, 102 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2836 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.6944444444444444 AbsIntWeakeningRatio, 0.5555555555555556 AbsIntAvgWeakeningVarsNumRemoved, 0.8333333333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 74 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 841 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 137136 SizeOfPredicates, 51 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 1126/2692 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...