./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.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_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-03 05:58:26,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:58:26,679 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:58:26,685 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:58:26,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:58:26,686 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:58:26,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:58:26,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:58:26,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:58:26,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:58:26,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:58:26,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:58:26,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:58:26,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:58:26,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:58:26,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:58:26,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:58:26,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:58:26,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:58:26,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:58:26,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:58:26,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:58:26,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:58:26,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:58:26,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:58:26,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:58:26,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:58:26,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:58:26,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:58:26,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:58:26,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:58:26,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:58:26,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:58:26,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:58:26,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:58:26,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:58:26,700 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:58:26,707 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:58:26,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:58:26,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:58:26,707 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:58:26,708 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:58:26,708 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:58:26,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:58:26,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:58:26,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:58:26,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:58:26,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:58:26,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:58:26,711 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:58:26,711 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2018-12-03 05:58:26,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:58:26,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:58:26,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:58:26,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:58:26,742 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:58:26,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-12-03 05:58:26,779 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/data/5e5208f7b/a080737dec9444ad8569fdeab6a9ce99/FLAG8b583dbf8 [2018-12-03 05:58:27,188 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:58:27,189 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-12-03 05:58:27,192 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/data/5e5208f7b/a080737dec9444ad8569fdeab6a9ce99/FLAG8b583dbf8 [2018-12-03 05:58:27,615 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/data/5e5208f7b/a080737dec9444ad8569fdeab6a9ce99 [2018-12-03 05:58:27,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:58:27,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:58:27,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:58:27,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:58:27,622 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:58:27,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462ea3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27, skipping insertion in model container [2018-12-03 05:58:27,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:58:27,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:58:27,725 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:58:27,727 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:58:27,736 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:58:27,744 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:58:27,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27 WrapperNode [2018-12-03 05:58:27,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:58:27,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:58:27,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:58:27,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:58:27,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:58:27,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:58:27,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:58:27,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:58:27,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... [2018-12-03 05:58:27,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:58:27,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:58:27,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:58:27,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:58:27,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:58:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 05:58:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 05:58:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:58:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:58:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 05:58:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 05:58:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-03 05:58:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-03 05:58:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-03 05:58:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-03 05:58:27,921 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:58:27,921 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 05:58:27,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:27 BoogieIcfgContainer [2018-12-03 05:58:27,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:58:27,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:58:27,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:58:27,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:58:27,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:58:27" (1/3) ... [2018-12-03 05:58:27,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32db0d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:27, skipping insertion in model container [2018-12-03 05:58:27,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:27" (2/3) ... [2018-12-03 05:58:27,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32db0d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:27, skipping insertion in model container [2018-12-03 05:58:27,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:27" (3/3) ... [2018-12-03 05:58:27,926 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2018-12-03 05:58:27,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:58:27,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 05:58:27,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 05:58:27,961 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:58:27,961 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:58:27,961 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:58:27,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:58:27,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:58:27,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:58:27,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:58:27,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:58:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-03 05:58:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 05:58:27,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:27,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:27,975 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:27,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-03 05:58:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:28,065 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-03 05:58:28,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:28,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:28,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:28,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:28,079 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-03 05:58:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:28,139 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-03 05:58:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:58:28,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 05:58:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:28,147 INFO L225 Difference]: With dead ends: 44 [2018-12-03 05:58:28,147 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 05:58:28,149 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-03 05:58:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 05:58:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 05:58:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 05:58:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-03 05:58:28,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-03 05:58:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:28,174 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-03 05:58:28,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-03 05:58:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 05:58:28,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:28,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:28,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:28,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-03 05:58:28,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:28,204 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-03 05:58:28,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:28,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:28,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:28,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:28,206 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-03 05:58:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:28,241 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-03 05:58:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:58:28,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 05:58:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:28,243 INFO L225 Difference]: With dead ends: 36 [2018-12-03 05:58:28,243 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 05:58:28,243 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-03 05:58:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 05:58:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-03 05:58:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 05:58:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-03 05:58:28,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-03 05:58:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:28,249 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-03 05:58:28,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-03 05:58:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 05:58:28,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:28,251 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:28,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:28,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:28,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-03 05:58:28,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:28,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:28,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 05:58:28,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:28,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:58:28,301 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 05:58:28,302 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-12-03 05:58:28,321 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:58:28,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:58:28,379 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 05:58:28,380 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-03 05:58:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:28,385 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 05:58:28,411 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-03 05:58:28,411 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 05:58:28,427 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-03 05:58:28,427 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 05:58:28,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:58:28,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-03 05:58:28,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:28,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:58:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:58:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:28,429 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-03 05:58:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:28,552 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-03 05:58:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:58:28,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 05:58:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:28,553 INFO L225 Difference]: With dead ends: 72 [2018-12-03 05:58:28,553 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 05:58:28,553 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:58:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 05:58:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-03 05:58:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 05:58:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-03 05:58:28,558 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-03 05:58:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:28,559 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-03 05:58:28,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:58:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-03 05:58:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 05:58:28,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:28,560 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:28,560 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:28,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-03 05:58:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:28,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:58:28,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:28,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:58:28,609 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-03 05:58:28,609 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-03 05:58:28,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:58:28,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:58:28,833 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 05:58:28,833 INFO L272 AbstractInterpreter]: Visited 28 different actions 896 times. Never merged. Widened at 4 different actions 65 times. Performed 1872 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 95 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-03 05:58:28,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:28,838 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 05:58:28,848 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-03 05:58:28,848 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 05:58:28,882 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-03 05:58:28,882 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 05:58:28,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:58:28,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-03 05:58:28,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:28,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:58:28,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:58:28,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:58:28,883 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-03 05:58:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:29,036 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-03 05:58:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:58:29,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-03 05:58:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:29,038 INFO L225 Difference]: With dead ends: 87 [2018-12-03 05:58:29,038 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 05:58:29,038 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:58:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 05:58:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 05:58:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 05:58:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-03 05:58:29,043 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-03 05:58:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:29,044 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-03 05:58:29,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:58:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-03 05:58:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 05:58:29,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:29,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:29,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:29,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-03 05:58:29,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:29,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:29,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 05:58:29,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:29,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:58:29,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:58:29,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:58:29,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:29,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:58:29,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:58:29,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:58:29,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 05:58:29,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:58:29,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:58:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:58:29,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:58:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 05:58:29,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:58:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-03 05:58:29,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:58:29,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 05:58:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 05:58:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 05:58:29,383 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-03 05:58:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:29,533 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-03 05:58:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:58:29,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-03 05:58:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:29,535 INFO L225 Difference]: With dead ends: 121 [2018-12-03 05:58:29,535 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 05:58:29,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:58:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 05:58:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-03 05:58:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 05:58:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-03 05:58:29,542 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-03 05:58:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:29,543 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-03 05:58:29,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 05:58:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-03 05:58:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 05:58:29,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:29,544 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:29,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:29,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-03 05:58:29,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:29,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:58:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:29,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 05:58:29,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:29,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:58:29,597 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-03 05:58:29,597 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-03 05:58:29,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:58:29,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:58:34,876 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 05:58:34,876 INFO L272 AbstractInterpreter]: Visited 29 different actions 61447 times. Merged at 11 different actions 16389 times. Widened at 4 different actions 3048 times. Performed 145554 root evaluator evaluations with a maximum evaluation depth of 4. Performed 145554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7200 fixpoints after 10 different actions. Largest state had 5 variables. [2018-12-03 05:58:34,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:34,879 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 05:58:34,889 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-12-03 05:58:34,889 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 05:58:34,971 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-03 05:58:34,971 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 05:58:34,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:58:34,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-12-03 05:58:34,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 05:58:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 05:58:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:58:34,972 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-12-03 05:58:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:35,225 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-12-03 05:58:35,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:58:35,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-12-03 05:58:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:35,226 INFO L225 Difference]: With dead ends: 118 [2018-12-03 05:58:35,226 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 05:58:35,227 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-03 05:58:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 05:58:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 05:58:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 05:58:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-12-03 05:58:35,236 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-12-03 05:58:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:35,236 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-12-03 05:58:35,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 05:58:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-12-03 05:58:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 05:58:35,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:35,238 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:35,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:35,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:35,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-12-03 05:58:35,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:35,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:35,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 05:58:35,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:35,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:58:35,287 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-12-03 05:58:35,287 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-03 05:58:35,288 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:58:35,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:58:36,724 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 05:58:36,725 INFO L272 AbstractInterpreter]: Visited 29 different actions 20375 times. Merged at 11 different actions 5233 times. Widened at 3 different actions 1140 times. Performed 47351 root evaluator evaluations with a maximum evaluation depth of 4. Performed 47351 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2539 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-03 05:58:36,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:36,726 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 05:58:36,734 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-12-03 05:58:36,734 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 05:58:36,792 INFO L418 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-12-03 05:58:36,793 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 05:58:36,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:58:36,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-12-03 05:58:36,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:36,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 05:58:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 05:58:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:58:36,793 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-12-03 05:58:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:37,010 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-12-03 05:58:37,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 05:58:37,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-12-03 05:58:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:37,011 INFO L225 Difference]: With dead ends: 141 [2018-12-03 05:58:37,011 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 05:58:37,011 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-03 05:58:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 05:58:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 05:58:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 05:58:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-12-03 05:58:37,017 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-12-03 05:58:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:37,017 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-12-03 05:58:37,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 05:58:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-12-03 05:58:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 05:58:37,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:37,018 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:37,018 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:37,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-12-03 05:58:37,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:37,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:37,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:37,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:37,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-03 05:58:37,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:58:37,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:58:37,085 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-12-03 05:58:37,085 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-03 05:58:37,086 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:58:37,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:01:41,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:01:41,017 INFO L272 AbstractInterpreter]: Visited 34 different actions 2187402 times. Merged at 14 different actions 690652 times. Widened at 4 different actions 72333 times. Performed 5379739 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5379739 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 310049 fixpoints after 10 different actions. Largest state had 5 variables. [2018-12-03 06:01:41,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:41,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:01:41,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:41,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:41,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:41,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:01:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:41,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 23 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 06:01:41,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 23 proven. 97 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 06:01:41,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 21 [2018-12-03 06:01:41,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:41,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 06:01:41,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 06:01:41,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 06:01:41,774 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 14 states. [2018-12-03 06:01:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:41,970 INFO L93 Difference]: Finished difference Result 231 states and 393 transitions. [2018-12-03 06:01:41,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:01:41,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2018-12-03 06:01:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:41,971 INFO L225 Difference]: With dead ends: 231 [2018-12-03 06:01:41,971 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 06:01:41,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 162 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-12-03 06:01:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 06:01:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-12-03 06:01:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 06:01:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-12-03 06:01:41,982 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 94 [2018-12-03 06:01:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:41,983 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-12-03 06:01:41,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 06:01:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-12-03 06:01:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 06:01:41,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:41,984 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 11, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:41,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:41,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -334045017, now seen corresponding path program 1 times [2018-12-03 06:01:41,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:41,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:41,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 99 proven. 184 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-12-03 06:01:42,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:42,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:42,074 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-12-03 06:01:42,074 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-03 06:01:42,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:01:42,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:01:44,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 06:01:44,227 INFO L272 AbstractInterpreter]: Visited 29 different actions 27744 times. Merged at 11 different actions 6710 times. Widened at 4 different actions 1741 times. Performed 67575 root evaluator evaluations with a maximum evaluation depth of 4. Performed 67575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3522 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-03 06:01:44,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:44,229 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 06:01:44,245 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 56.31% of their original sizes. [2018-12-03 06:01:44,245 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 06:01:44,372 INFO L418 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-12-03 06:01:44,372 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 06:01:44,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 06:01:44,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [11] total 33 [2018-12-03 06:01:44,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:44,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:01:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:01:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-12-03 06:01:44,373 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 24 states. [2018-12-03 06:01:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:45,039 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2018-12-03 06:01:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 06:01:45,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-12-03 06:01:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:45,040 INFO L225 Difference]: With dead ends: 223 [2018-12-03 06:01:45,040 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 06:01:45,041 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 06:01:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 06:01:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2018-12-03 06:01:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 06:01:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-12-03 06:01:45,053 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 175 [2018-12-03 06:01:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:45,053 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-12-03 06:01:45,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:01:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-12-03 06:01:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-03 06:01:45,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:45,056 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 13, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:45,056 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:45,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1327733822, now seen corresponding path program 2 times [2018-12-03 06:01:45,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:45,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:45,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:45,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:45,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 286 proven. 12 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-12-03 06:01:45,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:45,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:45,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:01:45,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:01:45,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:45,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:45,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:01:45,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:01:45,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 06:01:45,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:01:45,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 301 proven. 3 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2018-12-03 06:01:45,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2018-12-03 06:01:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2018-12-03 06:01:45,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:45,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:01:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:01:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-03 06:01:45,986 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 16 states. [2018-12-03 06:01:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:46,160 INFO L93 Difference]: Finished difference Result 255 states and 402 transitions. [2018-12-03 06:01:46,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:01:46,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-12-03 06:01:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:46,161 INFO L225 Difference]: With dead ends: 255 [2018-12-03 06:01:46,162 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 06:01:46,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 418 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-12-03 06:01:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 06:01:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2018-12-03 06:01:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 06:01:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2018-12-03 06:01:46,172 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 215 [2018-12-03 06:01:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:46,172 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2018-12-03 06:01:46,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:01:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2018-12-03 06:01:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 06:01:46,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:46,175 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 14, 14, 13, 13, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:46,175 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1669975661, now seen corresponding path program 2 times [2018-12-03 06:01:46,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:46,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:01:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:46,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 133 proven. 291 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-03 06:01:46,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:46,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:46,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:01:46,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:01:46,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:46,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:46,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:01:46,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:01:46,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 06:01:46,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:01:46,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2018-12-03 06:01:46,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 248 proven. 54 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2018-12-03 06:01:46,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:46,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 21 [2018-12-03 06:01:46,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:46,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:01:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:01:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-12-03 06:01:46,742 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand 16 states. [2018-12-03 06:01:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:47,007 INFO L93 Difference]: Finished difference Result 368 states and 644 transitions. [2018-12-03 06:01:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 06:01:47,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 231 [2018-12-03 06:01:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:47,009 INFO L225 Difference]: With dead ends: 368 [2018-12-03 06:01:47,009 INFO L226 Difference]: Without dead ends: 246 [2018-12-03 06:01:47,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 445 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 06:01:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-03 06:01:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 205. [2018-12-03 06:01:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 06:01:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2018-12-03 06:01:47,023 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 317 transitions. Word has length 231 [2018-12-03 06:01:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:47,023 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 317 transitions. [2018-12-03 06:01:47,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:01:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 317 transitions. [2018-12-03 06:01:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-03 06:01:47,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:47,025 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 19, 16, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:47,025 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:47,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash -961831933, now seen corresponding path program 3 times [2018-12-03 06:01:47,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:47,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:01:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:47,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 389 proven. 43 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-12-03 06:01:47,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:47,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:47,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:01:47,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:01:47,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:47,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 06:01:47,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 06:01:47,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 06:01:47,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:01:47,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 112 proven. 699 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2018-12-03 06:01:47,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 112 proven. 732 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2018-12-03 06:01:49,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 19] total 25 [2018-12-03 06:01:49,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:49,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:01:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:01:49,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-12-03 06:01:49,082 INFO L87 Difference]: Start difference. First operand 205 states and 317 transitions. Second operand 16 states. [2018-12-03 06:01:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:49,353 INFO L93 Difference]: Finished difference Result 547 states and 1051 transitions. [2018-12-03 06:01:49,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 06:01:49,353 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 312 [2018-12-03 06:01:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:49,357 INFO L225 Difference]: With dead ends: 547 [2018-12-03 06:01:49,357 INFO L226 Difference]: Without dead ends: 331 [2018-12-03 06:01:49,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 591 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 06:01:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-03 06:01:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 231. [2018-12-03 06:01:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 06:01:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 346 transitions. [2018-12-03 06:01:49,373 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 346 transitions. Word has length 312 [2018-12-03 06:01:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:49,374 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 346 transitions. [2018-12-03 06:01:49,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:01:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 346 transitions. [2018-12-03 06:01:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2018-12-03 06:01:49,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:49,377 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 49, 49, 46, 37, 28, 28, 28, 28, 28, 28, 28, 24, 24, 24, 24, 24, 24, 24, 22, 12, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:49,377 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:49,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash 49838955, now seen corresponding path program 4 times [2018-12-03 06:01:49,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:49,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:49,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:01:49,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:49,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15181 backedges. 714 proven. 866 refuted. 0 times theorem prover too weak. 13601 trivial. 0 not checked. [2018-12-03 06:01:49,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:49,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:49,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:01:49,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:01:49,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:49,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:49,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:01:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:49,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15181 backedges. 398 proven. 1986 refuted. 0 times theorem prover too weak. 12797 trivial. 0 not checked. [2018-12-03 06:01:49,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15181 backedges. 398 proven. 2030 refuted. 0 times theorem prover too weak. 12753 trivial. 0 not checked. [2018-12-03 06:01:52,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 21] total 31 [2018-12-03 06:01:52,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:52,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 06:01:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 06:01:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-12-03 06:01:52,240 INFO L87 Difference]: Start difference. First operand 231 states and 346 transitions. Second operand 22 states. [2018-12-03 06:01:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:52,809 INFO L93 Difference]: Finished difference Result 626 states and 1218 transitions. [2018-12-03 06:01:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 06:01:52,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 720 [2018-12-03 06:01:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:52,812 INFO L225 Difference]: With dead ends: 626 [2018-12-03 06:01:52,813 INFO L226 Difference]: Without dead ends: 364 [2018-12-03 06:01:52,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1478 GetRequests, 1402 SyntacticMatches, 19 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=586, Invalid=2836, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 06:01:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-03 06:01:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 310. [2018-12-03 06:01:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-03 06:01:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 504 transitions. [2018-12-03 06:01:52,833 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 504 transitions. Word has length 720 [2018-12-03 06:01:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:52,833 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 504 transitions. [2018-12-03 06:01:52,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 06:01:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 504 transitions. [2018-12-03 06:01:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2018-12-03 06:01:52,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:52,839 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 63, 57, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 24, 23, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:52,839 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:52,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:52,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1747534985, now seen corresponding path program 5 times [2018-12-03 06:01:52,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:52,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:52,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 35389 backedges. 2467 proven. 1449 refuted. 0 times theorem prover too weak. 31473 trivial. 0 not checked. [2018-12-03 06:01:53,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:53,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:53,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:01:53,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:01:53,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:53,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:01:53,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:01:53,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 06:01:53,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:01:53,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 35389 backedges. 3693 proven. 27 refuted. 0 times theorem prover too weak. 31669 trivial. 0 not checked. [2018-12-03 06:01:53,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 35389 backedges. 2496 proven. 58 refuted. 0 times theorem prover too weak. 32835 trivial. 0 not checked. [2018-12-03 06:01:55,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:55,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 29 [2018-12-03 06:01:55,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:55,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:01:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:01:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2018-12-03 06:01:55,442 INFO L87 Difference]: Start difference. First operand 310 states and 504 transitions. Second operand 24 states. [2018-12-03 06:01:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:55,972 INFO L93 Difference]: Finished difference Result 651 states and 1220 transitions. [2018-12-03 06:01:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 06:01:55,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1093 [2018-12-03 06:01:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:55,976 INFO L225 Difference]: With dead ends: 651 [2018-12-03 06:01:55,976 INFO L226 Difference]: Without dead ends: 357 [2018-12-03 06:01:55,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2227 GetRequests, 2172 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=355, Invalid=1901, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 06:01:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-12-03 06:01:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 339. [2018-12-03 06:01:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 06:01:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 487 transitions. [2018-12-03 06:01:56,006 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 487 transitions. Word has length 1093 [2018-12-03 06:01:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:56,006 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 487 transitions. [2018-12-03 06:01:56,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:01:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 487 transitions. [2018-12-03 06:01:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1152 [2018-12-03 06:01:56,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:56,016 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 82, 82, 67, 63, 43, 43, 43, 43, 43, 43, 43, 41, 41, 41, 41, 41, 41, 41, 26, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:56,016 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:01:56,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash 879626127, now seen corresponding path program 6 times [2018-12-03 06:01:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:56,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:01:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:56,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 39304 backedges. 704 proven. 2062 refuted. 0 times theorem prover too weak. 36538 trivial. 0 not checked. [2018-12-03 06:01:56,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:56,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:56,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:01:56,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:01:56,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:56,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:56,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 06:01:56,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 06:01:56,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 06:01:56,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:01:56,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 39304 backedges. 654 proven. 3284 refuted. 0 times theorem prover too weak. 35366 trivial. 0 not checked. [2018-12-03 06:01:56,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 39304 backedges. 654 proven. 3324 refuted. 0 times theorem prover too weak. 35326 trivial. 0 not checked. [2018-12-03 06:02:00,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:00,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 21] total 27 [2018-12-03 06:02:00,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:00,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 06:02:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 06:02:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-12-03 06:02:00,358 INFO L87 Difference]: Start difference. First operand 339 states and 487 transitions. Second operand 18 states. [2018-12-03 06:02:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:00,724 INFO L93 Difference]: Finished difference Result 868 states and 1615 transitions. [2018-12-03 06:02:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 06:02:00,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1151 [2018-12-03 06:02:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:00,728 INFO L225 Difference]: With dead ends: 868 [2018-12-03 06:02:00,728 INFO L226 Difference]: Without dead ends: 509 [2018-12-03 06:02:00,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2321 GetRequests, 2264 SyntacticMatches, 19 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 06:02:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-03 06:02:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 401. [2018-12-03 06:02:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-12-03 06:02:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 648 transitions. [2018-12-03 06:02:00,754 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 648 transitions. Word has length 1151 [2018-12-03 06:02:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:00,755 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 648 transitions. [2018-12-03 06:02:00,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 06:02:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 648 transitions. [2018-12-03 06:02:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1524 [2018-12-03 06:02:00,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:00,765 INFO L402 BasicCegarLoop]: trace histogram [123, 123, 100, 100, 90, 88, 61, 61, 61, 61, 61, 61, 61, 50, 50, 50, 50, 50, 50, 50, 38, 35, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:00,765 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:00,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 929335044, now seen corresponding path program 7 times [2018-12-03 06:02:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:00,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:00,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 69865 backedges. 1749 proven. 1291 refuted. 0 times theorem prover too weak. 66825 trivial. 0 not checked. [2018-12-03 06:02:01,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:01,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:01,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:01,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:01,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:01,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/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-03 06:02:01,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:01,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:02:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:01,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 69865 backedges. 953 proven. 4628 refuted. 0 times theorem prover too weak. 64284 trivial. 0 not checked. [2018-12-03 06:02:02,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 69865 backedges. 953 proven. 4668 refuted. 0 times theorem prover too weak. 64244 trivial. 0 not checked. [2018-12-03 06:02:05,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:05,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 22] total 31 [2018-12-03 06:02:05,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:05,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 06:02:05,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 06:02:05,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2018-12-03 06:02:05,908 INFO L87 Difference]: Start difference. First operand 401 states and 648 transitions. Second operand 21 states. [2018-12-03 06:02:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:06,329 INFO L93 Difference]: Finished difference Result 930 states and 1861 transitions. [2018-12-03 06:02:06,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:02:06,329 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1523 [2018-12-03 06:02:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:06,332 INFO L225 Difference]: With dead ends: 930 [2018-12-03 06:02:06,332 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 06:02:06,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3066 GetRequests, 3005 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 06:02:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 06:02:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 275. [2018-12-03 06:02:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 06:02:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 373 transitions. [2018-12-03 06:02:06,359 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 373 transitions. Word has length 1523 [2018-12-03 06:02:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:06,359 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 373 transitions. [2018-12-03 06:02:06,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 06:02:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 373 transitions. [2018-12-03 06:02:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-12-03 06:02:06,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:06,367 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 72, 72, 64, 59, 40, 40, 40, 40, 40, 40, 40, 36, 36, 36, 36, 36, 36, 36, 28, 19, 17, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:06,367 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:06,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1320505219, now seen corresponding path program 8 times [2018-12-03 06:02:06,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:06,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:06,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:06,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 32551 backedges. 1043 proven. 2120 refuted. 0 times theorem prover too weak. 29388 trivial. 0 not checked. [2018-12-03 06:02:06,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:06,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:06,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:06,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:06,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:06,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/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-03 06:02:06,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:02:06,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:02:06,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 06:02:06,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:06,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 32551 backedges. 2993 proven. 96 refuted. 0 times theorem prover too weak. 29462 trivial. 0 not checked. [2018-12-03 06:02:07,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32551 backedges. 2993 proven. 99 refuted. 0 times theorem prover too weak. 29459 trivial. 0 not checked. [2018-12-03 06:02:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15] total 25 [2018-12-03 06:02:08,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:08,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 06:02:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 06:02:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-12-03 06:02:08,899 INFO L87 Difference]: Start difference. First operand 275 states and 373 transitions. Second operand 19 states. [2018-12-03 06:02:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:09,266 INFO L93 Difference]: Finished difference Result 593 states and 898 transitions. [2018-12-03 06:02:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 06:02:09,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1048 [2018-12-03 06:02:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:09,268 INFO L225 Difference]: With dead ends: 593 [2018-12-03 06:02:09,268 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 06:02:09,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2132 GetRequests, 2074 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 06:02:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 06:02:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 300. [2018-12-03 06:02:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 06:02:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 421 transitions. [2018-12-03 06:02:09,283 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 421 transitions. Word has length 1048 [2018-12-03 06:02:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:09,284 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 421 transitions. [2018-12-03 06:02:09,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 06:02:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2018-12-03 06:02:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1430 [2018-12-03 06:02:09,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:09,292 INFO L402 BasicCegarLoop]: trace histogram [108, 108, 101, 101, 89, 79, 54, 54, 54, 54, 54, 54, 54, 50, 50, 50, 50, 50, 50, 50, 39, 25, 22, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:09,292 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:09,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash -161243365, now seen corresponding path program 9 times [2018-12-03 06:02:09,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:09,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:09,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 60933 backedges. 812 proven. 4801 refuted. 0 times theorem prover too weak. 55320 trivial. 0 not checked. [2018-12-03 06:02:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:09,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:09,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:09,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:09,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/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-03 06:02:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 06:02:09,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 06:02:10,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 06:02:10,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:10,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 60933 backedges. 743 proven. 3724 refuted. 0 times theorem prover too weak. 56466 trivial. 0 not checked. [2018-12-03 06:02:10,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 60933 backedges. 745 proven. 3755 refuted. 0 times theorem prover too weak. 56433 trivial. 0 not checked. [2018-12-03 06:02:13,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:13,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 19] total 31 [2018-12-03 06:02:13,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:13,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 06:02:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 06:02:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2018-12-03 06:02:13,521 INFO L87 Difference]: Start difference. First operand 300 states and 421 transitions. Second operand 23 states. [2018-12-03 06:02:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:14,212 INFO L93 Difference]: Finished difference Result 752 states and 1279 transitions. [2018-12-03 06:02:14,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 06:02:14,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1429 [2018-12-03 06:02:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:14,214 INFO L225 Difference]: With dead ends: 752 [2018-12-03 06:02:14,214 INFO L226 Difference]: Without dead ends: 474 [2018-12-03 06:02:14,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2907 GetRequests, 2830 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=587, Invalid=3195, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 06:02:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-03 06:02:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 434. [2018-12-03 06:02:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-03 06:02:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 671 transitions. [2018-12-03 06:02:14,238 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 671 transitions. Word has length 1429 [2018-12-03 06:02:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:14,238 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 671 transitions. [2018-12-03 06:02:14,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 06:02:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 671 transitions. [2018-12-03 06:02:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2018-12-03 06:02:14,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:14,246 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 88, 88, 79, 73, 49, 49, 49, 49, 49, 49, 49, 44, 44, 44, 44, 44, 44, 44, 35, 24, 20, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:14,246 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:14,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash -375693212, now seen corresponding path program 10 times [2018-12-03 06:02:14,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:14,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:14,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 48913 backedges. 2447 proven. 963 refuted. 0 times theorem prover too weak. 45503 trivial. 0 not checked. [2018-12-03 06:02:14,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:14,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:14,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:14,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:14,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:14,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/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-03 06:02:14,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:14,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:02:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:14,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 48913 backedges. 925 proven. 3727 refuted. 0 times theorem prover too weak. 44261 trivial. 0 not checked. [2018-12-03 06:02:15,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 48913 backedges. 925 proven. 3767 refuted. 0 times theorem prover too weak. 44221 trivial. 0 not checked. [2018-12-03 06:02:18,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:18,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 22] total 33 [2018-12-03 06:02:18,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:18,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 06:02:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 06:02:18,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 06:02:18,691 INFO L87 Difference]: Start difference. First operand 434 states and 671 transitions. Second operand 23 states. [2018-12-03 06:02:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:19,326 INFO L93 Difference]: Finished difference Result 1074 states and 2018 transitions. [2018-12-03 06:02:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 06:02:19,327 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1281 [2018-12-03 06:02:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:19,336 INFO L225 Difference]: With dead ends: 1074 [2018-12-03 06:02:19,336 INFO L226 Difference]: Without dead ends: 505 [2018-12-03 06:02:19,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2592 GetRequests, 2523 SyntacticMatches, 20 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 06:02:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-03 06:02:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 468. [2018-12-03 06:02:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-12-03 06:02:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 721 transitions. [2018-12-03 06:02:19,380 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 721 transitions. Word has length 1281 [2018-12-03 06:02:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:19,380 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 721 transitions. [2018-12-03 06:02:19,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 06:02:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 721 transitions. [2018-12-03 06:02:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-12-03 06:02:19,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:19,386 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 59, 58, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 23, 22, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:19,386 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:19,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1289727625, now seen corresponding path program 11 times [2018-12-03 06:02:19,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:19,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:19,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29140 backedges. 1614 proven. 1047 refuted. 0 times theorem prover too weak. 26479 trivial. 0 not checked. [2018-12-03 06:02:19,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:19,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:19,747 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:19,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:19,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:19,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/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-03 06:02:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:02:19,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:02:19,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 06:02:19,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:19,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 29140 backedges. 6294 proven. 160 refuted. 0 times theorem prover too weak. 22686 trivial. 0 not checked. [2018-12-03 06:02:20,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29140 backedges. 3001 proven. 344 refuted. 0 times theorem prover too weak. 25795 trivial. 0 not checked. [2018-12-03 06:02:22,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:22,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 17] total 27 [2018-12-03 06:02:22,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 06:02:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 06:02:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2018-12-03 06:02:22,024 INFO L87 Difference]: Start difference. First operand 468 states and 721 transitions. Second operand 20 states. [2018-12-03 06:02:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:22,660 INFO L93 Difference]: Finished difference Result 997 states and 1688 transitions. [2018-12-03 06:02:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 06:02:22,660 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 994 [2018-12-03 06:02:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:22,664 INFO L225 Difference]: With dead ends: 997 [2018-12-03 06:02:22,664 INFO L226 Difference]: Without dead ends: 631 [2018-12-03 06:02:22,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1964 SyntacticMatches, 15 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=480, Invalid=2382, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 06:02:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-12-03 06:02:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 582. [2018-12-03 06:02:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-12-03 06:02:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 915 transitions. [2018-12-03 06:02:22,693 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 915 transitions. Word has length 994 [2018-12-03 06:02:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:22,694 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 915 transitions. [2018-12-03 06:02:22,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 06:02:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 915 transitions. [2018-12-03 06:02:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-12-03 06:02:22,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:22,700 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 75, 75, 62, 61, 39, 39, 39, 39, 39, 39, 39, 37, 37, 37, 37, 37, 37, 37, 25, 22, 16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:22,700 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:22,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -921715605, now seen corresponding path program 12 times [2018-12-03 06:02:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:22,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:22,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 32461 backedges. 2895 proven. 132 refuted. 0 times theorem prover too weak. 29434 trivial. 0 not checked. [2018-12-03 06:02:23,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:23,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:23,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:23,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:23,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:23,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/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-03 06:02:23,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 06:02:23,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 06:02:23,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 06:02:23,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:23,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32461 backedges. 753 proven. 2466 refuted. 0 times theorem prover too weak. 29242 trivial. 0 not checked. [2018-12-03 06:02:23,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 32461 backedges. 755 proven. 2497 refuted. 0 times theorem prover too weak. 29209 trivial. 0 not checked. [2018-12-03 06:02:25,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 19] total 32 [2018-12-03 06:02:25,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:25,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:02:25,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:02:25,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-12-03 06:02:25,827 INFO L87 Difference]: Start difference. First operand 582 states and 915 transitions. Second operand 24 states. [2018-12-03 06:02:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:26,407 INFO L93 Difference]: Finished difference Result 1128 states and 1918 transitions. [2018-12-03 06:02:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 06:02:26,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1048 [2018-12-03 06:02:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:26,410 INFO L225 Difference]: With dead ends: 1128 [2018-12-03 06:02:26,410 INFO L226 Difference]: Without dead ends: 488 [2018-12-03 06:02:26,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 2065 SyntacticMatches, 17 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=594, Invalid=2946, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 06:02:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-03 06:02:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 447. [2018-12-03 06:02:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-03 06:02:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 632 transitions. [2018-12-03 06:02:26,434 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 632 transitions. Word has length 1048 [2018-12-03 06:02:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:26,434 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 632 transitions. [2018-12-03 06:02:26,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:02:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 632 transitions. [2018-12-03 06:02:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-12-03 06:02:26,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:26,440 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 80, 80, 66, 66, 41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 26, 25, 17, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:26,440 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:26,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 212600118, now seen corresponding path program 13 times [2018-12-03 06:02:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:26,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:26,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36942 backedges. 1498 proven. 2503 refuted. 0 times theorem prover too weak. 32941 trivial. 0 not checked. [2018-12-03 06:02:26,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:26,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:26,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:26,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:26,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:26,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:02:26,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:26,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:02:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:27,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36942 backedges. 1035 proven. 1979 refuted. 0 times theorem prover too weak. 33928 trivial. 0 not checked. [2018-12-03 06:02:27,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 36942 backedges. 1039 proven. 1999 refuted. 0 times theorem prover too weak. 33904 trivial. 0 not checked. [2018-12-03 06:02:29,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:29,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 17] total 29 [2018-12-03 06:02:29,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 06:02:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 06:02:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-12-03 06:02:29,329 INFO L87 Difference]: Start difference. First operand 447 states and 632 transitions. Second operand 22 states. [2018-12-03 06:02:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:29,897 INFO L93 Difference]: Finished difference Result 901 states and 1348 transitions. [2018-12-03 06:02:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 06:02:29,897 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1117 [2018-12-03 06:02:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:29,899 INFO L225 Difference]: With dead ends: 901 [2018-12-03 06:02:29,899 INFO L226 Difference]: Without dead ends: 434 [2018-12-03 06:02:29,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2282 GetRequests, 2210 SyntacticMatches, 15 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=539, Invalid=2883, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 06:02:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-03 06:02:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 376. [2018-12-03 06:02:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-03 06:02:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 506 transitions. [2018-12-03 06:02:29,918 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 506 transitions. Word has length 1117 [2018-12-03 06:02:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:29,918 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 506 transitions. [2018-12-03 06:02:29,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 06:02:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 506 transitions. [2018-12-03 06:02:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2018-12-03 06:02:29,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:29,923 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 82, 82, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 27, 25, 17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:29,923 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:29,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash 887266090, now seen corresponding path program 14 times [2018-12-03 06:02:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:29,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:29,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 38777 backedges. 2232 proven. 2049 refuted. 0 times theorem prover too weak. 34496 trivial. 0 not checked. [2018-12-03 06:02:30,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:30,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:30,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:30,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:30,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:30,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:02:30,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:02:30,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:02:30,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 06:02:30,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:30,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 38777 backedges. 3448 proven. 161 refuted. 0 times theorem prover too weak. 35168 trivial. 0 not checked. [2018-12-03 06:02:30,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 38777 backedges. 3448 proven. 167 refuted. 0 times theorem prover too weak. 35162 trivial. 0 not checked. [2018-12-03 06:02:32,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:32,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 30 [2018-12-03 06:02:32,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:32,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 06:02:32,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 06:02:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-12-03 06:02:32,861 INFO L87 Difference]: Start difference. First operand 376 states and 506 transitions. Second operand 23 states. [2018-12-03 06:02:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:33,534 INFO L93 Difference]: Finished difference Result 652 states and 892 transitions. [2018-12-03 06:02:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 06:02:33,534 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1144 [2018-12-03 06:02:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:33,536 INFO L225 Difference]: With dead ends: 652 [2018-12-03 06:02:33,536 INFO L226 Difference]: Without dead ends: 418 [2018-12-03 06:02:33,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2340 GetRequests, 2265 SyntacticMatches, 15 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=583, Invalid=3199, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 06:02:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-12-03 06:02:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 379. [2018-12-03 06:02:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-12-03 06:02:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 504 transitions. [2018-12-03 06:02:33,554 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 504 transitions. Word has length 1144 [2018-12-03 06:02:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:33,555 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 504 transitions. [2018-12-03 06:02:33,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 06:02:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 504 transitions. [2018-12-03 06:02:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-12-03 06:02:33,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:33,559 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 63, 62, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 25, 23, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:33,559 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:33,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash -853989722, now seen corresponding path program 15 times [2018-12-03 06:02:33,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:33,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:33,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33336 backedges. 2977 proven. 976 refuted. 0 times theorem prover too weak. 29383 trivial. 0 not checked. [2018-12-03 06:02:33,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:33,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:33,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:33,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:33,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:33,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:02:33,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 06:02:33,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 06:02:34,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 06:02:34,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:34,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33336 backedges. 1501 proven. 1762 refuted. 0 times theorem prover too weak. 30073 trivial. 0 not checked. [2018-12-03 06:02:34,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33336 backedges. 1505 proven. 1791 refuted. 0 times theorem prover too weak. 30040 trivial. 0 not checked. [2018-12-03 06:02:36,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:36,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 19] total 34 [2018-12-03 06:02:36,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:36,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 06:02:36,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 06:02:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 06:02:36,695 INFO L87 Difference]: Start difference. First operand 379 states and 504 transitions. Second operand 26 states. [2018-12-03 06:02:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:37,490 INFO L93 Difference]: Finished difference Result 712 states and 981 transitions. [2018-12-03 06:02:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 06:02:37,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1062 [2018-12-03 06:02:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:37,493 INFO L225 Difference]: With dead ends: 712 [2018-12-03 06:02:37,493 INFO L226 Difference]: Without dead ends: 432 [2018-12-03 06:02:37,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2183 GetRequests, 2095 SyntacticMatches, 17 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=755, Invalid=4501, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 06:02:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-03 06:02:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 373. [2018-12-03 06:02:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 06:02:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 479 transitions. [2018-12-03 06:02:37,516 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 479 transitions. Word has length 1062 [2018-12-03 06:02:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:37,516 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 479 transitions. [2018-12-03 06:02:37,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 06:02:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 479 transitions. [2018-12-03 06:02:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-12-03 06:02:37,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:37,523 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 80, 79, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 31, 30, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:37,523 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:37,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1359214005, now seen corresponding path program 16 times [2018-12-03 06:02:37,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:37,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:37,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 54065 backedges. 2558 proven. 2838 refuted. 0 times theorem prover too weak. 48669 trivial. 0 not checked. [2018-12-03 06:02:38,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:38,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:38,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:38,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:38,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:38,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:02:38,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:38,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:02:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:38,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 54065 backedges. 2038 proven. 2863 refuted. 0 times theorem prover too weak. 49164 trivial. 0 not checked. [2018-12-03 06:02:38,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 54065 backedges. 2034 proven. 2907 refuted. 0 times theorem prover too weak. 49124 trivial. 0 not checked. [2018-12-03 06:02:42,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:42,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 22] total 34 [2018-12-03 06:02:42,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:42,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:02:42,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:02:42,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 06:02:42,585 INFO L87 Difference]: Start difference. First operand 373 states and 479 transitions. Second operand 24 states. [2018-12-03 06:02:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:43,129 INFO L93 Difference]: Finished difference Result 686 states and 897 transitions. [2018-12-03 06:02:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 06:02:43,130 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1348 [2018-12-03 06:02:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:43,131 INFO L225 Difference]: With dead ends: 686 [2018-12-03 06:02:43,132 INFO L226 Difference]: Without dead ends: 353 [2018-12-03 06:02:43,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2736 GetRequests, 2664 SyntacticMatches, 20 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=477, Invalid=2385, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 06:02:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-12-03 06:02:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 337. [2018-12-03 06:02:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-03 06:02:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 416 transitions. [2018-12-03 06:02:43,151 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 416 transitions. Word has length 1348 [2018-12-03 06:02:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:43,152 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 416 transitions. [2018-12-03 06:02:43,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:02:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 416 transitions. [2018-12-03 06:02:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-12-03 06:02:43,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:43,159 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 76, 75, 47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 46, 29, 29, 19, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:43,159 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:43,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1239423958, now seen corresponding path program 17 times [2018-12-03 06:02:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:43,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:02:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:43,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:02:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 48685 backedges. 4287 proven. 1515 refuted. 0 times theorem prover too weak. 42883 trivial. 0 not checked. [2018-12-03 06:02:43,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:43,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:02:43,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:02:43,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:02:43,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:02:43,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:02:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:02:43,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:02:43,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 06:02:43,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:02:43,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:02:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 48685 backedges. 4357 proven. 491 refuted. 0 times theorem prover too weak. 43837 trivial. 0 not checked. [2018-12-03 06:02:44,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:02:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 48685 backedges. 4359 proven. 504 refuted. 0 times theorem prover too weak. 43822 trivial. 0 not checked. [2018-12-03 06:02:46,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:02:46,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 21] total 35 [2018-12-03 06:02:46,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:02:46,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 06:02:46,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 06:02:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 06:02:46,831 INFO L87 Difference]: Start difference. First operand 337 states and 416 transitions. Second operand 26 states. [2018-12-03 06:02:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:02:47,567 INFO L93 Difference]: Finished difference Result 567 states and 711 transitions. [2018-12-03 06:02:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 06:02:47,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1280 [2018-12-03 06:02:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:02:47,569 INFO L225 Difference]: With dead ends: 567 [2018-12-03 06:02:47,569 INFO L226 Difference]: Without dead ends: 365 [2018-12-03 06:02:47,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2621 GetRequests, 2532 SyntacticMatches, 19 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=732, Invalid=4380, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 06:02:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-12-03 06:02:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 340. [2018-12-03 06:02:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-03 06:02:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 413 transitions. [2018-12-03 06:02:47,586 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 413 transitions. Word has length 1280 [2018-12-03 06:02:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:02:47,586 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 413 transitions. [2018-12-03 06:02:47,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 06:02:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 413 transitions. [2018-12-03 06:02:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-12-03 06:02:47,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:02:47,592 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:02:47,592 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:02:47,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:02:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 18 times [2018-12-03 06:02:47,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:02:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:47,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:02:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:02:47,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:02:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:02:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:02:47,688 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:02:47,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:02:47 BoogieIcfgContainer [2018-12-03 06:02:47,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:02:47,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:02:47,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:02:47,750 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:02:47,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:27" (3/4) ... [2018-12-03 06:02:47,751 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:02:47,828 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9237974c-0da7-4b71-adbf-f2c1eb554f48/bin-2019/utaipan/witness.graphml [2018-12-03 06:02:47,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:02:47,828 INFO L168 Benchmark]: Toolchain (without parser) took 260210.60 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 956.0 MB in the beginning and 5.2 GB in the end (delta: -4.2 GB). Peak memory consumption was 643.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:02:47,829 INFO L168 Benchmark]: CDTParser took 0.14 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-03 06:02:47,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:02:47,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:02:47,829 INFO L168 Benchmark]: Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:02:47,830 INFO L168 Benchmark]: RCFGBuilder took 153.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:02:47,830 INFO L168 Benchmark]: TraceAbstraction took 259827.39 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 612.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:02:47,830 INFO L168 Benchmark]: Witness Printer took 78.30 ms. Allocated memory is still 5.9 GB. Free memory was 5.2 GB in the beginning and 5.2 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2018-12-03 06:02:47,831 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.14 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 125.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 259827.39 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 612.4 MB. Max. memory is 11.5 GB. * Witness Printer took 78.30 ms. Allocated memory is still 5.9 GB. Free memory was 5.2 GB in the beginning and 5.2 GB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 259.7s OverallTime, 27 OverallIterations, 123 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1069 SDtfs, 2304 SDslu, 9417 SDs, 0 SdLazy, 13528 SolverSat, 2491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 35376 GetRequests, 34104 SyntacticMatches, 285 SemanticMatches, 987 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11458 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 193.1s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.8752252252252253 AbsIntWeakeningRatio, 0.5783783783783784 AbsIntAvgWeakeningVarsNumRemoved, 0.1945945945945946 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 852 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 47.4s InterpolantComputationTime, 35898 NumberOfCodeBlocks, 30699 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 51764 ConstructedInterpolants, 0 QuantifiedInterpolants, 66334813 SizeOfPredicates, 157 NumberOfNonLiveVariables, 25975 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 64 InterpolantComputations, 2 PerfectInterpolantSequences, 1662184/1744395 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...