./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_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:42:03,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:42:03,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:42:03,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:42:03,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:42:03,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:42:03,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:42:03,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:42:03,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:42:03,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:42:03,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:42:03,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:42:03,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:42:03,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:42:03,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:42:03,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:42:03,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:42:03,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:42:03,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:42:03,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:42:03,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:42:03,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:42:03,513 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:42:03,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:42:03,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:42:03,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:42:03,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:42:03,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:42:03,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:42:03,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:42:03,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:42:03,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:42:03,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:42:03,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:42:03,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:42:03,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:42:03,520 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:42:03,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:42:03,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:42:03,529 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:42:03,529 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:42:03,529 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:42:03,529 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:42:03,529 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:42:03,529 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:42:03,530 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:42:03,530 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:42:03,530 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:42:03,530 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:42:03,530 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:42:03,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:42:03,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:42:03,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:42:03,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:42:03,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:42:03,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:42:03,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:42:03,532 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:42:03,532 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:42:03,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:42:03,532 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:42:03,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:42:03,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:42:03,533 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:42:03,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:42:03,534 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:42:03,534 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_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:42:03,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:42:03,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:42:03,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:42:03,563 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:42:03,563 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:42:03,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-12-09 09:42:03,599 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/data/2974acd5a/dcc7b42d59b64913b98898645832b2c5/FLAG67e532b91 [2018-12-09 09:42:03,961 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:42:03,962 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/sv-benchmarks/c/recursive-simple/fibo_2calls_10_false-unreach-call.c [2018-12-09 09:42:03,966 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/data/2974acd5a/dcc7b42d59b64913b98898645832b2c5/FLAG67e532b91 [2018-12-09 09:42:04,333 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/data/2974acd5a/dcc7b42d59b64913b98898645832b2c5 [2018-12-09 09:42:04,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:42:04,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:42:04,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:42:04,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:42:04,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:42:04,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ff7dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04, skipping insertion in model container [2018-12-09 09:42:04,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:42:04,354 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:42:04,442 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:42:04,444 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:42:04,453 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:42:04,461 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:42:04,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04 WrapperNode [2018-12-09 09:42:04,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:42:04,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:42:04,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:42:04,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:42:04,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:42:04,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:42:04,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:42:04,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:42:04,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... [2018-12-09 09:42:04,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:42:04,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:42:04,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:42:04,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:42:04,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:42:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:42:04,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:42:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:42:04,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:42:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:42:04,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:42:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-09 09:42:04,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-09 09:42:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-09 09:42:04,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-09 09:42:04,640 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:42:04,640 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 09:42:04,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:42:04 BoogieIcfgContainer [2018-12-09 09:42:04,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:42:04,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:42:04,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:42:04,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:42:04,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:42:04" (1/3) ... [2018-12-09 09:42:04,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ad2c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:42:04, skipping insertion in model container [2018-12-09 09:42:04,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:04" (2/3) ... [2018-12-09 09:42:04,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ad2c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:42:04, skipping insertion in model container [2018-12-09 09:42:04,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:42:04" (3/3) ... [2018-12-09 09:42:04,645 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_false-unreach-call.c [2018-12-09 09:42:04,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:42:04,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:42:04,666 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:42:04,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:42:04,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:42:04,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:42:04,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:42:04,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:42:04,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:42:04,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:42:04,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:42:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 09:42:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 09:42:04,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:04,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:04,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:04,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-09 09:42:04,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:04,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:04,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:04,803 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-09 09:42:04,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:04,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:04,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:04,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:04,816 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-09 09:42:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:04,874 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 09:42:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:04,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 09:42:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:04,881 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:42:04,881 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 09:42:04,883 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-09 09:42:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 09:42:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 09:42:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:42:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 09:42:04,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-09 09:42:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:04,908 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 09:42:04,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 09:42:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 09:42:04,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:04,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:04,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:04,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-09 09:42:04,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:04,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:04,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:04,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:04,930 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-09 09:42:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:04,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:04,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:04,932 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-09 09:42:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:04,971 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 09:42:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:04,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 09:42:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:04,972 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:42:04,972 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 09:42:04,973 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-09 09:42:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 09:42:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 09:42:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 09:42:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 09:42:04,977 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-09 09:42:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:04,978 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 09:42:04,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 09:42:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 09:42:04,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:04,979 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-09 09:42:04,979 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:04,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-09 09:42:04,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:04,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:04,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:05,025 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-09 09:42:05,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:05,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:42:05,026 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 09:42:05,027 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-09 09:42:05,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:42:05,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:42:05,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:42:05,109 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-09 09:42:05,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:05,114 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:42:05,141 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 09:42:05,141 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:42:05,161 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-09 09:42:05,161 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:42:05,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:42:05,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-09 09:42:05,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:05,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:42:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:42:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:42:05,162 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-09 09:42:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:05,275 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-09 09:42:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:42:05,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 09:42:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:05,276 INFO L225 Difference]: With dead ends: 72 [2018-12-09 09:42:05,276 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 09:42:05,276 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-09 09:42:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 09:42:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-09 09:42:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 09:42:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 09:42:05,281 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-09 09:42:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:05,282 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 09:42:05,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:42:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 09:42:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 09:42:05,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:05,283 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-09 09:42:05,283 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:05,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-09 09:42:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:05,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:05,333 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-09 09:42:05,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:05,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:42:05,333 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-09 09:42:05,333 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-09 09:42:05,334 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:42:05,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:42:05,538 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:42:05,538 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-09 09:42:05,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:05,541 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:42:05,550 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 09:42:05,550 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:42:05,571 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-09 09:42:05,571 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:42:05,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:42:05,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 09:42:05,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:05,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:42:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:42:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:42:05,572 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-09 09:42:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:05,728 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-09 09:42:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:42:05,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-09 09:42:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:05,729 INFO L225 Difference]: With dead ends: 87 [2018-12-09 09:42:05,729 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 09:42:05,730 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-09 09:42:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 09:42:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-09 09:42:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 09:42:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-09 09:42:05,738 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-09 09:42:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:05,738 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-09 09:42:05,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:42:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-09 09:42:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 09:42:05,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:05,740 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-09 09:42:05,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:05,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-09 09:42:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:05,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:05,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:05,791 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-09 09:42:05,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:05,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:42:05,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:42:05,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:42:05,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:05,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:42:05,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:42:05,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:42:05,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:42:05,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:42:05,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:42:05,892 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-09 09:42:05,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:42:06,091 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-09 09:42:06,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:42:06,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-09 09:42:06,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:42:06,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:42:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:42:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:42:06,107 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-09 09:42:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:06,262 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-09 09:42:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:42:06,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-09 09:42:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:06,264 INFO L225 Difference]: With dead ends: 121 [2018-12-09 09:42:06,264 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 09:42:06,264 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-09 09:42:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 09:42:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-09 09:42:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 09:42:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-09 09:42:06,271 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-09 09:42:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:06,272 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-09 09:42:06,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:42:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-09 09:42:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 09:42:06,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:06,273 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-09 09:42:06,273 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:06,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-09 09:42:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:06,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:42:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:06,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:06,317 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-09 09:42:06,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:06,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:42:06,317 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-09 09:42:06,317 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-09 09:42:06,319 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:42:06,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:42:11,754 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:42:11,755 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-09 09:42:11,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:11,757 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:42:11,766 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-12-09 09:42:11,766 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:42:11,819 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-09 09:42:11,819 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:42:11,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:42:11,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-12-09 09:42:11,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:11,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:42:11,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:42:11,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:42:11,820 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-12-09 09:42:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:12,039 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-12-09 09:42:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:42:12,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-12-09 09:42:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:12,040 INFO L225 Difference]: With dead ends: 118 [2018-12-09 09:42:12,040 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 09:42:12,041 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 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-09 09:42:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 09:42:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-09 09:42:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 09:42:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-12-09 09:42:12,049 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-12-09 09:42:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:12,049 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-12-09 09:42:12,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:42:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-12-09 09:42:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 09:42:12,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:12,052 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-09 09:42:12,052 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:12,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-12-09 09:42:12,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:12,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:12,101 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-09 09:42:12,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:12,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:42:12,101 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-12-09 09:42:12,102 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-09 09:42:12,102 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:42:12,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:42:13,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:42:13,568 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-09 09:42:13,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:13,570 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:42:13,577 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 09:42:13,577 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:42:13,629 INFO L418 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-12-09 09:42:13,629 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:42:13,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:42:13,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-12-09 09:42:13,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:13,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:42:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:42:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:42:13,630 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-12-09 09:42:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:13,855 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-12-09 09:42:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:42:13,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-12-09 09:42:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:13,856 INFO L225 Difference]: With dead ends: 141 [2018-12-09 09:42:13,856 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 09:42:13,857 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-09 09:42:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 09:42:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-09 09:42:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 09:42:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-12-09 09:42:13,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-12-09 09:42:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-12-09 09:42:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:42:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-12-09 09:42:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:42:13,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:13,863 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-09 09:42:13,864 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:13,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-12-09 09:42:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:13,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:13,896 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-09 09:42:13,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:42:13,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:42:13,897 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-12-09 09:42:13,897 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-09 09:42:13,897 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:42:13,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:45:49,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:45:49,205 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-09 09:45:49,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:49,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:45:49,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:49,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:45:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:49,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:45:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:49,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:49,331 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-09 09:45:49,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:45:49,939 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-09 09:45:49,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:45:49,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 21 [2018-12-09 09:45:49,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:45:49,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:45:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:45:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-09 09:45:49,954 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 14 states. [2018-12-09 09:45:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:50,153 INFO L93 Difference]: Finished difference Result 231 states and 393 transitions. [2018-12-09 09:45:50,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:45:50,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2018-12-09 09:45:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:50,155 INFO L225 Difference]: With dead ends: 231 [2018-12-09 09:45:50,155 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 09:45:50,156 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-09 09:45:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 09:45:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-12-09 09:45:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 09:45:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-12-09 09:45:50,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 94 [2018-12-09 09:45:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:50,166 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-12-09 09:45:50,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:45:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-12-09 09:45:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 09:45:50,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:50,168 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-09 09:45:50,168 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:45:50,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash -334045017, now seen corresponding path program 1 times [2018-12-09 09:45:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:45:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:50,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:50,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:45:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:50,255 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-09 09:45:50,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:50,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:45:50,256 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-12-09 09:45:50,256 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-09 09:45:50,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:45:50,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:45:52,274 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 09:45:52,274 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-09 09:45:52,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:52,275 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 09:45:52,290 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 56.31% of their original sizes. [2018-12-09 09:45:52,291 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 09:45:52,420 INFO L418 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-12-09 09:45:52,420 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 09:45:52,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 09:45:52,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [11] total 33 [2018-12-09 09:45:52,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:45:52,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:45:52,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:45:52,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-12-09 09:45:52,421 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 24 states. [2018-12-09 09:45:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:53,083 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2018-12-09 09:45:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 09:45:53,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-12-09 09:45:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:53,084 INFO L225 Difference]: With dead ends: 223 [2018-12-09 09:45:53,084 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 09:45:53,084 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-09 09:45:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 09:45:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2018-12-09 09:45:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-09 09:45:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-12-09 09:45:53,094 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 175 [2018-12-09 09:45:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:53,094 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-12-09 09:45:53,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:45:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-12-09 09:45:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 09:45:53,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:53,096 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-09 09:45:53,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:45:53,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1327733822, now seen corresponding path program 2 times [2018-12-09 09:45:53,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:45:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:53,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:53,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:45:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:53,197 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-09 09:45:53,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:53,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:45:53,197 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:45:53,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:45:53,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:53,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:45:53,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:45:53,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:45:53,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 09:45:53,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:45:53,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:53,281 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-09 09:45:53,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:45:53,568 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-09 09:45:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:45:53,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2018-12-09 09:45:53,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:45:53,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 09:45:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 09:45:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:45:53,585 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 16 states. [2018-12-09 09:45:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:53,742 INFO L93 Difference]: Finished difference Result 255 states and 402 transitions. [2018-12-09 09:45:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:45:53,742 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-12-09 09:45:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:53,744 INFO L225 Difference]: With dead ends: 255 [2018-12-09 09:45:53,744 INFO L226 Difference]: Without dead ends: 152 [2018-12-09 09:45:53,744 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-09 09:45:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-09 09:45:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2018-12-09 09:45:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 09:45:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 199 transitions. [2018-12-09 09:45:53,753 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 199 transitions. Word has length 215 [2018-12-09 09:45:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:53,753 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 199 transitions. [2018-12-09 09:45:53,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 09:45:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 199 transitions. [2018-12-09 09:45:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-12-09 09:45:53,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:53,755 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:53,755 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:45:53,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1584661804, now seen corresponding path program 2 times [2018-12-09 09:45:53,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:45:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:53,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:45:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:53,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:45:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 137 proven. 322 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2018-12-09 09:45:53,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:53,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:45:53,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:45:53,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:45:53,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:53,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:45:53,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:45:53,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:45:53,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 09:45:53,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:45:53,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 433 proven. 37 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-12-09 09:45:53,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:45:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 433 proven. 38 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2018-12-09 09:45:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:45:54,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 23 [2018-12-09 09:45:54,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:45:54,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 09:45:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 09:45:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-12-09 09:45:54,472 INFO L87 Difference]: Start difference. First operand 140 states and 199 transitions. Second operand 18 states. [2018-12-09 09:45:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:54,827 INFO L93 Difference]: Finished difference Result 330 states and 563 transitions. [2018-12-09 09:45:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:45:54,827 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 245 [2018-12-09 09:45:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:54,829 INFO L225 Difference]: With dead ends: 330 [2018-12-09 09:45:54,829 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 09:45:54,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 469 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 09:45:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 09:45:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2018-12-09 09:45:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-09 09:45:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 258 transitions. [2018-12-09 09:45:54,843 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 258 transitions. Word has length 245 [2018-12-09 09:45:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:54,843 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 258 transitions. [2018-12-09 09:45:54,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 09:45:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 258 transitions. [2018-12-09 09:45:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-09 09:45:54,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:54,845 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 16, 16, 14, 13, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:54,845 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:45:54,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -207855780, now seen corresponding path program 2 times [2018-12-09 09:45:54,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:45:54,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:54,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:45:54,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:54,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:45:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 138 proven. 263 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2018-12-09 09:45:54,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:54,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:45:54,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:45:54,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:45:54,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:54,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:45:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:45:54,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:45:54,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 09:45:54,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:45:54,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 267 proven. 52 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2018-12-09 09:45:55,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:45:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 269 proven. 55 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-09 09:45:55,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:45:55,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2018-12-09 09:45:55,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:45:55,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 09:45:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 09:45:55,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-12-09 09:45:55,482 INFO L87 Difference]: Start difference. First operand 186 states and 258 transitions. Second operand 15 states. [2018-12-09 09:45:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:55,698 INFO L93 Difference]: Finished difference Result 414 states and 664 transitions. [2018-12-09 09:45:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:45:55,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 244 [2018-12-09 09:45:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:55,701 INFO L225 Difference]: With dead ends: 414 [2018-12-09 09:45:55,701 INFO L226 Difference]: Without dead ends: 251 [2018-12-09 09:45:55,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 470 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2018-12-09 09:45:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-09 09:45:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 203. [2018-12-09 09:45:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-09 09:45:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 295 transitions. [2018-12-09 09:45:55,721 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 295 transitions. Word has length 244 [2018-12-09 09:45:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:55,721 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 295 transitions. [2018-12-09 09:45:55,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 09:45:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 295 transitions. [2018-12-09 09:45:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-12-09 09:45:55,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:55,724 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 27, 27, 27, 24, 17, 17, 17, 17, 17, 17, 17, 14, 13, 13, 13, 13, 13, 13, 13, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:55,725 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:45:55,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash 634163973, now seen corresponding path program 3 times [2018-12-09 09:45:55,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:45:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:55,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:45:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:55,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:45:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 333 proven. 327 refuted. 0 times theorem prover too weak. 4471 trivial. 0 not checked. [2018-12-09 09:45:55,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:55,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:45:55,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:45:55,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:45:55,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:55,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:45:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:45:55,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:45:55,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:45:55,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:45:55,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 145 proven. 1042 refuted. 0 times theorem prover too weak. 3944 trivial. 0 not checked. [2018-12-09 09:45:56,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:45:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 145 proven. 1075 refuted. 0 times theorem prover too weak. 3911 trivial. 0 not checked. [2018-12-09 09:45:57,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:45:57,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 19] total 25 [2018-12-09 09:45:57,483 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:45:57,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 09:45:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 09:45:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-12-09 09:45:57,484 INFO L87 Difference]: Start difference. First operand 203 states and 295 transitions. Second operand 16 states. [2018-12-09 09:45:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:57,752 INFO L93 Difference]: Finished difference Result 549 states and 1039 transitions. [2018-12-09 09:45:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 09:45:57,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 424 [2018-12-09 09:45:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:57,755 INFO L225 Difference]: With dead ends: 549 [2018-12-09 09:45:57,755 INFO L226 Difference]: Without dead ends: 334 [2018-12-09 09:45:57,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 815 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 09:45:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-09 09:45:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 229. [2018-12-09 09:45:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-09 09:45:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 344 transitions. [2018-12-09 09:45:57,780 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 344 transitions. Word has length 424 [2018-12-09 09:45:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:57,780 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 344 transitions. [2018-12-09 09:45:57,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 09:45:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 344 transitions. [2018-12-09 09:45:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-09 09:45:57,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:57,784 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 28, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 12, 9, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:57,784 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:45:57,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1821894950, now seen corresponding path program 4 times [2018-12-09 09:45:57,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:45:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:57,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:45:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:57,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:45:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 307 proven. 1000 refuted. 0 times theorem prover too weak. 4776 trivial. 0 not checked. [2018-12-09 09:45:57,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:57,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:45:57,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:45:57,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:45:57,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:57,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:45:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:57,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:45:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:58,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 203 proven. 1246 refuted. 0 times theorem prover too weak. 4634 trivial. 0 not checked. [2018-12-09 09:45:58,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6083 backedges. 203 proven. 1290 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2018-12-09 09:46:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 32 [2018-12-09 09:46:00,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 09:46:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 09:46:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2018-12-09 09:46:00,041 INFO L87 Difference]: Start difference. First operand 229 states and 344 transitions. Second operand 23 states. [2018-12-09 09:46:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:00,966 INFO L93 Difference]: Finished difference Result 697 states and 1387 transitions. [2018-12-09 09:46:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-09 09:46:00,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 463 [2018-12-09 09:46:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:00,969 INFO L225 Difference]: With dead ends: 697 [2018-12-09 09:46:00,970 INFO L226 Difference]: Without dead ends: 429 [2018-12-09 09:46:00,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 891 SyntacticMatches, 19 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=3382, Unknown=0, NotChecked=0, Total=4032 [2018-12-09 09:46:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-12-09 09:46:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 393. [2018-12-09 09:46:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-09 09:46:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 680 transitions. [2018-12-09 09:46:00,994 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 680 transitions. Word has length 463 [2018-12-09 09:46:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:00,994 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 680 transitions. [2018-12-09 09:46:00,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 09:46:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 680 transitions. [2018-12-09 09:46:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1638 [2018-12-09 09:46:01,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,006 INFO L402 BasicCegarLoop]: trace histogram [136, 136, 103, 103, 100, 96, 68, 68, 68, 68, 68, 68, 68, 51, 51, 51, 51, 51, 51, 51, 49, 36, 28, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,006 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:01,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -150931136, now seen corresponding path program 5 times [2018-12-09 09:46:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 81454 backedges. 872 proven. 3756 refuted. 0 times theorem prover too weak. 76826 trivial. 0 not checked. [2018-12-09 09:46:01,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:01,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:01,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:01,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:01,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:01,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:01,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:46:01,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:46:01,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-09 09:46:01,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:01,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 81454 backedges. 16932 proven. 7 refuted. 0 times theorem prover too weak. 64515 trivial. 0 not checked. [2018-12-09 09:46:02,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 81454 backedges. 3212 proven. 264 refuted. 0 times theorem prover too weak. 77978 trivial. 0 not checked. [2018-12-09 09:46:05,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:05,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2018-12-09 09:46:05,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:05,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:46:05,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:46:05,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:46:05,240 INFO L87 Difference]: Start difference. First operand 393 states and 680 transitions. Second operand 13 states. [2018-12-09 09:46:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:05,398 INFO L93 Difference]: Finished difference Result 748 states and 1392 transitions. [2018-12-09 09:46:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:46:05,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1637 [2018-12-09 09:46:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:05,400 INFO L225 Difference]: With dead ends: 748 [2018-12-09 09:46:05,400 INFO L226 Difference]: Without dead ends: 382 [2018-12-09 09:46:05,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3289 GetRequests, 3263 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-12-09 09:46:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-09 09:46:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 370. [2018-12-09 09:46:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-12-09 09:46:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 613 transitions. [2018-12-09 09:46:05,420 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 613 transitions. Word has length 1637 [2018-12-09 09:46:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:05,420 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 613 transitions. [2018-12-09 09:46:05,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:46:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 613 transitions. [2018-12-09 09:46:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2018-12-09 09:46:05,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:05,424 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 43, 38, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 18, 13, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:05,425 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:05,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash -400181699, now seen corresponding path program 6 times [2018-12-09 09:46:05,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:05,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:05,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14006 backedges. 1209 proven. 669 refuted. 0 times theorem prover too weak. 12128 trivial. 0 not checked. [2018-12-09 09:46:05,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:05,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:05,669 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:05,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:05,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:05,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:05,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:46:05,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:46:05,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:46:05,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:05,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14006 backedges. 488 proven. 1571 refuted. 0 times theorem prover too weak. 11947 trivial. 0 not checked. [2018-12-09 09:46:05,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14006 backedges. 490 proven. 1602 refuted. 0 times theorem prover too weak. 11914 trivial. 0 not checked. [2018-12-09 09:46:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:07,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 30 [2018-12-09 09:46:07,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:07,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 09:46:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 09:46:07,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-12-09 09:46:07,694 INFO L87 Difference]: Start difference. First operand 370 states and 613 transitions. Second operand 22 states. [2018-12-09 09:46:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:08,338 INFO L93 Difference]: Finished difference Result 1029 states and 2171 transitions. [2018-12-09 09:46:08,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 09:46:08,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 694 [2018-12-09 09:46:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:08,345 INFO L225 Difference]: With dead ends: 1029 [2018-12-09 09:46:08,345 INFO L226 Difference]: Without dead ends: 646 [2018-12-09 09:46:08,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1357 SyntacticMatches, 17 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=564, Invalid=2858, Unknown=0, NotChecked=0, Total=3422 [2018-12-09 09:46:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-09 09:46:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 587. [2018-12-09 09:46:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-09 09:46:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1059 transitions. [2018-12-09 09:46:08,404 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1059 transitions. Word has length 694 [2018-12-09 09:46:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:08,404 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 1059 transitions. [2018-12-09 09:46:08,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 09:46:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1059 transitions. [2018-12-09 09:46:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1240 [2018-12-09 09:46:08,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:08,415 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 88, 88, 74, 72, 46, 46, 46, 46, 46, 46, 46, 44, 44, 44, 44, 44, 44, 44, 30, 26, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:08,415 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:08,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash 572700317, now seen corresponding path program 7 times [2018-12-09 09:46:08,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:08,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:08,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 45605 backedges. 3406 proven. 1083 refuted. 0 times theorem prover too weak. 41116 trivial. 0 not checked. [2018-12-09 09:46:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:08,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:08,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:08,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:08,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:08,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:08,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:08,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:46:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:09,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 45605 backedges. 837 proven. 2998 refuted. 0 times theorem prover too weak. 41770 trivial. 0 not checked. [2018-12-09 09:46:09,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 45605 backedges. 839 proven. 3029 refuted. 0 times theorem prover too weak. 41737 trivial. 0 not checked. [2018-12-09 09:46:12,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:12,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 19] total 36 [2018-12-09 09:46:12,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:12,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 09:46:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 09:46:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 09:46:12,206 INFO L87 Difference]: Start difference. First operand 587 states and 1059 transitions. Second operand 28 states. [2018-12-09 09:46:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:13,140 INFO L93 Difference]: Finished difference Result 1016 states and 1954 transitions. [2018-12-09 09:46:13,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-09 09:46:13,140 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1239 [2018-12-09 09:46:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:13,143 INFO L225 Difference]: With dead ends: 1016 [2018-12-09 09:46:13,143 INFO L226 Difference]: Without dead ends: 428 [2018-12-09 09:46:13,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2539 GetRequests, 2449 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=4808, Unknown=0, NotChecked=0, Total=5550 [2018-12-09 09:46:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-09 09:46:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 355. [2018-12-09 09:46:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-09 09:46:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 509 transitions. [2018-12-09 09:46:13,177 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 509 transitions. Word has length 1239 [2018-12-09 09:46:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:13,178 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 509 transitions. [2018-12-09 09:46:13,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 09:46:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 509 transitions. [2018-12-09 09:46:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1895 [2018-12-09 09:46:13,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:13,201 INFO L402 BasicCegarLoop]: trace histogram [141, 141, 136, 136, 113, 112, 70, 70, 70, 70, 70, 70, 70, 68, 68, 68, 68, 68, 68, 68, 45, 42, 28, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:13,202 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:13,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1302886199, now seen corresponding path program 8 times [2018-12-09 09:46:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:13,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 107516 backedges. 2189 proven. 5530 refuted. 0 times theorem prover too weak. 99797 trivial. 0 not checked. [2018-12-09 09:46:14,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:14,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:14,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:14,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:14,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:14,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:46:14,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:46:14,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-09 09:46:14,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:14,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 107516 backedges. 15586 proven. 63 refuted. 0 times theorem prover too weak. 91867 trivial. 0 not checked. [2018-12-09 09:46:15,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 107516 backedges. 4740 proven. 280 refuted. 0 times theorem prover too weak. 102496 trivial. 0 not checked. [2018-12-09 09:46:18,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:18,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 25 [2018-12-09 09:46:18,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:18,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 09:46:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 09:46:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-12-09 09:46:18,476 INFO L87 Difference]: Start difference. First operand 355 states and 509 transitions. Second operand 20 states. [2018-12-09 09:46:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:18,801 INFO L93 Difference]: Finished difference Result 743 states and 1177 transitions. [2018-12-09 09:46:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 09:46:18,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1894 [2018-12-09 09:46:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:18,804 INFO L225 Difference]: With dead ends: 743 [2018-12-09 09:46:18,804 INFO L226 Difference]: Without dead ends: 418 [2018-12-09 09:46:18,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3823 GetRequests, 3772 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 09:46:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-12-09 09:46:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2018-12-09 09:46:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-09 09:46:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 545 transitions. [2018-12-09 09:46:18,836 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 545 transitions. Word has length 1894 [2018-12-09 09:46:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:18,837 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 545 transitions. [2018-12-09 09:46:18,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 09:46:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 545 transitions. [2018-12-09 09:46:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1553 [2018-12-09 09:46:18,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:18,849 INFO L402 BasicCegarLoop]: trace histogram [115, 115, 112, 112, 92, 91, 57, 57, 57, 57, 57, 57, 57, 56, 56, 56, 56, 56, 56, 56, 36, 34, 23, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:18,850 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:18,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash 604465564, now seen corresponding path program 9 times [2018-12-09 09:46:18,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:18,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:18,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:18,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:18,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 71909 backedges. 1491 proven. 4259 refuted. 0 times theorem prover too weak. 66159 trivial. 0 not checked. [2018-12-09 09:46:19,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:19,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:19,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:19,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:19,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:19,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:19,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:46:19,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:46:19,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:46:19,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:19,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 71909 backedges. 1278 proven. 4407 refuted. 0 times theorem prover too weak. 66224 trivial. 0 not checked. [2018-12-09 09:46:20,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 71909 backedges. 1276 proven. 4449 refuted. 0 times theorem prover too weak. 66184 trivial. 0 not checked. [2018-12-09 09:46:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:24,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 22] total 34 [2018-12-09 09:46:24,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:46:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:46:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 09:46:24,136 INFO L87 Difference]: Start difference. First operand 384 states and 545 transitions. Second operand 24 states. [2018-12-09 09:46:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:24,841 INFO L93 Difference]: Finished difference Result 988 states and 1739 transitions. [2018-12-09 09:46:24,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-09 09:46:24,841 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1552 [2018-12-09 09:46:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:24,844 INFO L225 Difference]: With dead ends: 988 [2018-12-09 09:46:24,844 INFO L226 Difference]: Without dead ends: 346 [2018-12-09 09:46:24,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3143 GetRequests, 3068 SyntacticMatches, 20 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=2677, Unknown=0, NotChecked=0, Total=3192 [2018-12-09 09:46:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-09 09:46:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 307. [2018-12-09 09:46:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-09 09:46:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 398 transitions. [2018-12-09 09:46:24,861 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 398 transitions. Word has length 1552 [2018-12-09 09:46:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:24,861 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 398 transitions. [2018-12-09 09:46:24,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:46:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 398 transitions. [2018-12-09 09:46:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-12-09 09:46:24,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:24,868 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 85, 85, 71, 70, 45, 45, 45, 45, 45, 45, 45, 42, 42, 42, 42, 42, 42, 42, 29, 25, 19, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:24,868 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:24,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 445208966, now seen corresponding path program 10 times [2018-12-09 09:46:24,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:24,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:24,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 42604 backedges. 2301 proven. 2202 refuted. 0 times theorem prover too weak. 38101 trivial. 0 not checked. [2018-12-09 09:46:25,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:25,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:25,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:25,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:25,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:25,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:25,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:25,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:46:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:25,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 42604 backedges. 1623 proven. 1608 refuted. 0 times theorem prover too weak. 39373 trivial. 0 not checked. [2018-12-09 09:46:25,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 42604 backedges. 1629 proven. 1626 refuted. 0 times theorem prover too weak. 39349 trivial. 0 not checked. [2018-12-09 09:46:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:28,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 31 [2018-12-09 09:46:28,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:28,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:46:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:46:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2018-12-09 09:46:28,459 INFO L87 Difference]: Start difference. First operand 307 states and 398 transitions. Second operand 24 states. [2018-12-09 09:46:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:29,226 INFO L93 Difference]: Finished difference Result 735 states and 1034 transitions. [2018-12-09 09:46:29,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-09 09:46:29,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1198 [2018-12-09 09:46:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:29,229 INFO L225 Difference]: With dead ends: 735 [2018-12-09 09:46:29,229 INFO L226 Difference]: Without dead ends: 439 [2018-12-09 09:46:29,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2454 GetRequests, 2372 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=679, Invalid=4013, Unknown=0, NotChecked=0, Total=4692 [2018-12-09 09:46:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-09 09:46:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 365. [2018-12-09 09:46:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-09 09:46:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 490 transitions. [2018-12-09 09:46:29,259 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 490 transitions. Word has length 1198 [2018-12-09 09:46:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:29,259 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 490 transitions. [2018-12-09 09:46:29,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:46:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 490 transitions. [2018-12-09 09:46:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1091 [2018-12-09 09:46:29,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:29,269 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 74, 74, 66, 63, 42, 42, 42, 42, 42, 42, 42, 37, 37, 37, 37, 37, 37, 37, 29, 21, 19, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:29,269 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:29,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1020170876, now seen corresponding path program 11 times [2018-12-09 09:46:29,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:29,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:29,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 35290 backedges. 1948 proven. 1003 refuted. 0 times theorem prover too weak. 32339 trivial. 0 not checked. [2018-12-09 09:46:29,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:29,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:29,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:29,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:29,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:29,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:29,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:46:29,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:46:29,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-09 09:46:29,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:29,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 35290 backedges. 3266 proven. 161 refuted. 0 times theorem prover too weak. 31863 trivial. 0 not checked. [2018-12-09 09:46:30,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 35290 backedges. 3266 proven. 167 refuted. 0 times theorem prover too weak. 31857 trivial. 0 not checked. [2018-12-09 09:46:32,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:32,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 17] total 28 [2018-12-09 09:46:32,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:32,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 09:46:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 09:46:32,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-12-09 09:46:32,073 INFO L87 Difference]: Start difference. First operand 365 states and 490 transitions. Second operand 21 states. [2018-12-09 09:46:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:32,649 INFO L93 Difference]: Finished difference Result 756 states and 1056 transitions. [2018-12-09 09:46:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 09:46:32,649 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1090 [2018-12-09 09:46:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:32,651 INFO L225 Difference]: With dead ends: 756 [2018-12-09 09:46:32,651 INFO L226 Difference]: Without dead ends: 440 [2018-12-09 09:46:32,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2223 GetRequests, 2155 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=2478, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 09:46:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-09 09:46:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 399. [2018-12-09 09:46:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 09:46:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 534 transitions. [2018-12-09 09:46:32,671 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 534 transitions. Word has length 1090 [2018-12-09 09:46:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:32,671 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 534 transitions. [2018-12-09 09:46:32,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 09:46:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 534 transitions. [2018-12-09 09:46:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-12-09 09:46:32,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:32,678 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 91, 91, 76, 75, 48, 48, 48, 48, 48, 48, 48, 45, 45, 45, 45, 45, 45, 45, 30, 28, 21, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:32,678 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:32,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash -809986380, now seen corresponding path program 12 times [2018-12-09 09:46:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:32,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:32,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 48717 backedges. 2931 proven. 2882 refuted. 0 times theorem prover too weak. 42904 trivial. 0 not checked. [2018-12-09 09:46:33,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:33,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:33,255 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:33,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:33,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:33,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:33,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 09:46:33,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 09:46:33,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 09:46:33,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:33,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 48717 backedges. 2129 proven. 2017 refuted. 0 times theorem prover too weak. 44571 trivial. 0 not checked. [2018-12-09 09:46:33,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 48717 backedges. 2128 proven. 2048 refuted. 0 times theorem prover too weak. 44541 trivial. 0 not checked. [2018-12-09 09:46:36,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:36,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 20] total 34 [2018-12-09 09:46:36,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:36,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 09:46:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 09:46:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 09:46:36,722 INFO L87 Difference]: Start difference. First operand 399 states and 534 transitions. Second operand 25 states. [2018-12-09 09:46:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:37,381 INFO L93 Difference]: Finished difference Result 804 states and 1101 transitions. [2018-12-09 09:46:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 09:46:37,382 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1280 [2018-12-09 09:46:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:37,384 INFO L225 Difference]: With dead ends: 804 [2018-12-09 09:46:37,384 INFO L226 Difference]: Without dead ends: 439 [2018-12-09 09:46:37,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2613 GetRequests, 2534 SyntacticMatches, 18 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=593, Invalid=3313, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 09:46:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-09 09:46:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 399. [2018-12-09 09:46:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 09:46:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 518 transitions. [2018-12-09 09:46:37,403 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 518 transitions. Word has length 1280 [2018-12-09 09:46:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:37,404 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 518 transitions. [2018-12-09 09:46:37,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 09:46:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 518 transitions. [2018-12-09 09:46:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2018-12-09 09:46:37,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:37,410 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 90, 90, 75, 73, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 30, 27, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:37,411 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:37,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2087766652, now seen corresponding path program 13 times [2018-12-09 09:46:37,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:37,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:37,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 46635 backedges. 1054 proven. 4702 refuted. 0 times theorem prover too weak. 40879 trivial. 0 not checked. [2018-12-09 09:46:37,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:37,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:37,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:37,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:37,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:37,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:37,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:46:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:38,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 46635 backedges. 1052 proven. 2831 refuted. 0 times theorem prover too weak. 42752 trivial. 0 not checked. [2018-12-09 09:46:38,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 46635 backedges. 1056 proven. 2860 refuted. 0 times theorem prover too weak. 42719 trivial. 0 not checked. [2018-12-09 09:46:41,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:41,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 19] total 34 [2018-12-09 09:46:41,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 09:46:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 09:46:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 09:46:41,134 INFO L87 Difference]: Start difference. First operand 399 states and 518 transitions. Second operand 26 states. [2018-12-09 09:46:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:42,028 INFO L93 Difference]: Finished difference Result 716 states and 948 transitions. [2018-12-09 09:46:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-09 09:46:42,029 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1253 [2018-12-09 09:46:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:42,030 INFO L225 Difference]: With dead ends: 716 [2018-12-09 09:46:42,030 INFO L226 Difference]: Without dead ends: 423 [2018-12-09 09:46:42,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2572 GetRequests, 2481 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=810, Invalid=4890, Unknown=0, NotChecked=0, Total=5700 [2018-12-09 09:46:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-09 09:46:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 358. [2018-12-09 09:46:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-12-09 09:46:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 445 transitions. [2018-12-09 09:46:42,049 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 445 transitions. Word has length 1253 [2018-12-09 09:46:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:42,050 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 445 transitions. [2018-12-09 09:46:42,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 09:46:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 445 transitions. [2018-12-09 09:46:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2018-12-09 09:46:42,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:42,055 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 26, 26, 17, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:42,056 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:42,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash 980558134, now seen corresponding path program 14 times [2018-12-09 09:46:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:42,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:42,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4072 proven. 821 refuted. 0 times theorem prover too weak. 33876 trivial. 0 not checked. [2018-12-09 09:46:42,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:42,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:46:42,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:46:42,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:46:42,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:42,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/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-09 09:46:42,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:46:42,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:46:42,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-09 09:46:42,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:46:42,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 3168 proven. 249 refuted. 0 times theorem prover too weak. 35352 trivial. 0 not checked. [2018-12-09 09:46:42,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:46:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 3168 proven. 257 refuted. 0 times theorem prover too weak. 35344 trivial. 0 not checked. [2018-12-09 09:46:44,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:46:44,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 17] total 31 [2018-12-09 09:46:44,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:46:44,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 09:46:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 09:46:44,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-12-09 09:46:44,858 INFO L87 Difference]: Start difference. First operand 358 states and 445 transitions. Second operand 24 states. [2018-12-09 09:46:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:45,413 INFO L93 Difference]: Finished difference Result 617 states and 779 transitions. [2018-12-09 09:46:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 09:46:45,413 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1144 [2018-12-09 09:46:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:45,415 INFO L225 Difference]: With dead ends: 617 [2018-12-09 09:46:45,415 INFO L226 Difference]: Without dead ends: 345 [2018-12-09 09:46:45,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2337 GetRequests, 2268 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=2615, Unknown=0, NotChecked=0, Total=3080 [2018-12-09 09:46:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-12-09 09:46:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 324. [2018-12-09 09:46:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-09 09:46:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 393 transitions. [2018-12-09 09:46:45,431 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 393 transitions. Word has length 1144 [2018-12-09 09:46:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:45,432 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 393 transitions. [2018-12-09 09:46:45,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 09:46:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 393 transitions. [2018-12-09 09:46:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-12-09 09:46:45,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:45,438 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-09 09:46:45,438 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:46:45,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 15 times [2018-12-09 09:46:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:45,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:45,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:46:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:45,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:46:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:46:45,527 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:46:45,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:46:45 BoogieIcfgContainer [2018-12-09 09:46:45,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:46:45,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:46:45,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:46:45,583 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:46:45,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:42:04" (3/4) ... [2018-12-09 09:46:45,585 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:46:45,668 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e4be281b-d203-4b28-baa3-fb8b74a201c7/bin-2019/utaipan/witness.graphml [2018-12-09 09:46:45,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:46:45,669 INFO L168 Benchmark]: Toolchain (without parser) took 281333.58 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.1 GB). Free memory was 957.6 MB in the beginning and 6.1 GB in the end (delta: -5.1 GB). Peak memory consumption was 921.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:45,670 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:46:45,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:45,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.00 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:46:45,670 INFO L168 Benchmark]: Boogie Preprocessor took 13.17 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:46:45,670 INFO L168 Benchmark]: RCFGBuilder took 152.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.1 MB). Free memory was 946.8 MB in the beginning and 1.0 GB in the end (delta: -101.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:45,670 INFO L168 Benchmark]: TraceAbstraction took 280941.94 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: -5.1 GB). Peak memory consumption was 900.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:45,671 INFO L168 Benchmark]: Witness Printer took 85.29 ms. Allocated memory is still 7.1 GB. Free memory was 6.1 GB in the beginning and 6.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:45,672 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 124.64 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.00 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.17 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 152.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.1 MB). Free memory was 946.8 MB in the beginning and 1.0 GB in the end (delta: -101.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 280941.94 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: -5.1 GB). Peak memory consumption was 900.7 MB. Max. memory is 11.5 GB. * Witness Printer took 85.29 ms. Allocated memory is still 7.1 GB. Free memory was 6.1 GB in the beginning and 6.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 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, 280.9s OverallTime, 25 OverallIterations, 141 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 963 SDtfs, 2159 SDslu, 8567 SDs, 0 SdLazy, 12203 SolverSat, 2329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 30481 GetRequests, 29367 SyntacticMatches, 232 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10784 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=587occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 224.5s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.8752252252252253 AbsIntWeakeningRatio, 0.5783783783783784 AbsIntAvgWeakeningVarsNumRemoved, 0.1945945945945946 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 772 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 38.5s InterpolantComputationTime, 31050 NumberOfCodeBlocks, 25386 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 44498 ConstructedInterpolants, 0 QuantifiedInterpolants, 61330742 SizeOfPredicates, 130 NumberOfNonLiveVariables, 19680 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 58 InterpolantComputations, 2 PerfectInterpolantSequences, 1579733/1646346 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...