./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-678e011 [2019-11-20 06:52:13,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:52:13,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:52:13,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:52:13,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:52:13,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:52:13,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:52:13,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:52:13,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:52:13,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:52:13,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:52:13,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:52:13,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:52:13,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:52:13,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:52:13,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:52:13,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:52:13,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:52:13,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:52:13,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:52:13,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:52:13,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:52:13,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:52:13,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:52:13,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:52:13,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:52:13,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:52:13,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:52:13,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:52:13,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:52:13,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:52:13,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:52:13,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:52:13,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:52:13,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:52:13,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:52:13,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:52:13,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:52:13,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:52:13,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:52:13,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:52:13,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:52:13,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:52:13,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:52:13,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:52:13,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:52:13,760 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:52:13,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:52:13,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:52:13,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:52:13,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:52:13,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:52:13,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:52:13,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:52:13,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:52:13,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:52:13,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:52:13,764 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:52:13,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:52:13,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:52:13,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:52:13,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:52:13,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:52:13,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:52:13,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:52:13,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:52:13,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:52:13,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:52:13,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:52:13,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:52:13,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2019-11-20 06:52:14,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:52:14,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:52:14,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:52:14,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:52:14,020 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:52:14,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2019-11-20 06:52:14,089 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/data/e23f798c1/c69288fa16ea4bedb06dfd2dcf72094e/FLAG861be8773 [2019-11-20 06:52:14,512 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:52:14,513 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2019-11-20 06:52:14,520 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/data/e23f798c1/c69288fa16ea4bedb06dfd2dcf72094e/FLAG861be8773 [2019-11-20 06:52:14,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/data/e23f798c1/c69288fa16ea4bedb06dfd2dcf72094e [2019-11-20 06:52:14,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:52:14,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:52:14,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:52:14,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:52:14,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:52:14,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:52:14" (1/1) ... [2019-11-20 06:52:14,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d0b965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:14, skipping insertion in model container [2019-11-20 06:52:14,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:52:14" (1/1) ... [2019-11-20 06:52:14,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:52:14,938 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:52:15,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:52:15,157 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:52:15,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:52:15,285 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:52:15,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15 WrapperNode [2019-11-20 06:52:15,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:52:15,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:52:15,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:52:15,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:52:15,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:52:15,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:52:15,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:52:15,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:52:15,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... [2019-11-20 06:52:15,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:52:15,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:52:15,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:52:15,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:52:15,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:52:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:52:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:52:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-20 06:52:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-20 06:52:15,685 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:52:15,685 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 06:52:15,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:52:15 BoogieIcfgContainer [2019-11-20 06:52:15,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:52:15,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:52:15,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:52:15,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:52:15,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:52:14" (1/3) ... [2019-11-20 06:52:15,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295f9016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:52:15, skipping insertion in model container [2019-11-20 06:52:15,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:52:15" (2/3) ... [2019-11-20 06:52:15,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295f9016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:52:15, skipping insertion in model container [2019-11-20 06:52:15,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:52:15" (3/3) ... [2019-11-20 06:52:15,695 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2019-11-20 06:52:15,722 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:52:15,728 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:52:15,757 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:52:15,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:52:15,809 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:52:15,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:52:15,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:52:15,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:52:15,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:52:15,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:52:15,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:52:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-20 06:52:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 06:52:15,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:15,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:15,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-11-20 06:52:15,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:15,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397140186] [2019-11-20 06:52:15,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:52:16,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397140186] [2019-11-20 06:52:16,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:16,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 06:52:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368919234] [2019-11-20 06:52:16,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 06:52:16,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:16,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 06:52:16,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:52:16,148 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2019-11-20 06:52:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:16,297 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-20 06:52:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:52:16,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-20 06:52:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:16,310 INFO L225 Difference]: With dead ends: 29 [2019-11-20 06:52:16,311 INFO L226 Difference]: Without dead ends: 17 [2019-11-20 06:52:16,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:52:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-20 06:52:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-20 06:52:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 06:52:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-20 06:52:16,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-20 06:52:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:16,373 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-20 06:52:16,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 06:52:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-20 06:52:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 06:52:16,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:16,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:16,376 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-11-20 06:52:16,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:16,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26704087] [2019-11-20 06:52:16,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:52:16,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26704087] [2019-11-20 06:52:16,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:16,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 06:52:16,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39059734] [2019-11-20 06:52:16,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 06:52:16,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:16,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 06:52:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:52:16,480 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 7 states. [2019-11-20 06:52:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:16,589 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-20 06:52:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:52:16,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-20 06:52:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:16,591 INFO L225 Difference]: With dead ends: 23 [2019-11-20 06:52:16,591 INFO L226 Difference]: Without dead ends: 19 [2019-11-20 06:52:16,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:52:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-20 06:52:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-20 06:52:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 06:52:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-20 06:52:16,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-20 06:52:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:16,600 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-20 06:52:16,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 06:52:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-20 06:52:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:52:16,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:16,602 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:16,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-11-20 06:52:16,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:16,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669723829] [2019-11-20 06:52:16,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 06:52:16,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669723829] [2019-11-20 06:52:16,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419189118] [2019-11-20 06:52:16,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:16,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 06:52:16,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 06:52:16,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:16,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-20 06:52:16,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269930923] [2019-11-20 06:52:16,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:52:16,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:52:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:52:16,940 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-11-20 06:52:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:17,080 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-11-20 06:52:17,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:52:17,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 06:52:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:17,083 INFO L225 Difference]: With dead ends: 41 [2019-11-20 06:52:17,083 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 06:52:17,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 06:52:17,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 06:52:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-20 06:52:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 06:52:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-20 06:52:17,093 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2019-11-20 06:52:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-20 06:52:17,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:52:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-20 06:52:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 06:52:17,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:17,097 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:17,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:17,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-11-20 06:52:17,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:17,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846320719] [2019-11-20 06:52:17,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 06:52:17,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846320719] [2019-11-20 06:52:17,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417994071] [2019-11-20 06:52:17,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:17,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 06:52:17,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 06:52:17,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-20 06:52:17,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392665518] [2019-11-20 06:52:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:52:17,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:52:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:52:17,572 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2019-11-20 06:52:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:17,752 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-11-20 06:52:17,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:52:17,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-20 06:52:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:17,756 INFO L225 Difference]: With dead ends: 47 [2019-11-20 06:52:17,756 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 06:52:17,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 06:52:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 06:52:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-20 06:52:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 06:52:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-20 06:52:17,779 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 23 [2019-11-20 06:52:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:17,780 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-20 06:52:17,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:52:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-11-20 06:52:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 06:52:17,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:17,784 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:17,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:17,989 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:17,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1840059703, now seen corresponding path program 2 times [2019-11-20 06:52:17,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:17,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079050738] [2019-11-20 06:52:17,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 06:52:18,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079050738] [2019-11-20 06:52:18,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275737651] [2019-11-20 06:52:18,212 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:18,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 06:52:18,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:18,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:52:18,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 06:52:18,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:18,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-20 06:52:18,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379607125] [2019-11-20 06:52:18,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 06:52:18,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 06:52:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:52:18,317 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 12 states. [2019-11-20 06:52:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:18,580 INFO L93 Difference]: Finished difference Result 67 states and 101 transitions. [2019-11-20 06:52:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 06:52:18,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-20 06:52:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:18,582 INFO L225 Difference]: With dead ends: 67 [2019-11-20 06:52:18,582 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 06:52:18,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-20 06:52:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 06:52:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-20 06:52:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 06:52:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-20 06:52:18,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 35 [2019-11-20 06:52:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:18,592 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-20 06:52:18,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 06:52:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-20 06:52:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 06:52:18,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:18,595 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:18,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:18,803 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash 624826665, now seen corresponding path program 2 times [2019-11-20 06:52:18,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:18,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133375550] [2019-11-20 06:52:18,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 06:52:19,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133375550] [2019-11-20 06:52:19,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216945906] [2019-11-20 06:52:19,010 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:19,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 06:52:19,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:19,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:52:19,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 06:52:19,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:19,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-20 06:52:19,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456082504] [2019-11-20 06:52:19,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 06:52:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 06:52:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:52:19,111 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 12 states. [2019-11-20 06:52:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:19,355 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-20 06:52:19,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:52:19,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-20 06:52:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:19,358 INFO L225 Difference]: With dead ends: 52 [2019-11-20 06:52:19,358 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 06:52:19,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:52:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 06:52:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-20 06:52:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 06:52:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2019-11-20 06:52:19,383 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2019-11-20 06:52:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:19,383 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-11-20 06:52:19,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 06:52:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2019-11-20 06:52:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 06:52:19,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:19,388 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:19,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:19,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:19,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1133813247, now seen corresponding path program 3 times [2019-11-20 06:52:19,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:19,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990244596] [2019-11-20 06:52:19,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 73 proven. 128 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-20 06:52:20,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990244596] [2019-11-20 06:52:20,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91236083] [2019-11-20 06:52:20,010 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:20,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-20 06:52:20,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:20,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:52:20,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 06:52:20,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:20,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-11-20 06:52:20,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246364463] [2019-11-20 06:52:20,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 06:52:20,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 06:52:20,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-20 06:52:20,182 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 16 states. [2019-11-20 06:52:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:20,445 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2019-11-20 06:52:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 06:52:20,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-11-20 06:52:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:20,447 INFO L225 Difference]: With dead ends: 94 [2019-11-20 06:52:20,447 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 06:52:20,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-11-20 06:52:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 06:52:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-20 06:52:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 06:52:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-11-20 06:52:20,460 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 89 [2019-11-20 06:52:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:20,461 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-11-20 06:52:20,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 06:52:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-11-20 06:52:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 06:52:20,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:20,465 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:20,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:20,674 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:20,674 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-11-20 06:52:20,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:20,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502040318] [2019-11-20 06:52:20,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 57 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-20 06:52:21,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502040318] [2019-11-20 06:52:21,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471996999] [2019-11-20 06:52:21,054 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:21,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 06:52:21,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:21,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 06:52:21,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-20 06:52:21,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:21,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 19 [2019-11-20 06:52:21,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098585926] [2019-11-20 06:52:21,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 06:52:21,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 06:52:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-20 06:52:21,193 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 19 states. [2019-11-20 06:52:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:21,609 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2019-11-20 06:52:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 06:52:21,611 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-11-20 06:52:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:21,614 INFO L225 Difference]: With dead ends: 93 [2019-11-20 06:52:21,614 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 06:52:21,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-11-20 06:52:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 06:52:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-20 06:52:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 06:52:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-11-20 06:52:21,638 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 78 [2019-11-20 06:52:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:21,639 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-11-20 06:52:21,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 06:52:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-11-20 06:52:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 06:52:21,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:21,646 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:21,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:21,853 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 5 times [2019-11-20 06:52:21,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:21,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979557349] [2019-11-20 06:52:21,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 166 proven. 339 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-11-20 06:52:22,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979557349] [2019-11-20 06:52:22,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456106559] [2019-11-20 06:52:22,408 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:22,473 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-20 06:52:22,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:22,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 06:52:22,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-11-20 06:52:22,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:22,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 25 [2019-11-20 06:52:22,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969375549] [2019-11-20 06:52:22,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 06:52:22,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 06:52:22,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-11-20 06:52:22,614 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 25 states. [2019-11-20 06:52:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:23,182 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2019-11-20 06:52:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 06:52:23,183 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-11-20 06:52:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:23,184 INFO L225 Difference]: With dead ends: 111 [2019-11-20 06:52:23,185 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 06:52:23,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 06:52:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 06:52:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-20 06:52:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 06:52:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-11-20 06:52:23,200 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2019-11-20 06:52:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:23,200 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-11-20 06:52:23,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 06:52:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-11-20 06:52:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 06:52:23,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:23,203 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:23,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:23,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2009245247, now seen corresponding path program 6 times [2019-11-20 06:52:23,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:23,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492280486] [2019-11-20 06:52:23,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-20 06:52:23,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492280486] [2019-11-20 06:52:23,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633777543] [2019-11-20 06:52:23,883 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:23,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-20 06:52:23,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:23,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 06:52:23,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-11-20 06:52:24,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:24,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 18 [2019-11-20 06:52:24,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831394939] [2019-11-20 06:52:24,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 06:52:24,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 06:52:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-20 06:52:24,038 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 18 states. [2019-11-20 06:52:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:24,299 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-11-20 06:52:24,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 06:52:24,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-11-20 06:52:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:24,306 INFO L225 Difference]: With dead ends: 182 [2019-11-20 06:52:24,306 INFO L226 Difference]: Without dead ends: 178 [2019-11-20 06:52:24,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-20 06:52:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-20 06:52:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2019-11-20 06:52:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-20 06:52:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2019-11-20 06:52:24,363 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2019-11-20 06:52:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:24,364 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2019-11-20 06:52:24,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 06:52:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2019-11-20 06:52:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-20 06:52:24,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:24,376 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:24,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:24,579 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash 503828745, now seen corresponding path program 7 times [2019-11-20 06:52:24,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:24,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824860952] [2019-11-20 06:52:24,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 885 proven. 1801 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2019-11-20 06:52:26,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824860952] [2019-11-20 06:52:26,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486384406] [2019-11-20 06:52:26,012 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:26,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 06:52:26,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2019-11-20 06:52:26,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:26,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 11] total 32 [2019-11-20 06:52:26,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774429919] [2019-11-20 06:52:26,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-20 06:52:26,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-20 06:52:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-11-20 06:52:26,300 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand 32 states. [2019-11-20 06:52:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:27,253 INFO L93 Difference]: Finished difference Result 274 states and 469 transitions. [2019-11-20 06:52:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-20 06:52:27,253 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2019-11-20 06:52:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:27,256 INFO L225 Difference]: With dead ends: 274 [2019-11-20 06:52:27,256 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 06:52:27,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=483, Invalid=1967, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 06:52:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 06:52:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-20 06:52:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 06:52:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2019-11-20 06:52:27,284 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 350 [2019-11-20 06:52:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:27,286 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2019-11-20 06:52:27,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-20 06:52:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2019-11-20 06:52:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-20 06:52:27,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:27,296 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:27,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:27,501 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash 187396788, now seen corresponding path program 8 times [2019-11-20 06:52:27,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:27,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979942572] [2019-11-20 06:52:27,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-11-20 06:52:28,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979942572] [2019-11-20 06:52:28,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480627242] [2019-11-20 06:52:28,964 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:29,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 06:52:29,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:29,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 06:52:29,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-11-20 06:52:29,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:29,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 22 [2019-11-20 06:52:29,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094296125] [2019-11-20 06:52:29,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 06:52:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 06:52:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-11-20 06:52:29,352 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand 22 states. [2019-11-20 06:52:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:29,783 INFO L93 Difference]: Finished difference Result 365 states and 563 transitions. [2019-11-20 06:52:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 06:52:29,784 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 459 [2019-11-20 06:52:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:29,794 INFO L225 Difference]: With dead ends: 365 [2019-11-20 06:52:29,794 INFO L226 Difference]: Without dead ends: 361 [2019-11-20 06:52:29,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-20 06:52:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-20 06:52:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 343. [2019-11-20 06:52:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-20 06:52:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 525 transitions. [2019-11-20 06:52:29,866 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 525 transitions. Word has length 459 [2019-11-20 06:52:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:29,867 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 525 transitions. [2019-11-20 06:52:29,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 06:52:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 525 transitions. [2019-11-20 06:52:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-20 06:52:29,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:29,910 INFO L410 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:30,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:30,115 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -904244701, now seen corresponding path program 9 times [2019-11-20 06:52:30,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:30,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927037955] [2019-11-20 06:52:30,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3524 proven. 7380 refuted. 0 times theorem prover too weak. 40006 trivial. 0 not checked. [2019-11-20 06:52:34,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927037955] [2019-11-20 06:52:34,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166437702] [2019-11-20 06:52:34,362 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:34,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-11-20 06:52:34,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 06:52:34,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 06:52:34,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2019-11-20 06:52:35,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:52:35,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 40 [2019-11-20 06:52:35,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294534906] [2019-11-20 06:52:35,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-20 06:52:35,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:35,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-20 06:52:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2019-11-20 06:52:35,112 INFO L87 Difference]: Start difference. First operand 343 states and 525 transitions. Second operand 40 states. [2019-11-20 06:52:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:36,538 INFO L93 Difference]: Finished difference Result 501 states and 882 transitions. [2019-11-20 06:52:36,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-20 06:52:36,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 922 [2019-11-20 06:52:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:36,543 INFO L225 Difference]: With dead ends: 501 [2019-11-20 06:52:36,544 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 06:52:36,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1253 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=795, Invalid=3495, Unknown=0, NotChecked=0, Total=4290 [2019-11-20 06:52:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 06:52:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2019-11-20 06:52:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-20 06:52:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2019-11-20 06:52:36,570 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 922 [2019-11-20 06:52:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:36,571 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2019-11-20 06:52:36,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-20 06:52:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2019-11-20 06:52:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-11-20 06:52:36,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:36,586 INFO L410 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:36,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:36,793 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1577357454, now seen corresponding path program 10 times [2019-11-20 06:52:36,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:36,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605680586] [2019-11-20 06:52:36,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:52:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 06:52:37,509 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 06:52:37,509 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 06:52:37,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:52:37 BoogieIcfgContainer [2019-11-20 06:52:37,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:52:37,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:52:37,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:52:37,743 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:52:37,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:52:15" (3/4) ... [2019-11-20 06:52:37,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 06:52:37,980 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b268a74e-64c7-42e1-90fa-4f8208b8486d/bin/uautomizer/witness.graphml [2019-11-20 06:52:37,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:52:37,982 INFO L168 Benchmark]: Toolchain (without parser) took 23076.74 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 944.8 MB in the beginning and 994.4 MB in the end (delta: -49.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-20 06:52:37,983 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:52:37,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -205.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:37,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:52:37,984 INFO L168 Benchmark]: Boogie Preprocessor took 17.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:52:37,984 INFO L168 Benchmark]: RCFGBuilder took 340.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:37,985 INFO L168 Benchmark]: TraceAbstraction took 22054.38 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 966.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-20 06:52:37,985 INFO L168 Benchmark]: Witness Printer took 237.83 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 994.4 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:37,987 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -205.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 340.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22054.38 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 966.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 237.83 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 994.4 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 21.9s, OverallIterations: 14, TraceHistogramMax: 177, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 234 SDtfs, 881 SDslu, 1148 SDs, 0 SdLazy, 3473 SolverSat, 1190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3265 GetRequests, 2981 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 114 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 5867 NumberOfCodeBlocks, 5182 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 4635 ConstructedInterpolants, 0 QuantifiedInterpolants, 3359135 SizeOfPredicates, 63 NumberOfNonLiveVariables, 3649 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 124862/147640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...