./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:43:48,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:43:48,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:43:48,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:43:48,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:43:48,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:43:48,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:43:48,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:43:48,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:43:48,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:43:48,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:43:48,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:43:48,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:43:48,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:43:48,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:43:48,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:43:48,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:43:48,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:43:48,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:43:48,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:43:48,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:43:48,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:43:48,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:43:48,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:43:48,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:43:48,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:43:48,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:43:48,527 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:43:48,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:43:48,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:43:48,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:43:48,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:43:48,529 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:43:48,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:43:48,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:43:48,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:43:48,530 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:43:48,540 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:43:48,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:43:48,541 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:43:48,541 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:43:48,541 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:43:48,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:43:48,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:43:48,541 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:43:48,541 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:43:48,541 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:43:48,542 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:43:48,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:43:48,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:43:48,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:43:48,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:43:48,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:43:48,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:43:48,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:43:48,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:43:48,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:43:48,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:43:48,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:43:48,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:43:48,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:43:48,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:43:48,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:43:48,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:43:48,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:43:48,545 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_bda95ec9-4e85-4539-9181-01adb0366365/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 -> 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 [2018-11-10 10:43:48,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:43:48,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:43:48,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:43:48,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:43:48,581 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:43:48,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 10:43:48,627 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/data/c4bf4c24b/c9dcfd964dff49a49eb9dc50a5cedc22/FLAG7cfdfbf52 [2018-11-10 10:43:49,021 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:43:49,021 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 10:43:49,026 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/data/c4bf4c24b/c9dcfd964dff49a49eb9dc50a5cedc22/FLAG7cfdfbf52 [2018-11-10 10:43:49,036 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/data/c4bf4c24b/c9dcfd964dff49a49eb9dc50a5cedc22 [2018-11-10 10:43:49,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:43:49,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:43:49,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:43:49,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:43:49,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:43:49,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf997ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49, skipping insertion in model container [2018-11-10 10:43:49,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:43:49,062 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:43:49,152 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:43:49,154 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:43:49,165 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:43:49,172 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:43:49,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49 WrapperNode [2018-11-10 10:43:49,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:43:49,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:43:49,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:43:49,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:43:49,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:43:49,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:43:49,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:43:49,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:43:49,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... [2018-11-10 10:43:49,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:43:49,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:43:49,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:43:49,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:43:49,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:43:49,263 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-10 10:43:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-10 10:43:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:43:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:43:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:43:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:43:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:43:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:43:49,358 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:43:49,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:43:49 BoogieIcfgContainer [2018-11-10 10:43:49,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:43:49,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:43:49,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:43:49,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:43:49,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:43:49" (1/3) ... [2018-11-10 10:43:49,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c488cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:43:49, skipping insertion in model container [2018-11-10 10:43:49,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:49" (2/3) ... [2018-11-10 10:43:49,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c488cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:43:49, skipping insertion in model container [2018-11-10 10:43:49,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:43:49" (3/3) ... [2018-11-10 10:43:49,364 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 10:43:49,373 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:43:49,378 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:43:49,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:43:49,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:43:49,409 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:43:49,409 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:43:49,409 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:43:49,409 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:43:49,409 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:43:49,409 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:43:49,410 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:43:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-10 10:43:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 10:43:49,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:49,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:49,427 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:49,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2018-11-10 10:43:49,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:49,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:49,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:49,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:49,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:49,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:49,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:43:49,538 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:43:49,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:43:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:43:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:49,550 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-10 10:43:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:49,639 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-10 10:43:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:43:49,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 10:43:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:49,648 INFO L225 Difference]: With dead ends: 36 [2018-11-10 10:43:49,648 INFO L226 Difference]: Without dead ends: 22 [2018-11-10 10:43:49,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:43:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-10 10:43:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 10:43:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 10:43:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 10:43:49,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2018-11-10 10:43:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:49,681 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 10:43:49,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:43:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-10 10:43:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 10:43:49,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:49,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:49,683 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:49,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash -509871596, now seen corresponding path program 1 times [2018-11-10 10:43:49,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:49,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:49,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:49,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:49,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:43:49,741 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:43:49,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:43:49,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:43:49,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:49,743 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2018-11-10 10:43:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:49,809 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 10:43:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:43:49,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-10 10:43:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:49,810 INFO L225 Difference]: With dead ends: 28 [2018-11-10 10:43:49,810 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 10:43:49,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:43:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 10:43:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-10 10:43:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 10:43:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 10:43:49,817 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2018-11-10 10:43:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:49,818 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 10:43:49,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:43:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-10 10:43:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:43:49,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:49,819 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:49,819 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:49,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2018-11-10 10:43:49,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:49,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:43:49,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:49,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:49,877 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-10 10:43:49,878 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2018-11-10 10:43:49,913 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:43:49,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:43:50,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:43:50,018 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 10:43:50,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:50,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:43:50,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:50,023 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:50,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:50,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:43:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:50,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:43:50,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 10:43:50,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:50,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-11-10 10:43:50,265 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:50,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:43:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:43:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:43:50,266 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2018-11-10 10:43:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:50,335 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-11-10 10:43:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:50,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-10 10:43:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:50,336 INFO L225 Difference]: With dead ends: 39 [2018-11-10 10:43:50,336 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 10:43:50,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:43:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 10:43:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 10:43:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 10:43:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 10:43:50,341 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2018-11-10 10:43:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:50,341 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 10:43:50,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:43:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-10 10:43:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:43:50,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:50,343 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:50,343 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:50,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2018-11-10 10:43:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:50,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:43:50,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:50,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:50,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-10 10:43:50,396 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2018-11-10 10:43:50,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:43:50,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:43:52,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:43:52,245 INFO L272 AbstractInterpreter]: Visited 23 different actions 6847 times. Merged at 10 different actions 1830 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-10 10:43:52,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:52,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:43:52,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:52,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:52,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:52,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:43:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:52,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:43:52,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 10:43:52,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:52,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-11-10 10:43:52,453 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:52,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:43:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:43:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:52,454 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-11-10 10:43:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:52,495 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-10 10:43:52,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:43:52,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-10 10:43:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:52,497 INFO L225 Difference]: With dead ends: 33 [2018-11-10 10:43:52,497 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 10:43:52,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:43:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 10:43:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 10:43:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 10:43:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-10 10:43:52,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2018-11-10 10:43:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:52,503 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-10 10:43:52,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:43:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-11-10 10:43:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 10:43:52,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:52,504 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:52,505 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:52,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2018-11-10 10:43:52,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:52,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:52,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 10:43:52,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:52,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:52,578 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:52,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:52,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:52,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:43:52,593 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:43:52,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 10:43:52,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:43:52,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 10:43:52,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 10:43:52,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:52,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-11-10 10:43:52,824 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:52,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:43:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:43:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:52,825 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 6 states. [2018-11-10 10:43:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:52,886 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-10 10:43:52,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:43:52,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-10 10:43:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:52,888 INFO L225 Difference]: With dead ends: 39 [2018-11-10 10:43:52,888 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 10:43:52,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:43:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 10:43:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-10 10:43:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 10:43:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-10 10:43:52,893 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 41 [2018-11-10 10:43:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:52,894 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-10 10:43:52,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:43:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-11-10 10:43:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:43:52,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:52,895 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:52,895 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:52,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2018-11-10 10:43:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:52,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:52,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 10:43:52,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:52,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:52,939 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:52,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:52,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:52,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:52,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:43:52,953 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 10:43:52,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:43:52,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:43:52,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 10:43:52,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:43:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-11-10 10:43:53,189 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:53,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:53,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:43:53,190 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2018-11-10 10:43:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:53,250 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2018-11-10 10:43:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:53,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-10 10:43:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:53,252 INFO L225 Difference]: With dead ends: 41 [2018-11-10 10:43:53,252 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 10:43:53,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:43:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 10:43:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-10 10:43:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 10:43:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2018-11-10 10:43:53,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 42 [2018-11-10 10:43:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:53,257 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-11-10 10:43:53,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2018-11-10 10:43:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 10:43:53,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:53,259 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:53,259 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:53,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1539529542, now seen corresponding path program 4 times [2018-11-10 10:43:53,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:53,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:53,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:53,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 47 proven. 43 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-10 10:43:53,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:53,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:53,351 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:53,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:53,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:53,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:53,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:53,358 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:43:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:53,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-10 10:43:53,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 99 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 10:43:53,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:53,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 20 [2018-11-10 10:43:53,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:53,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:43:53,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:43:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:43:53,727 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 14 states. [2018-11-10 10:43:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:53,984 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2018-11-10 10:43:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:43:53,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-11-10 10:43:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:53,986 INFO L225 Difference]: With dead ends: 80 [2018-11-10 10:43:53,986 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 10:43:53,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 10:43:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 10:43:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-10 10:43:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 10:43:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-10 10:43:53,992 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 68 [2018-11-10 10:43:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:53,993 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-10 10:43:53,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:43:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-11-10 10:43:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:43:53,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:53,994 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:53,995 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:53,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash 946234379, now seen corresponding path program 5 times [2018-11-10 10:43:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:53,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:53,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:53,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-10 10:43:54,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:54,097 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:54,098 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:54,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:54,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:54,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:54,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:43:54,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:43:54,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 10:43:54,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:43:54,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-10 10:43:54,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-11-10 10:43:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2018-11-10 10:43:54,370 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:54,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:43:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:43:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:43:54,371 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 8 states. [2018-11-10 10:43:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:54,428 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-11-10 10:43:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:43:54,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-11-10 10:43:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:54,429 INFO L225 Difference]: With dead ends: 56 [2018-11-10 10:43:54,429 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 10:43:54,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-11-10 10:43:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 10:43:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-10 10:43:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 10:43:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-10 10:43:54,434 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 110 [2018-11-10 10:43:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:54,434 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-10 10:43:54,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:43:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-11-10 10:43:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 10:43:54,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:54,436 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:54,436 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:54,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash 551748881, now seen corresponding path program 6 times [2018-11-10 10:43:54,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:54,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:54,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-11-10 10:43:54,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:54,522 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:54,522 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:54,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:54,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:54,522 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:54,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:43:54,537 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 10:43:54,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:43:54,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:43:54,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-11-10 10:43:54,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-11-10 10:43:55,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:55,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 23 [2018-11-10 10:43:55,235 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:55,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:43:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:43:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:43:55,236 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 15 states. [2018-11-10 10:43:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:55,468 INFO L93 Difference]: Finished difference Result 112 states and 178 transitions. [2018-11-10 10:43:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 10:43:55,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-11-10 10:43:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:55,469 INFO L225 Difference]: With dead ends: 112 [2018-11-10 10:43:55,469 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 10:43:55,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 10:43:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 10:43:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-10 10:43:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 10:43:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-11-10 10:43:55,477 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 137 [2018-11-10 10:43:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:55,477 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-11-10 10:43:55,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:43:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-11-10 10:43:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 10:43:55,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:55,480 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:55,480 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:55,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash 375112636, now seen corresponding path program 7 times [2018-11-10 10:43:55,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:55,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:55,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-11-10 10:43:55,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:55,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:55,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:55,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:55,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:55,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:55,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:55,589 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:43:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2018-11-10 10:43:55,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2018-11-10 10:43:56,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:56,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 15] total 18 [2018-11-10 10:43:56,357 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:56,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:43:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:43:56,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:43:56,358 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 10 states. [2018-11-10 10:43:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:56,441 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-11-10 10:43:56,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:43:56,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2018-11-10 10:43:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:56,443 INFO L225 Difference]: With dead ends: 72 [2018-11-10 10:43:56,443 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 10:43:56,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 339 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:43:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 10:43:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 10:43:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 10:43:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2018-11-10 10:43:56,450 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 178 [2018-11-10 10:43:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:56,451 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2018-11-10 10:43:56,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:43:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2018-11-10 10:43:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-10 10:43:56,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:56,455 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:56,455 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:56,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1514478897, now seen corresponding path program 8 times [2018-11-10 10:43:56,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:56,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:56,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:56,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:56,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 851 proven. 284 refuted. 0 times theorem prover too weak. 4904 trivial. 0 not checked. [2018-11-10 10:43:56,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:56,599 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:56,599 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:56,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:56,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:56,599 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:43:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:43:56,608 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:43:56,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-10 10:43:56,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:43:56,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 751 proven. 156 refuted. 0 times theorem prover too weak. 5132 trivial. 0 not checked. [2018-11-10 10:43:56,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 751 proven. 177 refuted. 0 times theorem prover too weak. 5111 trivial. 0 not checked. [2018-11-10 10:43:57,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 15 [2018-11-10 10:43:57,241 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:57,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:43:57,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:43:57,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:43:57,242 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 9 states. [2018-11-10 10:43:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:57,310 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2018-11-10 10:43:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:43:57,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 328 [2018-11-10 10:43:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:57,312 INFO L225 Difference]: With dead ends: 80 [2018-11-10 10:43:57,312 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 10:43:57,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 648 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:43:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 10:43:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-11-10 10:43:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 10:43:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2018-11-10 10:43:57,317 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 328 [2018-11-10 10:43:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:57,318 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2018-11-10 10:43:57,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:43:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2018-11-10 10:43:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-10 10:43:57,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:57,324 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 47, 29, 29, 29, 29, 29, 29, 29, 18, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:57,324 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:57,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -584906351, now seen corresponding path program 9 times [2018-11-10 10:43:57,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:57,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:57,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 849 proven. 1096 refuted. 0 times theorem prover too weak. 7604 trivial. 0 not checked. [2018-11-10 10:43:57,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:57,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:57,530 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:57,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:57,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:57,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:43:57,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:43:57,538 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 10:43:57,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:43:57,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:43:57,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 5240 proven. 712 refuted. 0 times theorem prover too weak. 3597 trivial. 0 not checked. [2018-11-10 10:43:57,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:43:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 609 proven. 2319 refuted. 0 times theorem prover too weak. 6621 trivial. 0 not checked. [2018-11-10 10:43:59,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:43:59,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 22] total 29 [2018-11-10 10:43:59,339 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:43:59,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:43:59,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:43:59,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:43:59,341 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 19 states. [2018-11-10 10:43:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:59,664 INFO L93 Difference]: Finished difference Result 151 states and 250 transitions. [2018-11-10 10:43:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 10:43:59,664 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 409 [2018-11-10 10:43:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:59,665 INFO L225 Difference]: With dead ends: 151 [2018-11-10 10:43:59,665 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 10:43:59,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 785 SyntacticMatches, 20 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1749, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 10:43:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 10:43:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2018-11-10 10:43:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 10:43:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2018-11-10 10:43:59,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 409 [2018-11-10 10:43:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:59,676 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2018-11-10 10:43:59,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:43:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2018-11-10 10:43:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-11-10 10:43:59,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:59,677 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:59,678 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:59,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:59,678 INFO L82 PathProgramCache]: Analyzing trace with hash 521950619, now seen corresponding path program 10 times [2018-11-10 10:43:59,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:43:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:59,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:59,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:43:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 248 proven. 1232 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2018-11-10 10:43:59,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:59,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:43:59,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:43:59,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:43:59,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:59,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:43:59,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:59,841 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:43:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:59,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2018-11-10 10:43:59,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2018-11-10 10:44:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:01,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 17] total 20 [2018-11-10 10:44:01,014 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:01,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:44:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:44:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:44:01,015 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand 11 states. [2018-11-10 10:44:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:01,109 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2018-11-10 10:44:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:44:01,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 355 [2018-11-10 10:44:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:01,111 INFO L225 Difference]: With dead ends: 92 [2018-11-10 10:44:01,111 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 10:44:01,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 693 SyntacticMatches, 13 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2018-11-10 10:44:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 10:44:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-11-10 10:44:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 10:44:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2018-11-10 10:44:01,118 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 355 [2018-11-10 10:44:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:01,119 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2018-11-10 10:44:01,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:44:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2018-11-10 10:44:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-11-10 10:44:01,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:01,121 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:01,121 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:01,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1808456943, now seen corresponding path program 11 times [2018-11-10 10:44:01,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:44:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:01,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:01,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:44:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 440 proven. 2503 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2018-11-10 10:44:01,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:01,363 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:44:01,364 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:44:01,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:44:01,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:01,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:44:01,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:44:01,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:44:01,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-11-10 10:44:01,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:44:01,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2018-11-10 10:44:01,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 3019 refuted. 0 times theorem prover too weak. 15683 trivial. 0 not checked. [2018-11-10 10:44:03,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:03,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 19] total 20 [2018-11-10 10:44:03,183 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:03,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:44:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:44:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:44:03,184 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 12 states. [2018-11-10 10:44:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:03,293 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2018-11-10 10:44:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:44:03,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 573 [2018-11-10 10:44:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:03,295 INFO L225 Difference]: With dead ends: 94 [2018-11-10 10:44:03,295 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 10:44:03,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 1127 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2018-11-10 10:44:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 10:44:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-10 10:44:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 10:44:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 135 transitions. [2018-11-10 10:44:03,303 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 135 transitions. Word has length 573 [2018-11-10 10:44:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:03,304 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 135 transitions. [2018-11-10 10:44:03,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:44:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 135 transitions. [2018-11-10 10:44:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2018-11-10 10:44:03,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:03,311 INFO L375 BasicCegarLoop]: trace histogram [171, 171, 138, 85, 85, 85, 85, 85, 85, 85, 53, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:03,311 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:03,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash -552562187, now seen corresponding path program 12 times [2018-11-10 10:44:03,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:44:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:03,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:03,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:03,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:44:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 1852 proven. 8883 refuted. 0 times theorem prover too weak. 71138 trivial. 0 not checked. [2018-11-10 10:44:03,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:03,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:44:03,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:44:03,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:44:03,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:03,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:44:03,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:44:03,927 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 10:44:04,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:44:04,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:44:04,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 35578 proven. 1793 refuted. 0 times theorem prover too weak. 44502 trivial. 0 not checked. [2018-11-10 10:44:04,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 81873 backedges. 1794 proven. 9877 refuted. 0 times theorem prover too weak. 70202 trivial. 0 not checked. [2018-11-10 10:44:07,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:07,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 26] total 32 [2018-11-10 10:44:07,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:07,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 10:44:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 10:44:07,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2018-11-10 10:44:07,683 INFO L87 Difference]: Start difference. First operand 90 states and 135 transitions. Second operand 20 states. [2018-11-10 10:44:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:08,133 INFO L93 Difference]: Finished difference Result 196 states and 364 transitions. [2018-11-10 10:44:08,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 10:44:08,134 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1172 [2018-11-10 10:44:08,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:08,136 INFO L225 Difference]: With dead ends: 196 [2018-11-10 10:44:08,136 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 10:44:08,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2393 GetRequests, 2314 SyntacticMatches, 24 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 10:44:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 10:44:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2018-11-10 10:44:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 10:44:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2018-11-10 10:44:08,146 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 1172 [2018-11-10 10:44:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:08,148 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2018-11-10 10:44:08,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 10:44:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2018-11-10 10:44:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-11-10 10:44:08,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:08,154 INFO L375 BasicCegarLoop]: trace histogram [145, 145, 117, 72, 72, 72, 72, 72, 72, 72, 45, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:08,154 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:08,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1102024734, now seen corresponding path program 13 times [2018-11-10 10:44:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:44:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:08,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:08,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:44:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 3548 proven. 4287 refuted. 0 times theorem prover too weak. 50935 trivial. 0 not checked. [2018-11-10 10:44:08,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:08,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:44:08,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:44:08,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:44:08,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:08,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:44:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:08,646 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:44:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:08,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 30234 proven. 3857 refuted. 0 times theorem prover too weak. 24679 trivial. 0 not checked. [2018-11-10 10:44:09,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 2453 proven. 8373 refuted. 0 times theorem prover too weak. 47944 trivial. 0 not checked. [2018-11-10 10:44:12,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:12,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 30] total 37 [2018-11-10 10:44:12,365 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:12,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 10:44:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 10:44:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 10:44:12,367 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand 23 states. [2018-11-10 10:44:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:12,900 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-10 10:44:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 10:44:12,901 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 995 [2018-11-10 10:44:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:12,903 INFO L225 Difference]: With dead ends: 224 [2018-11-10 10:44:12,903 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 10:44:12,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2040 GetRequests, 1947 SyntacticMatches, 28 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1071, Invalid=3351, Unknown=0, NotChecked=0, Total=4422 [2018-11-10 10:44:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 10:44:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2018-11-10 10:44:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 10:44:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2018-11-10 10:44:12,912 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 995 [2018-11-10 10:44:12,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:12,912 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2018-11-10 10:44:12,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 10:44:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2018-11-10 10:44:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2018-11-10 10:44:12,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:12,921 INFO L375 BasicCegarLoop]: trace histogram [157, 157, 127, 78, 78, 78, 78, 78, 78, 78, 49, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:12,921 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:12,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 856745370, now seen corresponding path program 14 times [2018-11-10 10:44:12,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:44:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:12,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:44:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 6672 proven. 3475 refuted. 0 times theorem prover too weak. 58850 trivial. 0 not checked. [2018-11-10 10:44:13,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:13,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:44:13,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:44:13,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:44:13,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:13,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:44:13,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:44:13,478 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 10:44:13,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-11-10 10:44:13,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:44:13,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 26398 proven. 503 refuted. 0 times theorem prover too weak. 42096 trivial. 0 not checked. [2018-11-10 10:44:14,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 5653 proven. 1789 refuted. 0 times theorem prover too weak. 61555 trivial. 0 not checked. [2018-11-10 10:44:16,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:16,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 26 [2018-11-10 10:44:16,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:16,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:44:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:44:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-11-10 10:44:16,271 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand 19 states. [2018-11-10 10:44:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:16,654 INFO L93 Difference]: Finished difference Result 243 states and 378 transitions. [2018-11-10 10:44:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 10:44:16,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1077 [2018-11-10 10:44:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:16,656 INFO L225 Difference]: With dead ends: 243 [2018-11-10 10:44:16,657 INFO L226 Difference]: Without dead ends: 136 [2018-11-10 10:44:16,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2199 GetRequests, 2139 SyntacticMatches, 15 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=559, Invalid=1603, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 10:44:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-10 10:44:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2018-11-10 10:44:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 10:44:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2018-11-10 10:44:16,666 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 1077 [2018-11-10 10:44:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:16,666 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2018-11-10 10:44:16,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:44:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2018-11-10 10:44:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-11-10 10:44:16,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:16,672 INFO L375 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:16,673 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:16,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash -622714639, now seen corresponding path program 15 times [2018-11-10 10:44:16,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:44:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:16,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:16,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:44:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3648 proven. 6545 refuted. 0 times theorem prover too weak. 40717 trivial. 0 not checked. [2018-11-10 10:44:17,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:17,260 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:44:17,261 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:44:17,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:44:17,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:17,261 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:44:17,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:44:17,286 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 10:44:17,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:44:17,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:44:17,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3566 proven. 7262 refuted. 0 times theorem prover too weak. 40082 trivial. 0 not checked. [2018-11-10 10:44:17,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3560 proven. 7396 refuted. 0 times theorem prover too weak. 39954 trivial. 0 not checked. [2018-11-10 10:44:21,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:21,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 34] total 40 [2018-11-10 10:44:21,154 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:21,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 10:44:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 10:44:21,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 10:44:21,155 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand 24 states. [2018-11-10 10:44:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:21,760 INFO L93 Difference]: Finished difference Result 233 states and 386 transitions. [2018-11-10 10:44:21,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 10:44:21,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 927 [2018-11-10 10:44:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:21,762 INFO L225 Difference]: With dead ends: 233 [2018-11-10 10:44:21,762 INFO L226 Difference]: Without dead ends: 137 [2018-11-10 10:44:21,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1921 GetRequests, 1816 SyntacticMatches, 32 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1341, Invalid=4209, Unknown=0, NotChecked=0, Total=5550 [2018-11-10 10:44:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-10 10:44:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2018-11-10 10:44:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 10:44:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2018-11-10 10:44:21,770 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 927 [2018-11-10 10:44:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:21,771 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2018-11-10 10:44:21,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 10:44:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2018-11-10 10:44:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2018-11-10 10:44:21,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:21,775 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:21,775 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:21,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1020040988, now seen corresponding path program 16 times [2018-11-10 10:44:21,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:44:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:21,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:44:21,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:21,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:44:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-11-10 10:44:22,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:22,350 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:44:22,350 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 10:44:22,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 10:44:22,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:22,350 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/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-11-10 10:44:22,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:22,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:44:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:22,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-11-10 10:44:22,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:44:24,412 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:24,625 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:24,842 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:25,058 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:26,522 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-11-10 10:44:27,055 WARN L179 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-11-10 10:44:27,590 WARN L179 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-11-10 10:44:28,121 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-11-10 10:44:29,001 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 10:44:29,105 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 10:44:29,780 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:29,995 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:30,216 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:30,436 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:31,775 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 491 [2018-11-10 10:44:33,112 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 491 [2018-11-10 10:44:34,449 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 493 [2018-11-10 10:44:35,782 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 493 [2018-11-10 10:44:37,470 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:37,680 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:37,897 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:38,112 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:42,750 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:42,963 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:43,181 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:43,399 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:44,271 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 10:44:44,400 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 10:44:44,922 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-11-10 10:44:45,444 WARN L179 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-11-10 10:44:45,974 WARN L179 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-11-10 10:44:46,502 WARN L179 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-11-10 10:44:50,332 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:50,542 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-10 10:44:50,757 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:50,972 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-11-10 10:44:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-11-10 10:44:54,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:44:54,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2018-11-10 10:44:54,261 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:44:54,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 10:44:54,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 10:44:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 10:44:54,263 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand 36 states. [2018-11-10 10:44:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:54,340 INFO L93 Difference]: Finished difference Result 131 states and 187 transitions. [2018-11-10 10:44:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 10:44:54,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 750 [2018-11-10 10:44:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:54,341 INFO L225 Difference]: With dead ends: 131 [2018-11-10 10:44:54,341 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:44:54,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1468 SyntacticMatches, 218 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5500 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 10:44:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:44:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:44:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:44:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:44:54,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 750 [2018-11-10 10:44:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:54,342 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:44:54,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 10:44:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:44:54,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:44:54,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:44:54,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:54,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:54,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:54,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:54,759 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 45 [2018-11-10 10:44:54,761 INFO L425 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-11-10 10:44:54,761 INFO L428 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-11-10 10:44:54,761 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (<= 2 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) [2018-11-10 10:44:54,761 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 10:44:54,761 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (let ((.cse0 (<= |fibonacci_#in~n| fibonacci_~n))) (or (and (<= 21 |fibonacci_#t~ret0|) .cse0) (< |fibonacci_#in~n| 4) (and (<= |fibonacci_#in~n| 8) (<= 13 |fibonacci_#t~ret0|) .cse0) (and (<= 3 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 5) (<= 5 fibonacci_~n)) (and (<= 8 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 7) (<= 7 fibonacci_~n)) (and .cse0 (<= |fibonacci_#in~n| 4) (<= 2 |fibonacci_#t~ret0|)) (and .cse0 (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6)))) (let ((.cse1 (<= 1 |fibonacci_#t~ret0|)) (.cse2 (<= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse1 (<= |fibonacci_#in~n| 2) (<= 2 fibonacci_~n) .cse2) (and .cse1 (<= 3 fibonacci_~n) .cse2)))) [2018-11-10 10:44:54,761 INFO L425 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 10:44:54,762 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L428 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: true [2018-11-10 10:44:54,762 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 25 36) no Hoare annotation was computed. [2018-11-10 10:44:54,762 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2018-11-10 10:44:54,763 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 25 36) no Hoare annotation was computed. [2018-11-10 10:44:54,763 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 10:44:54,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:44:54 BoogieIcfgContainer [2018-11-10 10:44:54,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:44:54,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:44:54,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:44:54,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:44:54,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:43:49" (3/4) ... [2018-11-10 10:44:54,769 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:44:54,773 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-11-10 10:44:54,773 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:44:54,773 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:44:54,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 10:44:54,776 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 10:44:54,777 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 10:44:54,802 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bda95ec9-4e85-4539-9181-01adb0366365/bin-2019/utaipan/witness.graphml [2018-11-10 10:44:54,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:44:54,803 INFO L168 Benchmark]: Toolchain (without parser) took 65764.87 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 963.4 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-10 10:44:54,804 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:44:54,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.80 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:54,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.21 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:44:54,804 INFO L168 Benchmark]: Boogie Preprocessor took 10.04 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 947.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:54,804 INFO L168 Benchmark]: RCFGBuilder took 163.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:44:54,805 INFO L168 Benchmark]: TraceAbstraction took 65405.88 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-10 10:44:54,805 INFO L168 Benchmark]: Witness Printer took 37.53 ms. Allocated memory is still 4.2 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:44:54,807 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.80 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.21 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.04 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 947.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65405.88 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 37.53 ms. Allocated memory is still 4.2 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 65.3s OverallTime, 19 OverallIterations, 171 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 490 SDtfs, 1167 SDslu, 2050 SDs, 0 SdLazy, 3578 SolverSat, 1198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15089 GetRequests, 14114 SyntacticMatches, 427 SemanticMatches, 548 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11467 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 105 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 350 PreInvPairs, 453 NumberOfFragments, 103 HoareAnnotationTreeSize, 350 FomulaSimplifications, 1724 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2827 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 55.0s InterpolantComputationTime, 14463 NumberOfCodeBlocks, 13123 NumberOfCodeBlocksAsserted, 185 NumberOfCheckSat, 21627 ConstructedInterpolants, 0 QuantifiedInterpolants, 22903118 SizeOfPredicates, 135 NumberOfNonLiveVariables, 12785 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 917742/1016757 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...