./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.23-635dfa2 [2018-12-02 01:17:51,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:17:51,723 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:17:51,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:17:51,729 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:17:51,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:17:51,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:17:51,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:17:51,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:17:51,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:17:51,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:17:51,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:17:51,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:17:51,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:17:51,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:17:51,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:17:51,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:17:51,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:17:51,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:17:51,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:17:51,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:17:51,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:17:51,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:17:51,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:17:51,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:17:51,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:17:51,741 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:17:51,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:17:51,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:17:51,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:17:51,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:17:51,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:17:51,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:17:51,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:17:51,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:17:51,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:17:51,744 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 01:17:51,751 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:17:51,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:17:51,751 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:17:51,751 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:17:51,752 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:17:51,752 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:17:51,752 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:17:51,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:17:51,752 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:17:51,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:17:51,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:17:51,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:17:51,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:17:51,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:17:51,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:17:51,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-12-02 01:17:51,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:17:51,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:17:51,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:17:51,781 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:17:51,781 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:17:51,781 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-12-02 01:17:51,815 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/data/1162309ce/5de9e2994a2847e5801991fe6abd8450/FLAGe1f2a31eb [2018-12-02 01:17:52,185 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:17:52,185 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-12-02 01:17:52,189 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/data/1162309ce/5de9e2994a2847e5801991fe6abd8450/FLAGe1f2a31eb [2018-12-02 01:17:52,557 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/data/1162309ce/5de9e2994a2847e5801991fe6abd8450 [2018-12-02 01:17:52,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:17:52,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:17:52,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:17:52,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:17:52,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:17:52,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf9aced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52, skipping insertion in model container [2018-12-02 01:17:52,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:17:52,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:17:52,659 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:17:52,661 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:17:52,669 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:17:52,677 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:17:52,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52 WrapperNode [2018-12-02 01:17:52,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:17:52,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:17:52,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:17:52,678 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:17:52,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:17:52,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:17:52,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:17:52,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:17:52,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... [2018-12-02 01:17:52,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:17:52,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:17:52,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:17:52,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:17:52,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:17:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:17:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:17:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:17:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:17:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:17:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:17:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-12-02 01:17:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-12-02 01:17:52,846 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:17:52,846 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 01:17:52,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:52 BoogieIcfgContainer [2018-12-02 01:17:52,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:17:52,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:17:52,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:17:52,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:17:52,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:17:52" (1/3) ... [2018-12-02 01:17:52,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121b5d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:17:52, skipping insertion in model container [2018-12-02 01:17:52,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:52" (2/3) ... [2018-12-02 01:17:52,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121b5d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:17:52, skipping insertion in model container [2018-12-02 01:17:52,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:52" (3/3) ... [2018-12-02 01:17:52,850 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-12-02 01:17:52,856 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:17:52,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 01:17:52,869 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 01:17:52,887 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:17:52,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:17:52,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:17:52,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:17:52,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:17:52,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:17:52,888 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:17:52,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:17:52,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:17:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-02 01:17:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 01:17:52,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:52,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:52,904 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:52,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-12-02 01:17:52,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:52,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:52,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:52,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:52,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:17:53,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:17:53,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:17:53,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:17:53,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:17:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:17:53,017 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-12-02 01:17:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:53,080 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-02 01:17:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:17:53,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 01:17:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:53,087 INFO L225 Difference]: With dead ends: 35 [2018-12-02 01:17:53,087 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 01:17:53,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:17:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 01:17:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 01:17:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 01:17:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 01:17:53,114 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-12-02 01:17:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:53,115 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 01:17:53,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:17:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 01:17:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 01:17:53,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:53,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:53,116 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:53,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-12-02 01:17:53,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:17:53,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:17:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:17:53,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:17:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:17:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:17:53,145 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-12-02 01:17:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:53,175 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-02 01:17:53,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:17:53,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 01:17:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:53,176 INFO L225 Difference]: With dead ends: 27 [2018-12-02 01:17:53,176 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 01:17:53,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:17:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 01:17:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-02 01:17:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 01:17:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 01:17:53,180 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-12-02 01:17:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:53,180 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 01:17:53,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:17:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 01:17:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 01:17:53,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:53,181 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:53,181 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:53,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-12-02 01:17:53,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:53,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:53,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:53,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 01:17:53,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:53,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 01:17:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-02 01:17:53,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:17:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:17:53,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:17:53,299 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-12-02 01:17:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:53,357 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-12-02 01:17:53,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:17:53,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 01:17:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:53,358 INFO L225 Difference]: With dead ends: 38 [2018-12-02 01:17:53,358 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 01:17:53,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 01:17:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 01:17:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 01:17:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 01:17:53,362 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-12-02 01:17:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:53,362 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 01:17:53,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:17:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 01:17:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 01:17:53,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:53,363 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:53,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:53,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-12-02 01:17:53,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 01:17:53,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:53,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:53,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 01:17:53,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:53,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 01:17:53,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:17:53,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:17:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:17:53,444 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-12-02 01:17:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:53,479 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-12-02 01:17:53,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:17:53,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 01:17:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:53,480 INFO L225 Difference]: With dead ends: 32 [2018-12-02 01:17:53,480 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 01:17:53,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:17:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 01:17:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 01:17:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 01:17:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-02 01:17:53,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-12-02 01:17:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:53,484 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 01:17:53,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:17:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-02 01:17:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 01:17:53,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:53,485 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:53,485 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:53,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-12-02 01:17:53,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:53,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 01:17:53,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:53,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:17:53,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:17:53,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:53,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 01:17:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:53,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-12-02 01:17:53,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:17:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:17:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:17:53,585 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-12-02 01:17:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:53,658 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-12-02 01:17:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:17:53,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-02 01:17:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:53,660 INFO L225 Difference]: With dead ends: 40 [2018-12-02 01:17:53,660 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 01:17:53,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 01:17:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-02 01:17:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 01:17:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-12-02 01:17:53,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-12-02 01:17:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:53,667 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-12-02 01:17:53,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:17:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-12-02 01:17:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 01:17:53,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:53,669 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:53,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:53,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-12-02 01:17:53,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-02 01:17:53,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:53,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:53,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:17:53,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 01:17:53,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:53,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-12-02 01:17:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:53,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-02 01:17:53,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 01:17:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 01:17:53,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:53,860 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-12-02 01:17:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:54,036 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-12-02 01:17:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:17:54,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 01:17:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:54,037 INFO L225 Difference]: With dead ends: 76 [2018-12-02 01:17:54,038 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 01:17:54,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-02 01:17:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 01:17:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-02 01:17:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 01:17:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-12-02 01:17:54,044 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-12-02 01:17:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-12-02 01:17:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 01:17:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-12-02 01:17:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:17:54,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:54,046 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:54,046 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:54,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 4 times [2018-12-02 01:17:54,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:54,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-02 01:17:54,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:54,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:54,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 01:17:54,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 01:17:54,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:54,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 01:17:54,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:54,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-12-02 01:17:54,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:17:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:17:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:17:54,133 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-12-02 01:17:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:54,203 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-12-02 01:17:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:17:54,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-12-02 01:17:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:54,204 INFO L225 Difference]: With dead ends: 52 [2018-12-02 01:17:54,204 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 01:17:54,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:54,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 01:17:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 01:17:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 01:17:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-12-02 01:17:54,210 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-12-02 01:17:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:54,210 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-12-02 01:17:54,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:17:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-12-02 01:17:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 01:17:54,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:54,213 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 19, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:54,213 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:54,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1548772748, now seen corresponding path program 5 times [2018-12-02 01:17:54,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:54,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:54,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 93 proven. 312 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-12-02 01:17:54,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:54,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 01:17:54,338 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-12-02 01:17:54,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:54,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 822 proven. 67 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-12-02 01:17:54,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:54,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-12-02 01:17:54,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 01:17:54,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 01:17:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:54,409 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 12 states. [2018-12-02 01:17:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:54,609 INFO L93 Difference]: Finished difference Result 125 states and 254 transitions. [2018-12-02 01:17:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 01:17:54,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2018-12-02 01:17:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:54,610 INFO L225 Difference]: With dead ends: 125 [2018-12-02 01:17:54,610 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 01:17:54,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-12-02 01:17:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 01:17:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-12-02 01:17:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 01:17:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-12-02 01:17:54,617 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 164 [2018-12-02 01:17:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:54,617 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-12-02 01:17:54,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 01:17:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-12-02 01:17:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-02 01:17:54,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:54,618 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:54,619 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:54,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1320987401, now seen corresponding path program 6 times [2018-12-02 01:17:54,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:54,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 263 proven. 96 refuted. 0 times theorem prover too weak. 797 trivial. 0 not checked. [2018-12-02 01:17:54,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:54,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 01:17:54,703 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-02 01:17:54,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:54,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 582 proven. 39 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-12-02 01:17:54,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:54,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-12-02 01:17:54,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 01:17:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 01:17:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:17:54,766 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 13 states. [2018-12-02 01:17:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:55,001 INFO L93 Difference]: Finished difference Result 152 states and 239 transitions. [2018-12-02 01:17:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 01:17:55,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 150 [2018-12-02 01:17:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:55,002 INFO L225 Difference]: With dead ends: 152 [2018-12-02 01:17:55,002 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 01:17:55,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-12-02 01:17:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 01:17:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2018-12-02 01:17:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 01:17:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2018-12-02 01:17:55,010 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 150 [2018-12-02 01:17:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:55,010 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2018-12-02 01:17:55,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 01:17:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2018-12-02 01:17:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 01:17:55,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:55,012 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:55,012 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:55,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 7 times [2018-12-02 01:17:55,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:55,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:55,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-12-02 01:17:55,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:55,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:55,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-12-02 01:17:55,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-12-02 01:17:55,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 01:17:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 01:17:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:17:55,191 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand 10 states. [2018-12-02 01:17:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:55,285 INFO L93 Difference]: Finished difference Result 95 states and 136 transitions. [2018-12-02 01:17:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:17:55,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-12-02 01:17:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:55,287 INFO L225 Difference]: With dead ends: 95 [2018-12-02 01:17:55,287 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 01:17:55,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-02 01:17:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 01:17:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-12-02 01:17:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 01:17:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2018-12-02 01:17:55,294 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 218 [2018-12-02 01:17:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:55,294 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2018-12-02 01:17:55,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 01:17:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2018-12-02 01:17:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-12-02 01:17:55,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:55,299 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 42, 26, 26, 26, 26, 26, 26, 26, 16, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:55,299 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:55,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1752694001, now seen corresponding path program 8 times [2018-12-02 01:17:55,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:55,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:17:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 955 proven. 903 refuted. 0 times theorem prover too weak. 5815 trivial. 0 not checked. [2018-12-02 01:17:55,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:55,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 01:17:55,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 01:17:55,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:55,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 247 proven. 1531 refuted. 0 times theorem prover too weak. 5895 trivial. 0 not checked. [2018-12-02 01:17:55,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:55,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2018-12-02 01:17:55,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 01:17:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 01:17:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-02 01:17:55,646 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand 19 states. [2018-12-02 01:17:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:56,098 INFO L93 Difference]: Finished difference Result 191 states and 333 transitions. [2018-12-02 01:17:56,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 01:17:56,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 367 [2018-12-02 01:17:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:56,099 INFO L225 Difference]: With dead ends: 191 [2018-12-02 01:17:56,099 INFO L226 Difference]: Without dead ends: 113 [2018-12-02 01:17:56,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 01:17:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-02 01:17:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-12-02 01:17:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 01:17:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-12-02 01:17:56,108 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 367 [2018-12-02 01:17:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:56,109 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2018-12-02 01:17:56,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 01:17:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2018-12-02 01:17:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-02 01:17:56,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:56,112 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:56,112 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -229001048, now seen corresponding path program 9 times [2018-12-02 01:17:56,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:56,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:56,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1412 proven. 592 refuted. 0 times theorem prover too weak. 10383 trivial. 0 not checked. [2018-12-02 01:17:56,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:56,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:56,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:17:56,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-02 01:17:56,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:56,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1415 proven. 256 refuted. 0 times theorem prover too weak. 10716 trivial. 0 not checked. [2018-12-02 01:17:56,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:56,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-12-02 01:17:56,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:17:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:17:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:17:56,426 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 11 states. [2018-12-02 01:17:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:56,520 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2018-12-02 01:17:56,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:17:56,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 463 [2018-12-02 01:17:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:56,521 INFO L225 Difference]: With dead ends: 106 [2018-12-02 01:17:56,521 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 01:17:56,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:17:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 01:17:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-12-02 01:17:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 01:17:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-12-02 01:17:56,530 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 463 [2018-12-02 01:17:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:56,531 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2018-12-02 01:17:56,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:17:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2018-12-02 01:17:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-12-02 01:17:56,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:56,534 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:56,535 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:56,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1932846124, now seen corresponding path program 10 times [2018-12-02 01:17:56,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:56,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:56,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 440 proven. 2503 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2018-12-02 01:17:56,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:56,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 01:17:56,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 01:17:56,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:56,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2018-12-02 01:17:56,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-12-02 01:17:56,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 01:17:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 01:17:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:56,931 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 12 states. [2018-12-02 01:17:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:57,048 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2018-12-02 01:17:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:17:57,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 572 [2018-12-02 01:17:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:57,050 INFO L225 Difference]: With dead ends: 111 [2018-12-02 01:17:57,050 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 01:17:57,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:17:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 01:17:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-02 01:17:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 01:17:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2018-12-02 01:17:57,056 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 572 [2018-12-02 01:17:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:57,057 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2018-12-02 01:17:57,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 01:17:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2018-12-02 01:17:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-12-02 01:17:57,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:57,059 INFO L402 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:57,060 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:57,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 11 times [2018-12-02 01:17:57,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:57,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 2731 proven. 1215 refuted. 0 times theorem prover too weak. 29150 trivial. 0 not checked. [2018-12-02 01:17:57,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:57,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:57,308 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 01:17:57,588 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 93 check-sat command(s) [2018-12-02 01:17:57,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:57,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 3081 proven. 1418 refuted. 0 times theorem prover too weak. 28597 trivial. 0 not checked. [2018-12-02 01:17:57,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:57,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-12-02 01:17:57,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 01:17:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 01:17:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:17:57,830 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand 12 states. [2018-12-02 01:17:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:57,949 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2018-12-02 01:17:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:17:57,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 749 [2018-12-02 01:17:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:57,951 INFO L225 Difference]: With dead ends: 111 [2018-12-02 01:17:57,951 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 01:17:57,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:17:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 01:17:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-02 01:17:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 01:17:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2018-12-02 01:17:57,956 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 749 [2018-12-02 01:17:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:57,956 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2018-12-02 01:17:57,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 01:17:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2018-12-02 01:17:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-12-02 01:17:57,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:57,960 INFO L402 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:57,960 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:57,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash -589175644, now seen corresponding path program 12 times [2018-12-02 01:17:57,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:57,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:57,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 768 proven. 4887 refuted. 0 times theorem prover too weak. 45255 trivial. 0 not checked. [2018-12-02 01:17:58,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:58,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 01:17:58,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-12-02 01:17:58,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:58,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 1363 proven. 4292 refuted. 0 times theorem prover too weak. 45255 trivial. 0 not checked. [2018-12-02 01:17:58,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:17:58,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 01:17:58,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 01:17:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 01:17:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:17:58,637 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand 13 states. [2018-12-02 01:17:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:58,762 INFO L93 Difference]: Finished difference Result 116 states and 181 transitions. [2018-12-02 01:17:58,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 01:17:58,763 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 926 [2018-12-02 01:17:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:58,764 INFO L225 Difference]: With dead ends: 116 [2018-12-02 01:17:58,764 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 01:17:58,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 933 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-12-02 01:17:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 01:17:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-12-02 01:17:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 01:17:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 168 transitions. [2018-12-02 01:17:58,769 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 168 transitions. Word has length 926 [2018-12-02 01:17:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:58,770 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 168 transitions. [2018-12-02 01:17:58,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 01:17:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 168 transitions. [2018-12-02 01:17:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1935 [2018-12-02 01:17:58,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:58,782 INFO L402 BasicCegarLoop]: trace histogram [283, 283, 229, 141, 141, 141, 141, 141, 141, 141, 88, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:58,782 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:58,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1391482882, now seen corresponding path program 13 times [2018-12-02 01:17:58,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:17:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:17:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:58,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:17:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 225198 backedges. 8327 proven. 6007 refuted. 0 times theorem prover too weak. 210864 trivial. 0 not checked. [2018-12-02 01:17:59,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:17:59,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:17:59,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:18:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:18:00,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:18:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 225198 backedges. 3215 proven. 11111 refuted. 0 times theorem prover too weak. 210872 trivial. 0 not checked. [2018-12-02 01:18:01,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:18:01,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-12-02 01:18:01,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 01:18:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 01:18:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:18:01,187 INFO L87 Difference]: Start difference. First operand 109 states and 168 transitions. Second operand 18 states. [2018-12-02 01:18:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:18:01,326 INFO L93 Difference]: Finished difference Result 206 states and 548 transitions. [2018-12-02 01:18:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 01:18:01,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1934 [2018-12-02 01:18:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:18:01,328 INFO L225 Difference]: With dead ends: 206 [2018-12-02 01:18:01,328 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 01:18:01,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1965 GetRequests, 1939 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2018-12-02 01:18:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 01:18:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-02 01:18:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 01:18:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2018-12-02 01:18:01,334 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 1934 [2018-12-02 01:18:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:18:01,334 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2018-12-02 01:18:01,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 01:18:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2018-12-02 01:18:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-12-02 01:18:01,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:18:01,340 INFO L402 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:18:01,340 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:18:01,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:18:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 14 times [2018-12-02 01:18:01,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:18:01,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:18:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:18:01,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:18:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:18:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:18:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:18:01,450 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:18:01,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:18:01 BoogieIcfgContainer [2018-12-02 01:18:01,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:18:01,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:18:01,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:18:01,524 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:18:01,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:52" (3/4) ... [2018-12-02 01:18:01,526 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:18:01,603 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_add4a774-1b59-4a16-8c25-98bb74362205/bin-2019/uautomizer/witness.graphml [2018-12-02 01:18:01,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:18:01,604 INFO L168 Benchmark]: Toolchain (without parser) took 9044.82 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 956.0 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 316.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:18:01,605 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:18:01,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 117.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:18:01,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.38 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:18:01,606 INFO L168 Benchmark]: Boogie Preprocessor took 10.25 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:18:01,606 INFO L168 Benchmark]: RCFGBuilder took 146.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:18:01,606 INFO L168 Benchmark]: TraceAbstraction took 8677.37 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:18:01,606 INFO L168 Benchmark]: Witness Printer took 79.43 ms. Allocated memory is still 3.0 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:18:01,608 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 117.04 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.38 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.25 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 146.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8677.37 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. * Witness Printer took 79.43 ms. Allocated memory is still 3.0 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 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; VAL [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) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 8.6s OverallTime, 17 OverallIterations, 283 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 311 SDtfs, 583 SDslu, 1157 SDs, 0 SdLazy, 1828 SolverSat, 690 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6107 GetRequests, 5840 SyntacticMatches, 2 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 70 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 12839 NumberOfCodeBlocks, 11630 NumberOfCodeBlocksAsserted, 194 NumberOfCheckSat, 11597 ConstructedInterpolants, 0 QuantifiedInterpolants, 13261871 SizeOfPredicates, 86 NumberOfNonLiveVariables, 10144 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 668726/708388 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...