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_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:15:22,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:15:22,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:15:22,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:15:22,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:15:22,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:15:22,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:15:22,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:15:22,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:15:22,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:15:22,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:15:22,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:15:22,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:15:22,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:15:22,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:15:22,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:15:22,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:15:22,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:15:22,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:15:22,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:15:22,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:15:22,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:15:22,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:15:22,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:15:22,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:15:22,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:15:22,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:15:22,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:15:22,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:15:22,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:15:22,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:15:22,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:15:22,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:15:22,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:15:22,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:15:22,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:15:22,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:15:22,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:15:22,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:15:22,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:15:22,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:15:22,444 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 07:15:22,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:15:22,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:15:22,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:15:22,470 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:15:22,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:15:22,471 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:15:22,471 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:15:22,471 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:15:22,472 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:15:22,472 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:15:22,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:15:22,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:15:22,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:15:22,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:15:22,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:15:22,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:15:22,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:15:22,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:15:22,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:15:22,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:15:22,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:15:22,477 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:15:22,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:15:22,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:15:22,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:15:22,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:15:22,478 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:15:22,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:15:22,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:15:22,478 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:15:22,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:15:22,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:15:22,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:15:22,561 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:15:22,562 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:15:22,563 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:15:22,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5a27acf/02ad5c529c4440a1905412f8df6222f5/FLAGa1b8dcad6 [2019-09-10 07:15:23,269 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:15:23,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:15:23,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5a27acf/02ad5c529c4440a1905412f8df6222f5/FLAGa1b8dcad6 [2019-09-10 07:15:23,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5a27acf/02ad5c529c4440a1905412f8df6222f5 [2019-09-10 07:15:23,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:15:23,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:15:23,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:15:23,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:15:23,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:15:23,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:15:23" (1/1) ... [2019-09-10 07:15:23,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adce4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:23, skipping insertion in model container [2019-09-10 07:15:23,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:15:23" (1/1) ... [2019-09-10 07:15:23,678 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:15:23,751 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:15:24,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:15:24,303 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:15:24,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:15:24,444 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:15:24,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24 WrapperNode [2019-09-10 07:15:24,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:15:24,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:15:24,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:15:24,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:15:24,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (1/1) ... [2019-09-10 07:15:24,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:15:24,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:15:24,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:15:24,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:15:24,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (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 07:15:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:15:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:15:24,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:15:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:15:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:15:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:15:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:15:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:15:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:15:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:15:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:15:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:15:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:15:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:15:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:15:24,633 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:15:24,633 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:15:24,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:15:24,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:15:24,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:15:25,776 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:15:25,776 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:15:25,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:15:25 BoogieIcfgContainer [2019-09-10 07:15:25,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:15:25,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:15:25,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:15:25,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:15:25,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:15:23" (1/3) ... [2019-09-10 07:15:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68816556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:15:25, skipping insertion in model container [2019-09-10 07:15:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:15:24" (2/3) ... [2019-09-10 07:15:25,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68816556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:15:25, skipping insertion in model container [2019-09-10 07:15:25,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:15:25" (3/3) ... [2019-09-10 07:15:25,793 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 07:15:25,805 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:15:25,828 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:15:25,848 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:15:25,896 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:15:25,896 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:15:25,896 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:15:25,897 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:15:25,897 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:15:25,897 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:15:25,897 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:15:25,897 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:15:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2019-09-10 07:15:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:15:25,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:25,949 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] [2019-09-10 07:15:25,950 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:25,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1388414232, now seen corresponding path program 1 times [2019-09-10 07:15:25,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:26,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:26,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:26,495 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 07:15:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:26,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:26,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:26,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:26,523 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 3 states. [2019-09-10 07:15:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:26,688 INFO L93 Difference]: Finished difference Result 341 states and 562 transitions. [2019-09-10 07:15:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:26,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:15:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:26,707 INFO L225 Difference]: With dead ends: 341 [2019-09-10 07:15:26,707 INFO L226 Difference]: Without dead ends: 333 [2019-09-10 07:15:26,709 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 07:15:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-10 07:15:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-09-10 07:15:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-10 07:15:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2019-09-10 07:15:26,808 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 85 [2019-09-10 07:15:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:26,809 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2019-09-10 07:15:26,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2019-09-10 07:15:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:15:26,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:26,814 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] [2019-09-10 07:15:26,814 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:26,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash -368286742, now seen corresponding path program 1 times [2019-09-10 07:15:26,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:26,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:26,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:26,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:27,204 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 07:15:27,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:27,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:27,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:27,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:27,207 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand 7 states. [2019-09-10 07:15:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:27,591 INFO L93 Difference]: Finished difference Result 1171 states and 1790 transitions. [2019-09-10 07:15:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:15:27,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-10 07:15:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:27,600 INFO L225 Difference]: With dead ends: 1171 [2019-09-10 07:15:27,600 INFO L226 Difference]: Without dead ends: 1171 [2019-09-10 07:15:27,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-10 07:15:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1163. [2019-09-10 07:15:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-09-10 07:15:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1786 transitions. [2019-09-10 07:15:27,676 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1786 transitions. Word has length 86 [2019-09-10 07:15:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:27,678 INFO L475 AbstractCegarLoop]: Abstraction has 1163 states and 1786 transitions. [2019-09-10 07:15:27,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1786 transitions. [2019-09-10 07:15:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:15:27,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:27,692 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] [2019-09-10 07:15:27,693 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:27,694 INFO L82 PathProgramCache]: Analyzing trace with hash -414926669, now seen corresponding path program 1 times [2019-09-10 07:15:27,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:27,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:27,865 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 07:15:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:27,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:27,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:27,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:27,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:27,870 INFO L87 Difference]: Start difference. First operand 1163 states and 1786 transitions. Second operand 5 states. [2019-09-10 07:15:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:28,240 INFO L93 Difference]: Finished difference Result 1963 states and 3029 transitions. [2019-09-10 07:15:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:15:28,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:15:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:28,256 INFO L225 Difference]: With dead ends: 1963 [2019-09-10 07:15:28,256 INFO L226 Difference]: Without dead ends: 1963 [2019-09-10 07:15:28,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-09-10 07:15:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2019-09-10 07:15:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-09-10 07:15:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3028 transitions. [2019-09-10 07:15:28,319 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3028 transitions. Word has length 87 [2019-09-10 07:15:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:28,322 INFO L475 AbstractCegarLoop]: Abstraction has 1961 states and 3028 transitions. [2019-09-10 07:15:28,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3028 transitions. [2019-09-10 07:15:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:15:28,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:28,325 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] [2019-09-10 07:15:28,326 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash 412481220, now seen corresponding path program 1 times [2019-09-10 07:15:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:28,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:28,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:28,463 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 07:15:28,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:28,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:28,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:28,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:28,466 INFO L87 Difference]: Start difference. First operand 1961 states and 3028 transitions. Second operand 5 states. [2019-09-10 07:15:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:28,805 INFO L93 Difference]: Finished difference Result 3543 states and 5494 transitions. [2019-09-10 07:15:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:15:28,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:15:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:28,824 INFO L225 Difference]: With dead ends: 3543 [2019-09-10 07:15:28,824 INFO L226 Difference]: Without dead ends: 3543 [2019-09-10 07:15:28,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-09-10 07:15:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3541. [2019-09-10 07:15:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2019-09-10 07:15:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5493 transitions. [2019-09-10 07:15:28,908 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5493 transitions. Word has length 87 [2019-09-10 07:15:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:28,909 INFO L475 AbstractCegarLoop]: Abstraction has 3541 states and 5493 transitions. [2019-09-10 07:15:28,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5493 transitions. [2019-09-10 07:15:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:15:28,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:28,912 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] [2019-09-10 07:15:28,912 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash 549004962, now seen corresponding path program 1 times [2019-09-10 07:15:28,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:28,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:29,015 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 07:15:29,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:29,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:29,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:29,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:29,019 INFO L87 Difference]: Start difference. First operand 3541 states and 5493 transitions. Second operand 5 states. [2019-09-10 07:15:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:29,393 INFO L93 Difference]: Finished difference Result 6757 states and 10472 transitions. [2019-09-10 07:15:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:15:29,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:15:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:29,431 INFO L225 Difference]: With dead ends: 6757 [2019-09-10 07:15:29,431 INFO L226 Difference]: Without dead ends: 6757 [2019-09-10 07:15:29,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-09-10 07:15:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6755. [2019-09-10 07:15:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2019-09-10 07:15:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 10471 transitions. [2019-09-10 07:15:29,665 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 10471 transitions. Word has length 87 [2019-09-10 07:15:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:29,666 INFO L475 AbstractCegarLoop]: Abstraction has 6755 states and 10471 transitions. [2019-09-10 07:15:29,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 10471 transitions. [2019-09-10 07:15:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:15:29,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:29,670 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] [2019-09-10 07:15:29,670 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1246527343, now seen corresponding path program 1 times [2019-09-10 07:15:29,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:29,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:29,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:29,824 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 07:15:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:29,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:15:29,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:15:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:15:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:15:29,827 INFO L87 Difference]: Start difference. First operand 6755 states and 10471 transitions. Second operand 6 states. [2019-09-10 07:15:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:30,314 INFO L93 Difference]: Finished difference Result 19231 states and 29726 transitions. [2019-09-10 07:15:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:15:30,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:15:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:30,397 INFO L225 Difference]: With dead ends: 19231 [2019-09-10 07:15:30,397 INFO L226 Difference]: Without dead ends: 19231 [2019-09-10 07:15:30,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:15:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-09-10 07:15:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 19227. [2019-09-10 07:15:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19227 states. [2019-09-10 07:15:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 29724 transitions. [2019-09-10 07:15:30,886 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 29724 transitions. Word has length 87 [2019-09-10 07:15:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:30,888 INFO L475 AbstractCegarLoop]: Abstraction has 19227 states and 29724 transitions. [2019-09-10 07:15:30,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:15:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 29724 transitions. [2019-09-10 07:15:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:15:30,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:30,900 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] [2019-09-10 07:15:30,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1749809536, now seen corresponding path program 1 times [2019-09-10 07:15:30,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:30,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:30,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:30,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:31,003 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 07:15:31,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:31,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:31,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:31,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:31,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:31,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:31,006 INFO L87 Difference]: Start difference. First operand 19227 states and 29724 transitions. Second operand 5 states. [2019-09-10 07:15:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:31,417 INFO L93 Difference]: Finished difference Result 34939 states and 53647 transitions. [2019-09-10 07:15:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:15:31,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:15:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:31,499 INFO L225 Difference]: With dead ends: 34939 [2019-09-10 07:15:31,500 INFO L226 Difference]: Without dead ends: 34939 [2019-09-10 07:15:31,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34939 states. [2019-09-10 07:15:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34939 to 34937. [2019-09-10 07:15:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34937 states. [2019-09-10 07:15:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34937 states to 34937 states and 53646 transitions. [2019-09-10 07:15:32,752 INFO L78 Accepts]: Start accepts. Automaton has 34937 states and 53646 transitions. Word has length 87 [2019-09-10 07:15:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:32,753 INFO L475 AbstractCegarLoop]: Abstraction has 34937 states and 53646 transitions. [2019-09-10 07:15:32,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 34937 states and 53646 transitions. [2019-09-10 07:15:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:15:32,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:32,762 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] [2019-09-10 07:15:32,762 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1607364171, now seen corresponding path program 1 times [2019-09-10 07:15:32,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:32,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:32,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:32,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:32,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:32,863 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 07:15:32,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:32,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:32,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:32,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:32,866 INFO L87 Difference]: Start difference. First operand 34937 states and 53646 transitions. Second operand 5 states. [2019-09-10 07:15:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:33,266 INFO L93 Difference]: Finished difference Result 65489 states and 99902 transitions. [2019-09-10 07:15:33,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:15:33,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 07:15:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:33,442 INFO L225 Difference]: With dead ends: 65489 [2019-09-10 07:15:33,442 INFO L226 Difference]: Without dead ends: 65489 [2019-09-10 07:15:33,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:15:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65489 states. [2019-09-10 07:15:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65489 to 35369. [2019-09-10 07:15:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35369 states. [2019-09-10 07:15:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35369 states to 35369 states and 54078 transitions. [2019-09-10 07:15:34,310 INFO L78 Accepts]: Start accepts. Automaton has 35369 states and 54078 transitions. Word has length 88 [2019-09-10 07:15:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:34,311 INFO L475 AbstractCegarLoop]: Abstraction has 35369 states and 54078 transitions. [2019-09-10 07:15:34,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35369 states and 54078 transitions. [2019-09-10 07:15:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:15:34,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:34,323 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] [2019-09-10 07:15:34,323 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1987865476, now seen corresponding path program 1 times [2019-09-10 07:15:34,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:34,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:34,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:34,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:34,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:34,603 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 07:15:34,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:34,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:15:34,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:34,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:15:34,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:15:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:34,606 INFO L87 Difference]: Start difference. First operand 35369 states and 54078 transitions. Second operand 10 states. [2019-09-10 07:15:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:37,819 INFO L93 Difference]: Finished difference Result 107942 states and 162756 transitions. [2019-09-10 07:15:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:15:37,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:15:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:37,970 INFO L225 Difference]: With dead ends: 107942 [2019-09-10 07:15:37,970 INFO L226 Difference]: Without dead ends: 107942 [2019-09-10 07:15:37,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:15:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107942 states. [2019-09-10 07:15:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107942 to 35956. [2019-09-10 07:15:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35956 states. [2019-09-10 07:15:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35956 states to 35956 states and 54943 transitions. [2019-09-10 07:15:38,947 INFO L78 Accepts]: Start accepts. Automaton has 35956 states and 54943 transitions. Word has length 89 [2019-09-10 07:15:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:38,948 INFO L475 AbstractCegarLoop]: Abstraction has 35956 states and 54943 transitions. [2019-09-10 07:15:38,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35956 states and 54943 transitions. [2019-09-10 07:15:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:15:38,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:38,959 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] [2019-09-10 07:15:38,959 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 812355556, now seen corresponding path program 1 times [2019-09-10 07:15:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:38,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:39,053 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 07:15:39,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:39,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:15:39,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:39,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:15:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:15:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:15:39,055 INFO L87 Difference]: Start difference. First operand 35956 states and 54943 transitions. Second operand 4 states. [2019-09-10 07:15:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:39,278 INFO L93 Difference]: Finished difference Result 66406 states and 100688 transitions. [2019-09-10 07:15:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:15:39,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:15:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:39,822 INFO L225 Difference]: With dead ends: 66406 [2019-09-10 07:15:39,822 INFO L226 Difference]: Without dead ends: 66406 [2019-09-10 07:15:39,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:15:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66406 states. [2019-09-10 07:15:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66406 to 66404. [2019-09-10 07:15:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66404 states. [2019-09-10 07:15:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66404 states to 66404 states and 100687 transitions. [2019-09-10 07:15:40,449 INFO L78 Accepts]: Start accepts. Automaton has 66404 states and 100687 transitions. Word has length 89 [2019-09-10 07:15:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:40,450 INFO L475 AbstractCegarLoop]: Abstraction has 66404 states and 100687 transitions. [2019-09-10 07:15:40,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:15:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66404 states and 100687 transitions. [2019-09-10 07:15:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:40,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:40,459 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] [2019-09-10 07:15:40,460 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash 63635533, now seen corresponding path program 1 times [2019-09-10 07:15:40,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:40,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:40,518 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 07:15:40,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:40,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:40,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:40,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:40,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:40,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:40,520 INFO L87 Difference]: Start difference. First operand 66404 states and 100687 transitions. Second operand 3 states. [2019-09-10 07:15:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:41,056 INFO L93 Difference]: Finished difference Result 73456 states and 109560 transitions. [2019-09-10 07:15:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:41,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:41,264 INFO L225 Difference]: With dead ends: 73456 [2019-09-10 07:15:41,265 INFO L226 Difference]: Without dead ends: 72984 [2019-09-10 07:15:41,269 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 07:15:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72984 states. [2019-09-10 07:15:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72984 to 65222. [2019-09-10 07:15:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65222 states. [2019-09-10 07:15:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65222 states to 65222 states and 97595 transitions. [2019-09-10 07:15:42,190 INFO L78 Accepts]: Start accepts. Automaton has 65222 states and 97595 transitions. Word has length 90 [2019-09-10 07:15:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:42,190 INFO L475 AbstractCegarLoop]: Abstraction has 65222 states and 97595 transitions. [2019-09-10 07:15:42,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 65222 states and 97595 transitions. [2019-09-10 07:15:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:42,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:42,200 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] [2019-09-10 07:15:42,201 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1632884758, now seen corresponding path program 1 times [2019-09-10 07:15:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:42,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:42,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:42,274 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 07:15:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:42,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:42,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:42,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:42,276 INFO L87 Difference]: Start difference. First operand 65222 states and 97595 transitions. Second operand 3 states. [2019-09-10 07:15:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:42,491 INFO L93 Difference]: Finished difference Result 83868 states and 123498 transitions. [2019-09-10 07:15:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:42,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:42,654 INFO L225 Difference]: With dead ends: 83868 [2019-09-10 07:15:42,654 INFO L226 Difference]: Without dead ends: 83868 [2019-09-10 07:15:42,654 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 07:15:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83868 states. [2019-09-10 07:15:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83868 to 83154. [2019-09-10 07:15:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83154 states. [2019-09-10 07:15:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83154 states to 83154 states and 122785 transitions. [2019-09-10 07:15:43,665 INFO L78 Accepts]: Start accepts. Automaton has 83154 states and 122785 transitions. Word has length 90 [2019-09-10 07:15:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:43,665 INFO L475 AbstractCegarLoop]: Abstraction has 83154 states and 122785 transitions. [2019-09-10 07:15:43,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 83154 states and 122785 transitions. [2019-09-10 07:15:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:43,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:43,678 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] [2019-09-10 07:15:43,678 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2017433619, now seen corresponding path program 1 times [2019-09-10 07:15:43,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:43,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:43,786 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 07:15:43,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:43,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:15:43,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:43,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:15:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:15:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:15:43,788 INFO L87 Difference]: Start difference. First operand 83154 states and 122785 transitions. Second operand 7 states. [2019-09-10 07:15:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:45,271 INFO L93 Difference]: Finished difference Result 269332 states and 391404 transitions. [2019-09-10 07:15:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:15:45,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:15:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:45,696 INFO L225 Difference]: With dead ends: 269332 [2019-09-10 07:15:45,696 INFO L226 Difference]: Without dead ends: 269332 [2019-09-10 07:15:45,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:15:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269332 states. [2019-09-10 07:15:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269332 to 97328. [2019-09-10 07:15:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97328 states. [2019-09-10 07:15:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97328 states to 97328 states and 143328 transitions. [2019-09-10 07:15:50,098 INFO L78 Accepts]: Start accepts. Automaton has 97328 states and 143328 transitions. Word has length 90 [2019-09-10 07:15:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:50,099 INFO L475 AbstractCegarLoop]: Abstraction has 97328 states and 143328 transitions. [2019-09-10 07:15:50,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:15:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 97328 states and 143328 transitions. [2019-09-10 07:15:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:50,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:50,109 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] [2019-09-10 07:15:50,109 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1079490452, now seen corresponding path program 1 times [2019-09-10 07:15:50,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:50,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:50,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:50,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:50,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:50,169 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 07:15:50,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:50,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:50,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:50,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:50,171 INFO L87 Difference]: Start difference. First operand 97328 states and 143328 transitions. Second operand 3 states. [2019-09-10 07:15:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:50,534 INFO L93 Difference]: Finished difference Result 108488 states and 156552 transitions. [2019-09-10 07:15:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:50,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:50,678 INFO L225 Difference]: With dead ends: 108488 [2019-09-10 07:15:50,678 INFO L226 Difference]: Without dead ends: 108488 [2019-09-10 07:15:50,679 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 07:15:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108488 states. [2019-09-10 07:15:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108488 to 107606. [2019-09-10 07:15:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107606 states. [2019-09-10 07:15:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107606 states to 107606 states and 155671 transitions. [2019-09-10 07:15:52,286 INFO L78 Accepts]: Start accepts. Automaton has 107606 states and 155671 transitions. Word has length 90 [2019-09-10 07:15:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:52,287 INFO L475 AbstractCegarLoop]: Abstraction has 107606 states and 155671 transitions. [2019-09-10 07:15:52,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 107606 states and 155671 transitions. [2019-09-10 07:15:52,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:52,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:52,296 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] [2019-09-10 07:15:52,297 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:52,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1593295700, now seen corresponding path program 1 times [2019-09-10 07:15:52,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:52,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:52,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:52,351 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 07:15:52,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:52,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:52,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:52,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:52,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:52,353 INFO L87 Difference]: Start difference. First operand 107606 states and 155671 transitions. Second operand 3 states. [2019-09-10 07:15:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:52,722 INFO L93 Difference]: Finished difference Result 155996 states and 221901 transitions. [2019-09-10 07:15:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:52,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:52,905 INFO L225 Difference]: With dead ends: 155996 [2019-09-10 07:15:52,906 INFO L226 Difference]: Without dead ends: 155996 [2019-09-10 07:15:52,906 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 07:15:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155996 states. [2019-09-10 07:15:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155996 to 154826. [2019-09-10 07:15:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154826 states. [2019-09-10 07:15:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154826 states to 154826 states and 220732 transitions. [2019-09-10 07:15:56,663 INFO L78 Accepts]: Start accepts. Automaton has 154826 states and 220732 transitions. Word has length 90 [2019-09-10 07:15:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:56,664 INFO L475 AbstractCegarLoop]: Abstraction has 154826 states and 220732 transitions. [2019-09-10 07:15:56,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 154826 states and 220732 transitions. [2019-09-10 07:15:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:56,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:56,675 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] [2019-09-10 07:15:56,675 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 327308374, now seen corresponding path program 1 times [2019-09-10 07:15:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:56,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:56,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:56,729 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 07:15:56,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:56,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:56,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:56,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:56,730 INFO L87 Difference]: Start difference. First operand 154826 states and 220732 transitions. Second operand 3 states. [2019-09-10 07:15:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:57,933 INFO L93 Difference]: Finished difference Result 208671 states and 292663 transitions. [2019-09-10 07:15:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:57,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:58,184 INFO L225 Difference]: With dead ends: 208671 [2019-09-10 07:15:58,184 INFO L226 Difference]: Without dead ends: 208671 [2019-09-10 07:15:58,185 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 07:15:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208671 states. [2019-09-10 07:16:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208671 to 208121. [2019-09-10 07:16:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208121 states. [2019-09-10 07:16:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208121 states to 208121 states and 292114 transitions. [2019-09-10 07:16:03,997 INFO L78 Accepts]: Start accepts. Automaton has 208121 states and 292114 transitions. Word has length 90 [2019-09-10 07:16:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:03,998 INFO L475 AbstractCegarLoop]: Abstraction has 208121 states and 292114 transitions. [2019-09-10 07:16:03,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 208121 states and 292114 transitions. [2019-09-10 07:16:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:16:04,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:04,015 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] [2019-09-10 07:16:04,016 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:04,016 INFO L82 PathProgramCache]: Analyzing trace with hash 810633430, now seen corresponding path program 1 times [2019-09-10 07:16:04,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:04,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:04,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:04,121 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 07:16:04,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:04,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:04,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:04,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:04,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:04,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:04,123 INFO L87 Difference]: Start difference. First operand 208121 states and 292114 transitions. Second operand 7 states. [2019-09-10 07:16:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:13,484 INFO L93 Difference]: Finished difference Result 1100995 states and 1532069 transitions. [2019-09-10 07:16:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:16:13,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:16:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:14,962 INFO L225 Difference]: With dead ends: 1100995 [2019-09-10 07:16:14,962 INFO L226 Difference]: Without dead ends: 1100995 [2019-09-10 07:16:14,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:16:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100995 states. [2019-09-10 07:16:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100995 to 208615. [2019-09-10 07:16:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208615 states. [2019-09-10 07:16:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208615 states to 208615 states and 292749 transitions. [2019-09-10 07:16:23,437 INFO L78 Accepts]: Start accepts. Automaton has 208615 states and 292749 transitions. Word has length 90 [2019-09-10 07:16:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:23,438 INFO L475 AbstractCegarLoop]: Abstraction has 208615 states and 292749 transitions. [2019-09-10 07:16:23,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:16:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 208615 states and 292749 transitions. [2019-09-10 07:16:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:16:23,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:23,452 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] [2019-09-10 07:16:23,452 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 108547188, now seen corresponding path program 1 times [2019-09-10 07:16:23,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:23,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:23,555 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 07:16:23,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:23,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:23,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:23,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:23,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:23,557 INFO L87 Difference]: Start difference. First operand 208615 states and 292749 transitions. Second operand 7 states. [2019-09-10 07:16:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:26,997 INFO L93 Difference]: Finished difference Result 1165136 states and 1625508 transitions. [2019-09-10 07:16:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:16:26,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:16:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:36,945 INFO L225 Difference]: With dead ends: 1165136 [2019-09-10 07:16:36,945 INFO L226 Difference]: Without dead ends: 1165136 [2019-09-10 07:16:36,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:16:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165136 states. [2019-09-10 07:16:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165136 to 208903. [2019-09-10 07:16:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208903 states. [2019-09-10 07:16:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208903 states to 208903 states and 293104 transitions. [2019-09-10 07:16:45,752 INFO L78 Accepts]: Start accepts. Automaton has 208903 states and 293104 transitions. Word has length 90 [2019-09-10 07:16:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:45,752 INFO L475 AbstractCegarLoop]: Abstraction has 208903 states and 293104 transitions. [2019-09-10 07:16:45,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:16:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 208903 states and 293104 transitions. [2019-09-10 07:16:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:16:45,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:45,764 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] [2019-09-10 07:16:45,764 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:45,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1883359786, now seen corresponding path program 1 times [2019-09-10 07:16:45,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:45,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:45,864 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 07:16:45,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:45,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:45,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:45,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:45,868 INFO L87 Difference]: Start difference. First operand 208903 states and 293104 transitions. Second operand 7 states. [2019-09-10 07:16:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:48,102 INFO L93 Difference]: Finished difference Result 765061 states and 1065523 transitions. [2019-09-10 07:16:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:16:48,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:16:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:50,992 INFO L225 Difference]: With dead ends: 765061 [2019-09-10 07:16:50,992 INFO L226 Difference]: Without dead ends: 765061 [2019-09-10 07:16:50,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:16:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765061 states. [2019-09-10 07:16:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765061 to 209003. [2019-09-10 07:16:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209003 states. [2019-09-10 07:16:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209003 states to 209003 states and 293224 transitions. [2019-09-10 07:16:59,929 INFO L78 Accepts]: Start accepts. Automaton has 209003 states and 293224 transitions. Word has length 90 [2019-09-10 07:16:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:59,929 INFO L475 AbstractCegarLoop]: Abstraction has 209003 states and 293224 transitions. [2019-09-10 07:16:59,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:16:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 209003 states and 293224 transitions. [2019-09-10 07:16:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:16:59,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:59,943 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] [2019-09-10 07:16:59,944 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash 633216594, now seen corresponding path program 1 times [2019-09-10 07:16:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:59,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:59,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:59,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:00,040 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 07:17:00,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:00,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:00,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:00,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:00,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:00,042 INFO L87 Difference]: Start difference. First operand 209003 states and 293224 transitions. Second operand 7 states. [2019-09-10 07:17:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:03,398 INFO L93 Difference]: Finished difference Result 1033333 states and 1434055 transitions. [2019-09-10 07:17:03,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:03,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:17:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:06,634 INFO L225 Difference]: With dead ends: 1033333 [2019-09-10 07:17:06,634 INFO L226 Difference]: Without dead ends: 1033333 [2019-09-10 07:17:06,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:17:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033333 states. [2019-09-10 07:17:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033333 to 209871. [2019-09-10 07:17:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209871 states. [2019-09-10 07:17:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209871 states to 209871 states and 294325 transitions. [2019-09-10 07:17:21,562 INFO L78 Accepts]: Start accepts. Automaton has 209871 states and 294325 transitions. Word has length 91 [2019-09-10 07:17:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:21,562 INFO L475 AbstractCegarLoop]: Abstraction has 209871 states and 294325 transitions. [2019-09-10 07:17:21,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 209871 states and 294325 transitions. [2019-09-10 07:17:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:21,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:21,580 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] [2019-09-10 07:17:21,580 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash 682866744, now seen corresponding path program 1 times [2019-09-10 07:17:21,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:21,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:21,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:21,722 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 07:17:21,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:21,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:21,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:21,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:21,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:21,725 INFO L87 Difference]: Start difference. First operand 209871 states and 294325 transitions. Second operand 7 states. [2019-09-10 07:17:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:24,471 INFO L93 Difference]: Finished difference Result 795407 states and 1115069 transitions. [2019-09-10 07:17:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:17:24,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:17:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:32,349 INFO L225 Difference]: With dead ends: 795407 [2019-09-10 07:17:32,350 INFO L226 Difference]: Without dead ends: 795407 [2019-09-10 07:17:32,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:17:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795407 states. [2019-09-10 07:17:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795407 to 249273. [2019-09-10 07:17:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249273 states. [2019-09-10 07:17:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249273 states to 249273 states and 349117 transitions. [2019-09-10 07:17:38,175 INFO L78 Accepts]: Start accepts. Automaton has 249273 states and 349117 transitions. Word has length 92 [2019-09-10 07:17:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:38,175 INFO L475 AbstractCegarLoop]: Abstraction has 249273 states and 349117 transitions. [2019-09-10 07:17:38,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 249273 states and 349117 transitions. [2019-09-10 07:17:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:38,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:38,191 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] [2019-09-10 07:17:38,192 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash -150906399, now seen corresponding path program 1 times [2019-09-10 07:17:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:38,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:38,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:38,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:39,189 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 07:17:39,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:39,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:39,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:39,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:39,191 INFO L87 Difference]: Start difference. First operand 249273 states and 349117 transitions. Second operand 7 states. [2019-09-10 07:17:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:48,266 INFO L93 Difference]: Finished difference Result 804713 states and 1126505 transitions. [2019-09-10 07:17:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:17:48,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:17:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:49,483 INFO L225 Difference]: With dead ends: 804713 [2019-09-10 07:17:49,483 INFO L226 Difference]: Without dead ends: 804713 [2019-09-10 07:17:49,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804713 states. [2019-09-10 07:17:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804713 to 291161. [2019-09-10 07:17:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291161 states. [2019-09-10 07:17:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291161 states to 291161 states and 408215 transitions. [2019-09-10 07:17:56,261 INFO L78 Accepts]: Start accepts. Automaton has 291161 states and 408215 transitions. Word has length 92 [2019-09-10 07:17:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:56,261 INFO L475 AbstractCegarLoop]: Abstraction has 291161 states and 408215 transitions. [2019-09-10 07:17:56,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 291161 states and 408215 transitions. [2019-09-10 07:17:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:56,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:56,277 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] [2019-09-10 07:17:56,277 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1836656065, now seen corresponding path program 1 times [2019-09-10 07:17:56,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:56,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:56,426 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 07:17:56,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:56,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:56,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:56,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:56,428 INFO L87 Difference]: Start difference. First operand 291161 states and 408215 transitions. Second operand 7 states. [2019-09-10 07:17:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:59,951 INFO L93 Difference]: Finished difference Result 813607 states and 1139753 transitions. [2019-09-10 07:17:59,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:17:59,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:17:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:01,279 INFO L225 Difference]: With dead ends: 813607 [2019-09-10 07:18:01,279 INFO L226 Difference]: Without dead ends: 813607 [2019-09-10 07:18:01,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:18:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813607 states. [2019-09-10 07:18:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813607 to 330561. [2019-09-10 07:18:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330561 states. [2019-09-10 07:18:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330561 states to 330561 states and 463540 transitions. [2019-09-10 07:18:18,692 INFO L78 Accepts]: Start accepts. Automaton has 330561 states and 463540 transitions. Word has length 92 [2019-09-10 07:18:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:18,693 INFO L475 AbstractCegarLoop]: Abstraction has 330561 states and 463540 transitions. [2019-09-10 07:18:18,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 330561 states and 463540 transitions. [2019-09-10 07:18:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:18,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:18,709 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] [2019-09-10 07:18:18,709 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1617894879, now seen corresponding path program 1 times [2019-09-10 07:18:18,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:18,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:18,861 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 07:18:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:18,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:18,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:18,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:18,863 INFO L87 Difference]: Start difference. First operand 330561 states and 463540 transitions. Second operand 7 states. [2019-09-10 07:18:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:28,183 INFO L93 Difference]: Finished difference Result 857233 states and 1200236 transitions. [2019-09-10 07:18:28,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:18:28,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:18:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:29,485 INFO L225 Difference]: With dead ends: 857233 [2019-09-10 07:18:29,485 INFO L226 Difference]: Without dead ends: 857233 [2019-09-10 07:18:29,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857233 states. [2019-09-10 07:18:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857233 to 384965. [2019-09-10 07:18:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384965 states. [2019-09-10 07:18:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384965 states to 384965 states and 540415 transitions. [2019-09-10 07:18:37,411 INFO L78 Accepts]: Start accepts. Automaton has 384965 states and 540415 transitions. Word has length 92 [2019-09-10 07:18:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:37,412 INFO L475 AbstractCegarLoop]: Abstraction has 384965 states and 540415 transitions. [2019-09-10 07:18:37,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 384965 states and 540415 transitions. [2019-09-10 07:18:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:18:37,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:37,427 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] [2019-09-10 07:18:37,427 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1969136391, now seen corresponding path program 1 times [2019-09-10 07:18:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:37,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:37,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:37,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:37,578 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 07:18:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:37,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:37,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:37,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:37,580 INFO L87 Difference]: Start difference. First operand 384965 states and 540415 transitions. Second operand 7 states. [2019-09-10 07:18:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:46,886 INFO L93 Difference]: Finished difference Result 864237 states and 1210668 transitions. [2019-09-10 07:18:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:18:46,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-09-10 07:18:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:48,463 INFO L225 Difference]: With dead ends: 864237 [2019-09-10 07:18:48,463 INFO L226 Difference]: Without dead ends: 864237 [2019-09-10 07:18:48,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:18:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864237 states. [2019-09-10 07:18:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864237 to 418969. [2019-09-10 07:18:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418969 states. [2019-09-10 07:18:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418969 states to 418969 states and 588467 transitions. [2019-09-10 07:18:58,438 INFO L78 Accepts]: Start accepts. Automaton has 418969 states and 588467 transitions. Word has length 93 [2019-09-10 07:18:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:58,438 INFO L475 AbstractCegarLoop]: Abstraction has 418969 states and 588467 transitions. [2019-09-10 07:18:58,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 418969 states and 588467 transitions. [2019-09-10 07:18:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:18:58,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:58,465 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] [2019-09-10 07:18:58,465 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 276264736, now seen corresponding path program 1 times [2019-09-10 07:18:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:58,668 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 07:18:58,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:58,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:18:58,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:58,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:18:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:18:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:18:58,670 INFO L87 Difference]: Start difference. First operand 418969 states and 588467 transitions. Second operand 10 states. [2019-09-10 07:19:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:15,973 INFO L93 Difference]: Finished difference Result 1408398 states and 1972776 transitions. [2019-09-10 07:19:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:19:15,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:19:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:18,439 INFO L225 Difference]: With dead ends: 1408398 [2019-09-10 07:19:18,440 INFO L226 Difference]: Without dead ends: 1408398 [2019-09-10 07:19:18,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:19:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408398 states. [2019-09-10 07:19:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408398 to 417991. [2019-09-10 07:19:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417991 states. [2019-09-10 07:19:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417991 states to 417991 states and 587107 transitions. [2019-09-10 07:19:31,509 INFO L78 Accepts]: Start accepts. Automaton has 417991 states and 587107 transitions. Word has length 97 [2019-09-10 07:19:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:31,510 INFO L475 AbstractCegarLoop]: Abstraction has 417991 states and 587107 transitions. [2019-09-10 07:19:31,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:19:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 417991 states and 587107 transitions. [2019-09-10 07:19:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:19:31,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:31,532 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] [2019-09-10 07:19:31,532 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1177238946, now seen corresponding path program 1 times [2019-09-10 07:19:31,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:31,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:31,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:31,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:31,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:32,882 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2019-09-10 07:19:32,945 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 07:19:32,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:32,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:19:32,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:32,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:19:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:19:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:19:32,947 INFO L87 Difference]: Start difference. First operand 417991 states and 587107 transitions. Second operand 10 states. [2019-09-10 07:19:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:47,715 INFO L93 Difference]: Finished difference Result 1983941 states and 2769376 transitions. [2019-09-10 07:19:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:19:47,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:19:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:01,043 INFO L225 Difference]: With dead ends: 1983941 [2019-09-10 07:20:01,043 INFO L226 Difference]: Without dead ends: 1983941 [2019-09-10 07:20:01,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:20:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983941 states. [2019-09-10 07:20:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983941 to 417041. [2019-09-10 07:20:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417041 states. [2019-09-10 07:20:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417041 states to 417041 states and 585742 transitions. [2019-09-10 07:20:17,868 INFO L78 Accepts]: Start accepts. Automaton has 417041 states and 585742 transitions. Word has length 97 [2019-09-10 07:20:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:17,869 INFO L475 AbstractCegarLoop]: Abstraction has 417041 states and 585742 transitions. [2019-09-10 07:20:17,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:20:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 417041 states and 585742 transitions. [2019-09-10 07:20:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:20:17,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:17,885 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] [2019-09-10 07:20:17,885 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 426681605, now seen corresponding path program 1 times [2019-09-10 07:20:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:17,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:17,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:18,094 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 07:20:18,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:18,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:20:18,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:18,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:20:18,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:20:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:20:18,095 INFO L87 Difference]: Start difference. First operand 417041 states and 585742 transitions. Second operand 10 states. [2019-09-10 07:20:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:29,395 INFO L93 Difference]: Finished difference Result 1924567 states and 2686458 transitions. [2019-09-10 07:20:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:20:29,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:20:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:47,169 INFO L225 Difference]: With dead ends: 1924567 [2019-09-10 07:20:47,170 INFO L226 Difference]: Without dead ends: 1924567 [2019-09-10 07:20:47,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:20:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924567 states. [2019-09-10 07:21:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924567 to 416543. [2019-09-10 07:21:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416543 states. [2019-09-10 07:21:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416543 states to 416543 states and 584944 transitions. [2019-09-10 07:21:03,096 INFO L78 Accepts]: Start accepts. Automaton has 416543 states and 584944 transitions. Word has length 97 [2019-09-10 07:21:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:03,097 INFO L475 AbstractCegarLoop]: Abstraction has 416543 states and 584944 transitions. [2019-09-10 07:21:03,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:21:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 416543 states and 584944 transitions. [2019-09-10 07:21:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:21:03,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:03,113 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] [2019-09-10 07:21:03,113 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash -103950007, now seen corresponding path program 1 times [2019-09-10 07:21:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:03,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:03,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:04,448 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 07:21:04,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:04,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:21:04,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:04,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:21:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:21:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:21:04,450 INFO L87 Difference]: Start difference. First operand 416543 states and 584944 transitions. Second operand 10 states. [2019-09-10 07:21:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:18,691 INFO L93 Difference]: Finished difference Result 1941065 states and 2699508 transitions. [2019-09-10 07:21:18,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:21:18,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-10 07:21:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:23,589 INFO L225 Difference]: With dead ends: 1941065 [2019-09-10 07:21:23,589 INFO L226 Difference]: Without dead ends: 1941065 [2019-09-10 07:21:23,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:21:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941065 states. [2019-09-10 07:21:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941065 to 416636. [2019-09-10 07:21:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416636 states. [2019-09-10 07:21:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416636 states to 416636 states and 584894 transitions. [2019-09-10 07:21:50,887 INFO L78 Accepts]: Start accepts. Automaton has 416636 states and 584894 transitions. Word has length 97 [2019-09-10 07:21:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:50,887 INFO L475 AbstractCegarLoop]: Abstraction has 416636 states and 584894 transitions. [2019-09-10 07:21:50,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:21:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 416636 states and 584894 transitions. [2019-09-10 07:21:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:21:50,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:50,900 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] [2019-09-10 07:21:50,900 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash -156174122, now seen corresponding path program 1 times [2019-09-10 07:21:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:50,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:51,474 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 07:21:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:51,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:21:51,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:51,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:21:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:21:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:21:51,476 INFO L87 Difference]: Start difference. First operand 416636 states and 584894 transitions. Second operand 14 states. [2019-09-10 07:21:51,946 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:21:52,136 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:21:52,362 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:21:52,560 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:21:52,819 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:21:53,229 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:21:53,787 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 07:21:54,097 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:22:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:02,397 INFO L93 Difference]: Finished difference Result 1741952 states and 2424058 transitions. [2019-09-10 07:22:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:22:02,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-09-10 07:22:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:17,553 INFO L225 Difference]: With dead ends: 1741952 [2019-09-10 07:22:17,553 INFO L226 Difference]: Without dead ends: 1741952 [2019-09-10 07:22:17,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:22:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741952 states. [2019-09-10 07:22:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741952 to 416844. [2019-09-10 07:22:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416844 states. [2019-09-10 07:22:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416844 states to 416844 states and 585206 transitions. [2019-09-10 07:22:30,019 INFO L78 Accepts]: Start accepts. Automaton has 416844 states and 585206 transitions. Word has length 98 [2019-09-10 07:22:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:30,019 INFO L475 AbstractCegarLoop]: Abstraction has 416844 states and 585206 transitions. [2019-09-10 07:22:30,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:22:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 416844 states and 585206 transitions. [2019-09-10 07:22:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:22:30,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:30,032 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] [2019-09-10 07:22:30,032 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:30,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash 492290689, now seen corresponding path program 1 times [2019-09-10 07:22:30,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:30,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:30,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:30,501 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 07:22:30,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:30,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:22:30,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:30,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:22:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:22:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:22:30,502 INFO L87 Difference]: Start difference. First operand 416844 states and 585206 transitions. Second operand 13 states. [2019-09-10 07:22:31,009 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:22:31,176 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:22:31,362 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:22:31,613 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:22:31,840 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:22:32,084 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:22:32,272 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:22:32,502 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:22:36,667 WARN L188 SmtUtils]: Spent 3.97 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:22:37,028 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:22:37,629 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 07:22:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:56,948 INFO L93 Difference]: Finished difference Result 2590383 states and 3617918 transitions. [2019-09-10 07:22:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:22:56,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-09-10 07:22:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:00,900 INFO L225 Difference]: With dead ends: 2590383 [2019-09-10 07:23:00,901 INFO L226 Difference]: Without dead ends: 2590383 [2019-09-10 07:23:00,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:23:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590383 states. [2019-09-10 07:23:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590383 to 416585. [2019-09-10 07:23:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416585 states. [2019-09-10 07:23:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416585 states to 416585 states and 584864 transitions. [2019-09-10 07:23:20,415 INFO L78 Accepts]: Start accepts. Automaton has 416585 states and 584864 transitions. Word has length 98 [2019-09-10 07:23:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:20,416 INFO L475 AbstractCegarLoop]: Abstraction has 416585 states and 584864 transitions. [2019-09-10 07:23:20,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:23:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 416585 states and 584864 transitions. [2019-09-10 07:23:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:23:20,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:20,427 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] [2019-09-10 07:23:20,428 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:20,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash -103197581, now seen corresponding path program 1 times [2019-09-10 07:23:20,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:20,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:20,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:20,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:20,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:22,474 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 07:23:22,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:22,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:23:22,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:22,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:23:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:23:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:23:22,475 INFO L87 Difference]: Start difference. First operand 416585 states and 584864 transitions. Second operand 12 states. [2019-09-10 07:23:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:28,220 INFO L93 Difference]: Finished difference Result 1335685 states and 1875237 transitions. [2019-09-10 07:23:28,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:23:28,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 07:23:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:30,018 INFO L225 Difference]: With dead ends: 1335685 [2019-09-10 07:23:30,018 INFO L226 Difference]: Without dead ends: 1335685 [2019-09-10 07:23:30,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:23:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335685 states. [2019-09-10 07:23:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335685 to 409738. [2019-09-10 07:23:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409738 states. [2019-09-10 07:23:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409738 states to 409738 states and 575526 transitions. [2019-09-10 07:23:50,699 INFO L78 Accepts]: Start accepts. Automaton has 409738 states and 575526 transitions. Word has length 98 [2019-09-10 07:23:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:50,699 INFO L475 AbstractCegarLoop]: Abstraction has 409738 states and 575526 transitions. [2019-09-10 07:23:50,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:23:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 409738 states and 575526 transitions. [2019-09-10 07:23:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:23:50,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:50,710 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] [2019-09-10 07:23:50,711 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:50,711 INFO L82 PathProgramCache]: Analyzing trace with hash -953702332, now seen corresponding path program 1 times [2019-09-10 07:23:50,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:50,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:50,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:50,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:50,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:50,756 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 07:23:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:50,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:50,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:50,757 INFO L87 Difference]: Start difference. First operand 409738 states and 575526 transitions. Second operand 3 states. [2019-09-10 07:23:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:53,901 INFO L93 Difference]: Finished difference Result 641423 states and 899461 transitions. [2019-09-10 07:23:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:53,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:23:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:54,735 INFO L225 Difference]: With dead ends: 641423 [2019-09-10 07:23:54,735 INFO L226 Difference]: Without dead ends: 641423 [2019-09-10 07:23:54,736 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 07:23:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641423 states. [2019-09-10 07:24:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641423 to 507789. [2019-09-10 07:24:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507789 states. [2019-09-10 07:24:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507789 states to 507789 states and 713630 transitions. [2019-09-10 07:24:08,001 INFO L78 Accepts]: Start accepts. Automaton has 507789 states and 713630 transitions. Word has length 99 [2019-09-10 07:24:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:08,001 INFO L475 AbstractCegarLoop]: Abstraction has 507789 states and 713630 transitions. [2019-09-10 07:24:08,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 507789 states and 713630 transitions. [2019-09-10 07:24:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:24:08,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:08,013 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] [2019-09-10 07:24:08,013 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1810569633, now seen corresponding path program 1 times [2019-09-10 07:24:08,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:08,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:08,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:08,054 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 07:24:08,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:08,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:08,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:08,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:08,056 INFO L87 Difference]: Start difference. First operand 507789 states and 713630 transitions. Second operand 3 states. [2019-09-10 07:24:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:11,284 INFO L93 Difference]: Finished difference Result 773950 states and 1084822 transitions. [2019-09-10 07:24:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:11,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:24:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:12,319 INFO L225 Difference]: With dead ends: 773950 [2019-09-10 07:24:12,319 INFO L226 Difference]: Without dead ends: 773950 [2019-09-10 07:24:12,320 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 07:24:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773950 states. [2019-09-10 07:24:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773950 to 484774. [2019-09-10 07:24:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484774 states. [2019-09-10 07:24:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484774 states to 484774 states and 680939 transitions. [2019-09-10 07:24:28,236 INFO L78 Accepts]: Start accepts. Automaton has 484774 states and 680939 transitions. Word has length 99 [2019-09-10 07:24:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:28,236 INFO L475 AbstractCegarLoop]: Abstraction has 484774 states and 680939 transitions. [2019-09-10 07:24:28,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 484774 states and 680939 transitions. [2019-09-10 07:24:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:28,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:28,249 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] [2019-09-10 07:24:28,249 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash 869323896, now seen corresponding path program 1 times [2019-09-10 07:24:28,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:28,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:28,300 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 07:24:28,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:28,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:28,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:28,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:28,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:28,301 INFO L87 Difference]: Start difference. First operand 484774 states and 680939 transitions. Second operand 3 states. [2019-09-10 07:24:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:31,022 INFO L93 Difference]: Finished difference Result 453399 states and 631160 transitions. [2019-09-10 07:24:31,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:31,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:24:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:31,605 INFO L225 Difference]: With dead ends: 453399 [2019-09-10 07:24:31,605 INFO L226 Difference]: Without dead ends: 453399 [2019-09-10 07:24:31,606 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 07:24:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453399 states. [2019-09-10 07:24:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453399 to 453397. [2019-09-10 07:24:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453397 states. [2019-09-10 07:24:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453397 states to 453397 states and 631159 transitions. [2019-09-10 07:24:42,844 INFO L78 Accepts]: Start accepts. Automaton has 453397 states and 631159 transitions. Word has length 101 [2019-09-10 07:24:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:42,844 INFO L475 AbstractCegarLoop]: Abstraction has 453397 states and 631159 transitions. [2019-09-10 07:24:42,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 453397 states and 631159 transitions. [2019-09-10 07:24:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:24:42,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:42,858 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] [2019-09-10 07:24:42,858 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1241798026, now seen corresponding path program 1 times [2019-09-10 07:24:42,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:42,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:42,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:42,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:42,902 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 07:24:42,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:42,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:42,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:42,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:42,904 INFO L87 Difference]: Start difference. First operand 453397 states and 631159 transitions. Second operand 3 states. [2019-09-10 07:24:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:45,604 INFO L93 Difference]: Finished difference Result 667282 states and 929964 transitions. [2019-09-10 07:24:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:45,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:24:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:46,648 INFO L225 Difference]: With dead ends: 667282 [2019-09-10 07:24:46,648 INFO L226 Difference]: Without dead ends: 667282 [2019-09-10 07:24:46,648 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 07:24:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667282 states. [2019-09-10 07:25:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667282 to 665714. [2019-09-10 07:25:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665714 states. [2019-09-10 07:25:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665714 states to 665714 states and 928397 transitions. [2019-09-10 07:25:04,234 INFO L78 Accepts]: Start accepts. Automaton has 665714 states and 928397 transitions. Word has length 102 [2019-09-10 07:25:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:04,234 INFO L475 AbstractCegarLoop]: Abstraction has 665714 states and 928397 transitions. [2019-09-10 07:25:04,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 665714 states and 928397 transitions. [2019-09-10 07:25:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:25:04,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:04,247 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] [2019-09-10 07:25:04,247 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1201666180, now seen corresponding path program 1 times [2019-09-10 07:25:04,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:04,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:04,284 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 07:25:04,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:04,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:04,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:04,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:04,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:04,287 INFO L87 Difference]: Start difference. First operand 665714 states and 928397 transitions. Second operand 3 states. [2019-09-10 07:25:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:07,631 INFO L93 Difference]: Finished difference Result 919483 states and 1279477 transitions. [2019-09-10 07:25:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:07,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:25:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:08,976 INFO L225 Difference]: With dead ends: 919483 [2019-09-10 07:25:08,976 INFO L226 Difference]: Without dead ends: 919483 [2019-09-10 07:25:08,976 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 07:25:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919483 states.