java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:20:13,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:20:13,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:20:13,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:20:13,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:20:13,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:20:13,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:20:13,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:20:13,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:20:13,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:20:13,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:20:13,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:20:13,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:20:13,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:20:13,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:20:13,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:20:13,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:20:13,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:20:13,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:20:13,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:20:13,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:20:13,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:20:13,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:20:13,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:20:13,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:20:13,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:20:13,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:20:13,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:20:13,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:20:13,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:20:13,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:20:13,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:20:13,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:20:13,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:20:13,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:20:13,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:20:13,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:20:13,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:20:13,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:20:13,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:20:13,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:20:13,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:20:13,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:20:13,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:20:13,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:20:13,563 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:20:13,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:20:13,564 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:20:13,564 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:20:13,564 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:20:13,565 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:20:13,565 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:20:13,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:20:13,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:20:13,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:20:13,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:20:13,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:20:13,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:20:13,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:20:13,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:20:13,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:20:13,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:20:13,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:20:13,570 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:20:13,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:20:13,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:20:13,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:20:13,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:20:13,571 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:20:13,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:20:13,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:20:13,571 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:20:13,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:20:13,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:20:13,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:20:13,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:20:13,645 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:20:13,647 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:20:13,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad96474b1/5328f20d2fd747128d61019a80dfb915/FLAG6d220fad8 [2019-09-10 06:20:14,348 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:20:14,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:20:14,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad96474b1/5328f20d2fd747128d61019a80dfb915/FLAG6d220fad8 [2019-09-10 06:20:14,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad96474b1/5328f20d2fd747128d61019a80dfb915 [2019-09-10 06:20:14,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:20:14,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:20:14,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:20:14,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:20:14,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:20:14,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:20:14" (1/1) ... [2019-09-10 06:20:14,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d73ed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:14, skipping insertion in model container [2019-09-10 06:20:14,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:20:14" (1/1) ... [2019-09-10 06:20:14,570 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:20:14,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:20:15,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:20:15,416 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:20:15,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:20:15,874 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:20:15,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15 WrapperNode [2019-09-10 06:20:15,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:20:15,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:20:15,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:20:15,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:20:15,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:15,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:15,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:15,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:15,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:15,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:16,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... [2019-09-10 06:20:16,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:20:16,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:20:16,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:20:16,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:20:16,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:20:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:20:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:20:16,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:20:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:20:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:20:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:20:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:20:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:20:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:20:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:20:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:20:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:20:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:20:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:20:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:20:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:20:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:20:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:20:16,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:20:16,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:20:18,301 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:20:18,302 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:20:18,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:20:18 BoogieIcfgContainer [2019-09-10 06:20:18,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:20:18,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:20:18,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:20:18,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:20:18,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:20:14" (1/3) ... [2019-09-10 06:20:18,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718c38f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:20:18, skipping insertion in model container [2019-09-10 06:20:18,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:20:15" (2/3) ... [2019-09-10 06:20:18,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718c38f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:20:18, skipping insertion in model container [2019-09-10 06:20:18,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:20:18" (3/3) ... [2019-09-10 06:20:18,317 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:20:18,327 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:20:18,346 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:20:18,362 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:20:18,384 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:20:18,384 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:20:18,384 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:20:18,385 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:20:18,385 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:20:18,385 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:20:18,385 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:20:18,385 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:20:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states. [2019-09-10 06:20:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 06:20:18,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:18,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:18,445 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1805579482, now seen corresponding path program 1 times [2019-09-10 06:20:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:18,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:18,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:18,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:19,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:19,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:19,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:19,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:19,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:19,650 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 4 states. [2019-09-10 06:20:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:19,944 INFO L93 Difference]: Finished difference Result 1166 states and 2062 transitions. [2019-09-10 06:20:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:20:19,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-10 06:20:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:19,969 INFO L225 Difference]: With dead ends: 1166 [2019-09-10 06:20:19,970 INFO L226 Difference]: Without dead ends: 1158 [2019-09-10 06:20:19,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-10 06:20:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-09-10 06:20:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-09-10 06:20:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1799 transitions. [2019-09-10 06:20:20,068 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1799 transitions. Word has length 242 [2019-09-10 06:20:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:20,069 INFO L475 AbstractCegarLoop]: Abstraction has 1156 states and 1799 transitions. [2019-09-10 06:20:20,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1799 transitions. [2019-09-10 06:20:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 06:20:20,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:20,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:20,079 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1891237145, now seen corresponding path program 1 times [2019-09-10 06:20:20,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:20,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:20,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:20,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:20,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:20,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:20,336 INFO L87 Difference]: Start difference. First operand 1156 states and 1799 transitions. Second operand 3 states. [2019-09-10 06:20:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:20,437 INFO L93 Difference]: Finished difference Result 2268 states and 3512 transitions. [2019-09-10 06:20:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:20,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-10 06:20:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:20,452 INFO L225 Difference]: With dead ends: 2268 [2019-09-10 06:20:20,453 INFO L226 Difference]: Without dead ends: 2268 [2019-09-10 06:20:20,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-09-10 06:20:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2266. [2019-09-10 06:20:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2019-09-10 06:20:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3511 transitions. [2019-09-10 06:20:20,513 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3511 transitions. Word has length 244 [2019-09-10 06:20:20,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:20,515 INFO L475 AbstractCegarLoop]: Abstraction has 2266 states and 3511 transitions. [2019-09-10 06:20:20,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3511 transitions. [2019-09-10 06:20:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 06:20:20,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:20,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:20,525 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash 188235180, now seen corresponding path program 1 times [2019-09-10 06:20:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:20,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:20,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:20,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:20,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:20,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:20,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:20,711 INFO L87 Difference]: Start difference. First operand 2266 states and 3511 transitions. Second operand 3 states. [2019-09-10 06:20:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:20,780 INFO L93 Difference]: Finished difference Result 4499 states and 6962 transitions. [2019-09-10 06:20:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:20,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-10 06:20:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:20,821 INFO L225 Difference]: With dead ends: 4499 [2019-09-10 06:20:20,822 INFO L226 Difference]: Without dead ends: 4499 [2019-09-10 06:20:20,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-09-10 06:20:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 2285. [2019-09-10 06:20:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2019-09-10 06:20:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3539 transitions. [2019-09-10 06:20:20,954 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3539 transitions. Word has length 244 [2019-09-10 06:20:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:20,955 INFO L475 AbstractCegarLoop]: Abstraction has 2285 states and 3539 transitions. [2019-09-10 06:20:20,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3539 transitions. [2019-09-10 06:20:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:20:20,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:20,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:20,962 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1417900010, now seen corresponding path program 1 times [2019-09-10 06:20:20,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:20,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:20,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:21,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:21,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:21,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:21,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:21,127 INFO L87 Difference]: Start difference. First operand 2285 states and 3539 transitions. Second operand 3 states. [2019-09-10 06:20:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:21,209 INFO L93 Difference]: Finished difference Result 4517 states and 6983 transitions. [2019-09-10 06:20:21,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:21,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-10 06:20:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:21,239 INFO L225 Difference]: With dead ends: 4517 [2019-09-10 06:20:21,239 INFO L226 Difference]: Without dead ends: 4517 [2019-09-10 06:20:21,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-09-10 06:20:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2303. [2019-09-10 06:20:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2019-09-10 06:20:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3560 transitions. [2019-09-10 06:20:21,398 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3560 transitions. Word has length 245 [2019-09-10 06:20:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:21,398 INFO L475 AbstractCegarLoop]: Abstraction has 2303 states and 3560 transitions. [2019-09-10 06:20:21,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3560 transitions. [2019-09-10 06:20:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 06:20:21,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:21,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:21,406 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1581384449, now seen corresponding path program 1 times [2019-09-10 06:20:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:21,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:21,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:21,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:21,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:21,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:21,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:21,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:21,743 INFO L87 Difference]: Start difference. First operand 2303 states and 3560 transitions. Second operand 4 states. [2019-09-10 06:20:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:21,831 INFO L93 Difference]: Finished difference Result 4444 states and 6832 transitions. [2019-09-10 06:20:21,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:21,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 06:20:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:21,852 INFO L225 Difference]: With dead ends: 4444 [2019-09-10 06:20:21,852 INFO L226 Difference]: Without dead ends: 4444 [2019-09-10 06:20:21,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2019-09-10 06:20:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 2510. [2019-09-10 06:20:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2019-09-10 06:20:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3913 transitions. [2019-09-10 06:20:21,935 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3913 transitions. Word has length 246 [2019-09-10 06:20:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:21,935 INFO L475 AbstractCegarLoop]: Abstraction has 2510 states and 3913 transitions. [2019-09-10 06:20:21,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3913 transitions. [2019-09-10 06:20:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 06:20:21,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:21,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:21,942 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:21,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1228474142, now seen corresponding path program 1 times [2019-09-10 06:20:21,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:21,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:21,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:21,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:21,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:22,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:22,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:22,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:22,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:22,189 INFO L87 Difference]: Start difference. First operand 2510 states and 3913 transitions. Second operand 3 states. [2019-09-10 06:20:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:22,293 INFO L93 Difference]: Finished difference Result 4663 states and 7181 transitions. [2019-09-10 06:20:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:22,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-10 06:20:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:22,317 INFO L225 Difference]: With dead ends: 4663 [2019-09-10 06:20:22,317 INFO L226 Difference]: Without dead ends: 4663 [2019-09-10 06:20:22,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2019-09-10 06:20:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4661. [2019-09-10 06:20:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-09-10 06:20:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 7180 transitions. [2019-09-10 06:20:22,455 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 7180 transitions. Word has length 246 [2019-09-10 06:20:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:22,455 INFO L475 AbstractCegarLoop]: Abstraction has 4661 states and 7180 transitions. [2019-09-10 06:20:22,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 7180 transitions. [2019-09-10 06:20:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 06:20:22,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:22,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:22,472 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1567601631, now seen corresponding path program 1 times [2019-09-10 06:20:22,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:22,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:22,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:22,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:22,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:22,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:22,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:22,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:22,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:22,628 INFO L87 Difference]: Start difference. First operand 4661 states and 7180 transitions. Second operand 3 states. [2019-09-10 06:20:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:22,733 INFO L93 Difference]: Finished difference Result 8555 states and 13004 transitions. [2019-09-10 06:20:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:22,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-10 06:20:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:22,768 INFO L225 Difference]: With dead ends: 8555 [2019-09-10 06:20:22,769 INFO L226 Difference]: Without dead ends: 8555 [2019-09-10 06:20:22,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8555 states. [2019-09-10 06:20:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8555 to 4765. [2019-09-10 06:20:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4765 states. [2019-09-10 06:20:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 7323 transitions. [2019-09-10 06:20:23,024 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 7323 transitions. Word has length 248 [2019-09-10 06:20:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:23,024 INFO L475 AbstractCegarLoop]: Abstraction has 4765 states and 7323 transitions. [2019-09-10 06:20:23,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 7323 transitions. [2019-09-10 06:20:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 06:20:23,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:23,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:23,035 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash -711296855, now seen corresponding path program 1 times [2019-09-10 06:20:23,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:23,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:23,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:23,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:23,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:23,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:23,172 INFO L87 Difference]: Start difference. First operand 4765 states and 7323 transitions. Second operand 3 states. [2019-09-10 06:20:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:23,241 INFO L93 Difference]: Finished difference Result 8680 states and 13150 transitions. [2019-09-10 06:20:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:23,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-10 06:20:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:23,270 INFO L225 Difference]: With dead ends: 8680 [2019-09-10 06:20:23,271 INFO L226 Difference]: Without dead ends: 8680 [2019-09-10 06:20:23,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-09-10 06:20:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 4890. [2019-09-10 06:20:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4890 states. [2019-09-10 06:20:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 7469 transitions. [2019-09-10 06:20:23,400 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 7469 transitions. Word has length 249 [2019-09-10 06:20:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:23,401 INFO L475 AbstractCegarLoop]: Abstraction has 4890 states and 7469 transitions. [2019-09-10 06:20:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 7469 transitions. [2019-09-10 06:20:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 06:20:23,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:23,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:23,416 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1016842344, now seen corresponding path program 1 times [2019-09-10 06:20:23,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:23,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:23,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:23,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:23,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:23,987 INFO L87 Difference]: Start difference. First operand 4890 states and 7469 transitions. Second operand 4 states. [2019-09-10 06:20:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:24,156 INFO L93 Difference]: Finished difference Result 9341 states and 14121 transitions. [2019-09-10 06:20:24,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:24,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-10 06:20:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:24,178 INFO L225 Difference]: With dead ends: 9341 [2019-09-10 06:20:24,178 INFO L226 Difference]: Without dead ends: 9341 [2019-09-10 06:20:24,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9341 states. [2019-09-10 06:20:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9341 to 9339. [2019-09-10 06:20:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9339 states. [2019-09-10 06:20:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9339 states to 9339 states and 14120 transitions. [2019-09-10 06:20:24,371 INFO L78 Accepts]: Start accepts. Automaton has 9339 states and 14120 transitions. Word has length 250 [2019-09-10 06:20:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:24,372 INFO L475 AbstractCegarLoop]: Abstraction has 9339 states and 14120 transitions. [2019-09-10 06:20:24,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 9339 states and 14120 transitions. [2019-09-10 06:20:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 06:20:24,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:24,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:24,391 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1376714134, now seen corresponding path program 1 times [2019-09-10 06:20:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:24,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:24,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:24,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:24,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:24,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:24,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:24,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:24,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:24,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:24,574 INFO L87 Difference]: Start difference. First operand 9339 states and 14120 transitions. Second operand 3 states. [2019-09-10 06:20:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:24,700 INFO L93 Difference]: Finished difference Result 17867 states and 26712 transitions. [2019-09-10 06:20:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:24,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-10 06:20:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:24,736 INFO L225 Difference]: With dead ends: 17867 [2019-09-10 06:20:24,737 INFO L226 Difference]: Without dead ends: 17867 [2019-09-10 06:20:24,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17867 states. [2019-09-10 06:20:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17867 to 17865. [2019-09-10 06:20:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17865 states. [2019-09-10 06:20:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17865 states to 17865 states and 26711 transitions. [2019-09-10 06:20:25,100 INFO L78 Accepts]: Start accepts. Automaton has 17865 states and 26711 transitions. Word has length 252 [2019-09-10 06:20:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:25,101 INFO L475 AbstractCegarLoop]: Abstraction has 17865 states and 26711 transitions. [2019-09-10 06:20:25,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17865 states and 26711 transitions. [2019-09-10 06:20:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 06:20:25,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:25,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:25,134 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash 399898916, now seen corresponding path program 1 times [2019-09-10 06:20:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:25,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:25,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:25,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:25,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:25,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:25,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:25,398 INFO L87 Difference]: Start difference. First operand 17865 states and 26711 transitions. Second operand 4 states. [2019-09-10 06:20:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:25,474 INFO L93 Difference]: Finished difference Result 18737 states and 28186 transitions. [2019-09-10 06:20:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:25,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-09-10 06:20:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:25,505 INFO L225 Difference]: With dead ends: 18737 [2019-09-10 06:20:25,505 INFO L226 Difference]: Without dead ends: 15583 [2019-09-10 06:20:25,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15583 states. [2019-09-10 06:20:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15583 to 15507. [2019-09-10 06:20:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15507 states. [2019-09-10 06:20:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15507 states to 15507 states and 23244 transitions. [2019-09-10 06:20:25,759 INFO L78 Accepts]: Start accepts. Automaton has 15507 states and 23244 transitions. Word has length 252 [2019-09-10 06:20:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:25,759 INFO L475 AbstractCegarLoop]: Abstraction has 15507 states and 23244 transitions. [2019-09-10 06:20:25,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 15507 states and 23244 transitions. [2019-09-10 06:20:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 06:20:25,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:25,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:25,791 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash -802252847, now seen corresponding path program 1 times [2019-09-10 06:20:25,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:25,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:25,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:25,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:26,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:26,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:26,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:26,662 INFO L87 Difference]: Start difference. First operand 15507 states and 23244 transitions. Second operand 3 states. [2019-09-10 06:20:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:26,803 INFO L93 Difference]: Finished difference Result 30192 states and 44900 transitions. [2019-09-10 06:20:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:26,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-10 06:20:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:26,865 INFO L225 Difference]: With dead ends: 30192 [2019-09-10 06:20:26,866 INFO L226 Difference]: Without dead ends: 30192 [2019-09-10 06:20:26,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30192 states. [2019-09-10 06:20:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30192 to 30190. [2019-09-10 06:20:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30190 states. [2019-09-10 06:20:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30190 states to 30190 states and 44899 transitions. [2019-09-10 06:20:27,364 INFO L78 Accepts]: Start accepts. Automaton has 30190 states and 44899 transitions. Word has length 254 [2019-09-10 06:20:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:27,365 INFO L475 AbstractCegarLoop]: Abstraction has 30190 states and 44899 transitions. [2019-09-10 06:20:27,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30190 states and 44899 transitions. [2019-09-10 06:20:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 06:20:27,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:27,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:27,403 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -51949010, now seen corresponding path program 1 times [2019-09-10 06:20:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:27,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:27,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:27,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:27,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:27,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:27,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:27,751 INFO L87 Difference]: Start difference. First operand 30190 states and 44899 transitions. Second operand 4 states. [2019-09-10 06:20:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:27,929 INFO L93 Difference]: Finished difference Result 49250 states and 72727 transitions. [2019-09-10 06:20:27,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:27,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-10 06:20:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:28,017 INFO L225 Difference]: With dead ends: 49250 [2019-09-10 06:20:28,017 INFO L226 Difference]: Without dead ends: 49250 [2019-09-10 06:20:28,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49250 states. [2019-09-10 06:20:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49250 to 29746. [2019-09-10 06:20:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29746 states. [2019-09-10 06:20:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29746 states to 29746 states and 44285 transitions. [2019-09-10 06:20:28,578 INFO L78 Accepts]: Start accepts. Automaton has 29746 states and 44285 transitions. Word has length 254 [2019-09-10 06:20:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:28,578 INFO L475 AbstractCegarLoop]: Abstraction has 29746 states and 44285 transitions. [2019-09-10 06:20:28,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29746 states and 44285 transitions. [2019-09-10 06:20:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 06:20:28,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:28,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:28,615 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1988595598, now seen corresponding path program 1 times [2019-09-10 06:20:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:28,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:28,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:28,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:28,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:28,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:28,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:28,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:28,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:28,770 INFO L87 Difference]: Start difference. First operand 29746 states and 44285 transitions. Second operand 3 states. [2019-09-10 06:20:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:28,990 INFO L93 Difference]: Finished difference Result 50054 states and 73937 transitions. [2019-09-10 06:20:28,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:28,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 06:20:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:29,046 INFO L225 Difference]: With dead ends: 50054 [2019-09-10 06:20:29,047 INFO L226 Difference]: Without dead ends: 50054 [2019-09-10 06:20:29,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50054 states. [2019-09-10 06:20:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50054 to 30227. [2019-09-10 06:20:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30227 states. [2019-09-10 06:20:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30227 states to 30227 states and 44883 transitions. [2019-09-10 06:20:29,670 INFO L78 Accepts]: Start accepts. Automaton has 30227 states and 44883 transitions. Word has length 257 [2019-09-10 06:20:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:29,670 INFO L475 AbstractCegarLoop]: Abstraction has 30227 states and 44883 transitions. [2019-09-10 06:20:29,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30227 states and 44883 transitions. [2019-09-10 06:20:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:20:29,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:29,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:29,709 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1033879136, now seen corresponding path program 1 times [2019-09-10 06:20:29,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:29,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:29,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:29,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:29,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:29,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:29,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:29,950 INFO L87 Difference]: Start difference. First operand 30227 states and 44883 transitions. Second operand 4 states. [2019-09-10 06:20:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:30,059 INFO L93 Difference]: Finished difference Result 31375 states and 46805 transitions. [2019-09-10 06:20:30,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:30,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-10 06:20:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:30,223 INFO L225 Difference]: With dead ends: 31375 [2019-09-10 06:20:30,223 INFO L226 Difference]: Without dead ends: 27207 [2019-09-10 06:20:30,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27207 states. [2019-09-10 06:20:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27207 to 26880. [2019-09-10 06:20:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26880 states. [2019-09-10 06:20:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26880 states to 26880 states and 39940 transitions. [2019-09-10 06:20:30,567 INFO L78 Accepts]: Start accepts. Automaton has 26880 states and 39940 transitions. Word has length 258 [2019-09-10 06:20:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:30,567 INFO L475 AbstractCegarLoop]: Abstraction has 26880 states and 39940 transitions. [2019-09-10 06:20:30,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26880 states and 39940 transitions. [2019-09-10 06:20:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:20:30,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:30,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:30,593 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1950765324, now seen corresponding path program 1 times [2019-09-10 06:20:30,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:30,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:30,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:31,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:31,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:31,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:31,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:31,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:31,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:31,034 INFO L87 Difference]: Start difference. First operand 26880 states and 39940 transitions. Second operand 4 states. [2019-09-10 06:20:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:31,297 INFO L93 Difference]: Finished difference Result 49714 states and 73117 transitions. [2019-09-10 06:20:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:31,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-10 06:20:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:31,352 INFO L225 Difference]: With dead ends: 49714 [2019-09-10 06:20:31,353 INFO L226 Difference]: Without dead ends: 49714 [2019-09-10 06:20:31,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49714 states. [2019-09-10 06:20:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49714 to 49712. [2019-09-10 06:20:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49712 states. [2019-09-10 06:20:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49712 states to 49712 states and 73116 transitions. [2019-09-10 06:20:32,151 INFO L78 Accepts]: Start accepts. Automaton has 49712 states and 73116 transitions. Word has length 258 [2019-09-10 06:20:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:32,151 INFO L475 AbstractCegarLoop]: Abstraction has 49712 states and 73116 transitions. [2019-09-10 06:20:32,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 49712 states and 73116 transitions. [2019-09-10 06:20:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 06:20:32,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:32,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:32,196 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1669371985, now seen corresponding path program 1 times [2019-09-10 06:20:32,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:32,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:32,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:32,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:32,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:32,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:32,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:32,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:32,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:32,363 INFO L87 Difference]: Start difference. First operand 49712 states and 73116 transitions. Second operand 3 states. [2019-09-10 06:20:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:32,638 INFO L93 Difference]: Finished difference Result 96825 states and 141116 transitions. [2019-09-10 06:20:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:32,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 06:20:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:32,719 INFO L225 Difference]: With dead ends: 96825 [2019-09-10 06:20:32,719 INFO L226 Difference]: Without dead ends: 96825 [2019-09-10 06:20:32,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96825 states. [2019-09-10 06:20:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96825 to 96571. [2019-09-10 06:20:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96571 states. [2019-09-10 06:20:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96571 states to 96571 states and 140800 transitions. [2019-09-10 06:20:34,853 INFO L78 Accepts]: Start accepts. Automaton has 96571 states and 140800 transitions. Word has length 260 [2019-09-10 06:20:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:34,853 INFO L475 AbstractCegarLoop]: Abstraction has 96571 states and 140800 transitions. [2019-09-10 06:20:34,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 96571 states and 140800 transitions. [2019-09-10 06:20:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 06:20:34,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:34,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:34,918 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -571126073, now seen corresponding path program 1 times [2019-09-10 06:20:34,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:34,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:34,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:35,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:35,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:35,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:35,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:35,143 INFO L87 Difference]: Start difference. First operand 96571 states and 140800 transitions. Second operand 4 states. [2019-09-10 06:20:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:35,902 INFO L93 Difference]: Finished difference Result 153234 states and 222623 transitions. [2019-09-10 06:20:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:35,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-09-10 06:20:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:36,027 INFO L225 Difference]: With dead ends: 153234 [2019-09-10 06:20:36,027 INFO L226 Difference]: Without dead ends: 152040 [2019-09-10 06:20:36,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:20:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152040 states. [2019-09-10 06:20:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152040 to 96350. [2019-09-10 06:20:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96350 states. [2019-09-10 06:20:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96350 states to 96350 states and 140686 transitions. [2019-09-10 06:20:39,191 INFO L78 Accepts]: Start accepts. Automaton has 96350 states and 140686 transitions. Word has length 262 [2019-09-10 06:20:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:39,191 INFO L475 AbstractCegarLoop]: Abstraction has 96350 states and 140686 transitions. [2019-09-10 06:20:39,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 96350 states and 140686 transitions. [2019-09-10 06:20:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 06:20:39,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:39,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:39,250 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1668510166, now seen corresponding path program 1 times [2019-09-10 06:20:39,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:39,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:39,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:39,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:39,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:39,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:39,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:39,442 INFO L87 Difference]: Start difference. First operand 96350 states and 140686 transitions. Second operand 3 states. [2019-09-10 06:20:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:39,832 INFO L93 Difference]: Finished difference Result 181425 states and 262580 transitions. [2019-09-10 06:20:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:39,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 06:20:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:39,982 INFO L225 Difference]: With dead ends: 181425 [2019-09-10 06:20:39,982 INFO L226 Difference]: Without dead ends: 181425 [2019-09-10 06:20:39,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181425 states. [2019-09-10 06:20:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181425 to 181423. [2019-09-10 06:20:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181423 states. [2019-09-10 06:20:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181423 states to 181423 states and 262579 transitions. [2019-09-10 06:20:44,191 INFO L78 Accepts]: Start accepts. Automaton has 181423 states and 262579 transitions. Word has length 262 [2019-09-10 06:20:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:44,192 INFO L475 AbstractCegarLoop]: Abstraction has 181423 states and 262579 transitions. [2019-09-10 06:20:44,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 181423 states and 262579 transitions. [2019-09-10 06:20:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 06:20:44,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:44,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:44,299 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2019923775, now seen corresponding path program 1 times [2019-09-10 06:20:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:44,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:44,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:44,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:44,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:44,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:44,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:44,419 INFO L87 Difference]: Start difference. First operand 181423 states and 262579 transitions. Second operand 3 states. [2019-09-10 06:20:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:45,009 INFO L93 Difference]: Finished difference Result 291241 states and 418322 transitions. [2019-09-10 06:20:45,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:45,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 06:20:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:45,277 INFO L225 Difference]: With dead ends: 291241 [2019-09-10 06:20:45,277 INFO L226 Difference]: Without dead ends: 291241 [2019-09-10 06:20:45,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291241 states. [2019-09-10 06:20:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291241 to 180883. [2019-09-10 06:20:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180883 states. [2019-09-10 06:20:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180883 states to 180883 states and 260981 transitions. [2019-09-10 06:20:51,593 INFO L78 Accepts]: Start accepts. Automaton has 180883 states and 260981 transitions. Word has length 265 [2019-09-10 06:20:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:51,594 INFO L475 AbstractCegarLoop]: Abstraction has 180883 states and 260981 transitions. [2019-09-10 06:20:51,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 180883 states and 260981 transitions. [2019-09-10 06:20:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 06:20:51,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:51,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:51,707 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash 296119333, now seen corresponding path program 1 times [2019-09-10 06:20:51,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:51,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:51,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:51,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:51,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:51,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:51,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:51,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:51,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:51,822 INFO L87 Difference]: Start difference. First operand 180883 states and 260981 transitions. Second operand 3 states. [2019-09-10 06:20:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:52,894 INFO L93 Difference]: Finished difference Result 291805 states and 418550 transitions. [2019-09-10 06:20:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:52,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-09-10 06:20:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:53,148 INFO L225 Difference]: With dead ends: 291805 [2019-09-10 06:20:53,148 INFO L226 Difference]: Without dead ends: 291805 [2019-09-10 06:20:53,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291805 states. [2019-09-10 06:20:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291805 to 291803. [2019-09-10 06:20:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291803 states. [2019-09-10 06:20:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291803 states to 291803 states and 418549 transitions. [2019-09-10 06:20:59,888 INFO L78 Accepts]: Start accepts. Automaton has 291803 states and 418549 transitions. Word has length 266 [2019-09-10 06:20:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:59,889 INFO L475 AbstractCegarLoop]: Abstraction has 291803 states and 418549 transitions. [2019-09-10 06:20:59,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 291803 states and 418549 transitions. [2019-09-10 06:21:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 06:21:00,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:00,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:00,063 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash -777275510, now seen corresponding path program 1 times [2019-09-10 06:21:00,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:00,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:00,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:00,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:00,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:00,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:00,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:00,405 INFO L87 Difference]: Start difference. First operand 291803 states and 418549 transitions. Second operand 4 states. [2019-09-10 06:21:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:01,500 INFO L93 Difference]: Finished difference Result 567084 states and 804986 transitions. [2019-09-10 06:21:01,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:01,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-09-10 06:21:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:02,059 INFO L225 Difference]: With dead ends: 567084 [2019-09-10 06:21:02,059 INFO L226 Difference]: Without dead ends: 567084 [2019-09-10 06:21:02,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:21:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567084 states. [2019-09-10 06:21:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567084 to 567082. [2019-09-10 06:21:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567082 states. [2019-09-10 06:21:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567082 states to 567082 states and 804985 transitions. [2019-09-10 06:21:14,575 INFO L78 Accepts]: Start accepts. Automaton has 567082 states and 804985 transitions. Word has length 266 [2019-09-10 06:21:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:14,575 INFO L475 AbstractCegarLoop]: Abstraction has 567082 states and 804985 transitions. [2019-09-10 06:21:14,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 567082 states and 804985 transitions. [2019-09-10 06:21:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 06:21:14,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:14,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:14,980 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2062448514, now seen corresponding path program 1 times [2019-09-10 06:21:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:15,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:15,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:15,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:15,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:15,161 INFO L87 Difference]: Start difference. First operand 567082 states and 804985 transitions. Second operand 3 states. [2019-09-10 06:21:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:24,281 INFO L93 Difference]: Finished difference Result 1113554 states and 1566591 transitions. [2019-09-10 06:21:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:24,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-10 06:21:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:25,420 INFO L225 Difference]: With dead ends: 1113554 [2019-09-10 06:21:25,420 INFO L226 Difference]: Without dead ends: 1113554 [2019-09-10 06:21:25,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113554 states. [2019-09-10 06:21:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113554 to 1113552. [2019-09-10 06:21:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113552 states. [2019-09-10 06:22:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113552 states to 1113552 states and 1566590 transitions. [2019-09-10 06:22:09,835 INFO L78 Accepts]: Start accepts. Automaton has 1113552 states and 1566590 transitions. Word has length 268 [2019-09-10 06:22:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:09,836 INFO L475 AbstractCegarLoop]: Abstraction has 1113552 states and 1566590 transitions. [2019-09-10 06:22:09,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1113552 states and 1566590 transitions. [2019-09-10 06:22:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 06:22:12,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:12,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:12,707 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:12,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2091084551, now seen corresponding path program 1 times [2019-09-10 06:22:12,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:12,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:12,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:12,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:12,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:12,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:12,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:12,826 INFO L87 Difference]: Start difference. First operand 1113552 states and 1566590 transitions. Second operand 3 states. [2019-09-10 06:22:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:30,542 INFO L93 Difference]: Finished difference Result 2134881 states and 2995551 transitions. [2019-09-10 06:22:30,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:30,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-10 06:22:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:33,919 INFO L225 Difference]: With dead ends: 2134881 [2019-09-10 06:22:33,919 INFO L226 Difference]: Without dead ends: 2134881 [2019-09-10 06:22:33,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134881 states. [2019-09-10 06:23:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134881 to 1098224. [2019-09-10 06:23:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098224 states. [2019-09-10 06:23:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098224 states to 1098224 states and 1543528 transitions. [2019-09-10 06:23:19,080 INFO L78 Accepts]: Start accepts. Automaton has 1098224 states and 1543528 transitions. Word has length 268 [2019-09-10 06:23:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:19,081 INFO L475 AbstractCegarLoop]: Abstraction has 1098224 states and 1543528 transitions. [2019-09-10 06:23:19,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1098224 states and 1543528 transitions. [2019-09-10 06:23:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-10 06:23:31,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:31,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:31,595 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -514234531, now seen corresponding path program 1 times [2019-09-10 06:23:31,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:31,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:31,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:31,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:31,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:31,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:31,692 INFO L87 Difference]: Start difference. First operand 1098224 states and 1543528 transitions. Second operand 3 states. [2019-09-10 06:23:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:45,830 INFO L93 Difference]: Finished difference Result 2161165 states and 3035164 transitions. [2019-09-10 06:23:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:45,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-10 06:23:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:48,429 INFO L225 Difference]: With dead ends: 2161165 [2019-09-10 06:23:48,429 INFO L226 Difference]: Without dead ends: 2161165 [2019-09-10 06:23:48,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161165 states. [2019-09-10 06:24:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161165 to 1098879. [2019-09-10 06:24:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098879 states. [2019-09-10 06:24:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098879 states to 1098879 states and 1544277 transitions. [2019-09-10 06:24:40,310 INFO L78 Accepts]: Start accepts. Automaton has 1098879 states and 1544277 transitions. Word has length 269 [2019-09-10 06:24:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:40,311 INFO L475 AbstractCegarLoop]: Abstraction has 1098879 states and 1544277 transitions. [2019-09-10 06:24:40,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1098879 states and 1544277 transitions. [2019-09-10 06:24:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 06:24:43,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:43,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:43,855 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1430252995, now seen corresponding path program 1 times [2019-09-10 06:24:43,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:43,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:43,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:44,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:44,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:44,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:44,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:44,038 INFO L87 Difference]: Start difference. First operand 1098879 states and 1544277 transitions. Second operand 3 states.