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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:07:23,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:07:23,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:07:23,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:07:23,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:07:23,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:07:23,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:07:23,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:07:23,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:07:23,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:07:23,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:07:23,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:07:23,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:07:23,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:07:23,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:07:23,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:07:23,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:07:23,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:07:23,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:07:23,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:07:23,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:07:23,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:07:23,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:07:23,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:07:23,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:07:23,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:07:23,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:07:23,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:07:23,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:07:23,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:07:23,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:07:23,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:07:23,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:07:23,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:07:23,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:07:23,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:07:23,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:07:23,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:07:23,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:07:23,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:07:23,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:07:23,714 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:07:23,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:07:23,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:07:23,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:07:23,729 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:07:23,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:07:23,730 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:07:23,730 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:07:23,731 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:07:23,731 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:07:23,731 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:07:23,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:07:23,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:07:23,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:07:23,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:07:23,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:07:23,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:07:23,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:07:23,733 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:07:23,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:07:23,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:07:23,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:07:23,734 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:07:23,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:07:23,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:07:23,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:07:23,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:07:23,735 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:07:23,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:07:23,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:07:23,735 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:07:23,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:07:23,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:07:23,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:07:23,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:07:23,781 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:07:23,782 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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:07:23,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f830b4daa/c707de3729d34c2b86429381e281c767/FLAG025183dd8 [2019-09-10 07:07:24,435 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:07:24,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:07:24,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f830b4daa/c707de3729d34c2b86429381e281c767/FLAG025183dd8 [2019-09-10 07:07:24,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f830b4daa/c707de3729d34c2b86429381e281c767 [2019-09-10 07:07:24,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:07:24,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:07:24,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:07:24,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:07:24,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:07:24,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:07:24" (1/1) ... [2019-09-10 07:07:24,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a379ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:24, skipping insertion in model container [2019-09-10 07:07:24,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:07:24" (1/1) ... [2019-09-10 07:07:24,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:07:24,754 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:07:25,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:07:25,235 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:07:25,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:07:25,394 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:07:25,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25 WrapperNode [2019-09-10 07:07:25,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:07:25,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:07:25,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:07:25,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:07:25,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (1/1) ... [2019-09-10 07:07:25,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:07:25,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:07:25,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:07:25,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:07:25,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (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:07:25,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:07:25,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:07:25,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:07:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:07:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:07:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:07:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:07:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:07:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:07:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:07:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:07:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:07:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:07:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:07:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:07:25,571 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:07:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:07:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:07:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:07:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:07:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:07:26,811 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:07:26,812 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:07:26,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:07:26 BoogieIcfgContainer [2019-09-10 07:07:26,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:07:26,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:07:26,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:07:26,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:07:26,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:07:24" (1/3) ... [2019-09-10 07:07:26,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2068572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:07:26, skipping insertion in model container [2019-09-10 07:07:26,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:07:25" (2/3) ... [2019-09-10 07:07:26,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2068572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:07:26, skipping insertion in model container [2019-09-10 07:07:26,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:07:26" (3/3) ... [2019-09-10 07:07:26,831 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:07:26,844 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:07:26,870 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:07:26,891 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:07:26,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:07:26,927 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:07:26,927 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:07:26,927 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:07:26,928 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:07:26,928 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:07:26,928 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:07:26,928 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:07:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-09-10 07:07:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:27,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:27,003 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] [2019-09-10 07:07:27,005 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2015518254, now seen corresponding path program 1 times [2019-09-10 07:07:27,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:27,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:27,545 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:07:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:27,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:27,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:27,574 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 3 states. [2019-09-10 07:07:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:27,707 INFO L93 Difference]: Finished difference Result 340 states and 560 transitions. [2019-09-10 07:07:27,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:27,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:07:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:27,730 INFO L225 Difference]: With dead ends: 340 [2019-09-10 07:07:27,731 INFO L226 Difference]: Without dead ends: 332 [2019-09-10 07:07:27,734 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:07:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-10 07:07:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-09-10 07:07:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 07:07:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 494 transitions. [2019-09-10 07:07:27,827 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 494 transitions. Word has length 84 [2019-09-10 07:07:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:27,828 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 494 transitions. [2019-09-10 07:07:27,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 494 transitions. [2019-09-10 07:07:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:07:27,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:27,833 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:07:27,833 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2072558176, now seen corresponding path program 1 times [2019-09-10 07:07:27,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:27,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:28,135 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:07:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:07:28,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:28,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:07:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:07:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:07:28,140 INFO L87 Difference]: Start difference. First operand 330 states and 494 transitions. Second operand 7 states. [2019-09-10 07:07:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:28,514 INFO L93 Difference]: Finished difference Result 1170 states and 1799 transitions. [2019-09-10 07:07:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:07:28,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-10 07:07:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:28,524 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 07:07:28,524 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 07:07:28,525 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:07:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 07:07:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1162. [2019-09-10 07:07:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-09-10 07:07:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1795 transitions. [2019-09-10 07:07:28,614 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1795 transitions. Word has length 85 [2019-09-10 07:07:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:28,614 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1795 transitions. [2019-09-10 07:07:28,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:07:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1795 transitions. [2019-09-10 07:07:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:28,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:28,625 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:07:28,627 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:28,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1529357462, now seen corresponding path program 1 times [2019-09-10 07:07:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:28,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:28,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:28,830 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:07:28,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:28,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:07:28,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:28,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:07:28,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:07:28,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:07:28,836 INFO L87 Difference]: Start difference. First operand 1162 states and 1795 transitions. Second operand 6 states. [2019-09-10 07:07:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:29,261 INFO L93 Difference]: Finished difference Result 2874 states and 4492 transitions. [2019-09-10 07:07:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:29,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:07:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:29,282 INFO L225 Difference]: With dead ends: 2874 [2019-09-10 07:07:29,282 INFO L226 Difference]: Without dead ends: 2874 [2019-09-10 07:07:29,283 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:07:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-09-10 07:07:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2870. [2019-09-10 07:07:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2019-09-10 07:07:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 4490 transitions. [2019-09-10 07:07:29,378 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 4490 transitions. Word has length 86 [2019-09-10 07:07:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:29,379 INFO L475 AbstractCegarLoop]: Abstraction has 2870 states and 4490 transitions. [2019-09-10 07:07:29,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:07:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 4490 transitions. [2019-09-10 07:07:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:29,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:29,386 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:07:29,387 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 792250185, now seen corresponding path program 1 times [2019-09-10 07:07:29,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:29,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:29,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:29,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:29,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:07:29,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:29,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:29,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:29,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:29,558 INFO L87 Difference]: Start difference. First operand 2870 states and 4490 transitions. Second operand 5 states. [2019-09-10 07:07:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:29,960 INFO L93 Difference]: Finished difference Result 5186 states and 8127 transitions. [2019-09-10 07:07:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:29,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:07:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:29,999 INFO L225 Difference]: With dead ends: 5186 [2019-09-10 07:07:30,000 INFO L226 Difference]: Without dead ends: 5186 [2019-09-10 07:07:30,000 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:07:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2019-09-10 07:07:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5184. [2019-09-10 07:07:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2019-09-10 07:07:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 8126 transitions. [2019-09-10 07:07:30,170 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 8126 transitions. Word has length 86 [2019-09-10 07:07:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:30,171 INFO L475 AbstractCegarLoop]: Abstraction has 5184 states and 8126 transitions. [2019-09-10 07:07:30,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 8126 transitions. [2019-09-10 07:07:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:30,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:30,176 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:07:30,176 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1699352504, now seen corresponding path program 1 times [2019-09-10 07:07:30,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:30,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:30,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:30,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:30,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:30,312 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:07:30,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:30,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:30,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:30,315 INFO L87 Difference]: Start difference. First operand 5184 states and 8126 transitions. Second operand 5 states. [2019-09-10 07:07:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:30,717 INFO L93 Difference]: Finished difference Result 9834 states and 15382 transitions. [2019-09-10 07:07:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:30,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:07:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:30,772 INFO L225 Difference]: With dead ends: 9834 [2019-09-10 07:07:30,773 INFO L226 Difference]: Without dead ends: 9834 [2019-09-10 07:07:30,773 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:07:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2019-09-10 07:07:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9832. [2019-09-10 07:07:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9832 states. [2019-09-10 07:07:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 15381 transitions. [2019-09-10 07:07:31,011 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 15381 transitions. Word has length 86 [2019-09-10 07:07:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:31,012 INFO L475 AbstractCegarLoop]: Abstraction has 9832 states and 15381 transitions. [2019-09-10 07:07:31,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 15381 transitions. [2019-09-10 07:07:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:31,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:31,016 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:07:31,017 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash -327564249, now seen corresponding path program 1 times [2019-09-10 07:07:31,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:31,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:31,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:31,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:31,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:31,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:31,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:31,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:31,127 INFO L87 Difference]: Start difference. First operand 9832 states and 15381 transitions. Second operand 5 states. [2019-09-10 07:07:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:31,460 INFO L93 Difference]: Finished difference Result 19228 states and 29964 transitions. [2019-09-10 07:07:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:31,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:07:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:31,537 INFO L225 Difference]: With dead ends: 19228 [2019-09-10 07:07:31,537 INFO L226 Difference]: Without dead ends: 19228 [2019-09-10 07:07:31,537 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:07:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19228 states. [2019-09-10 07:07:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19228 to 19226. [2019-09-10 07:07:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19226 states. [2019-09-10 07:07:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19226 states to 19226 states and 29963 transitions. [2019-09-10 07:07:31,986 INFO L78 Accepts]: Start accepts. Automaton has 19226 states and 29963 transitions. Word has length 86 [2019-09-10 07:07:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:31,988 INFO L475 AbstractCegarLoop]: Abstraction has 19226 states and 29963 transitions. [2019-09-10 07:07:31,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19226 states and 29963 transitions. [2019-09-10 07:07:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:07:31,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:31,998 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:07:32,006 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2020962565, now seen corresponding path program 1 times [2019-09-10 07:07:32,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:32,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:32,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:32,116 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:07:32,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:32,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:32,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:32,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:32,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:32,119 INFO L87 Difference]: Start difference. First operand 19226 states and 29963 transitions. Second operand 5 states. [2019-09-10 07:07:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:32,523 INFO L93 Difference]: Finished difference Result 38110 states and 59024 transitions. [2019-09-10 07:07:32,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:32,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:07:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:32,623 INFO L225 Difference]: With dead ends: 38110 [2019-09-10 07:07:32,624 INFO L226 Difference]: Without dead ends: 38110 [2019-09-10 07:07:32,624 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:07:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38110 states. [2019-09-10 07:07:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38110 to 38108. [2019-09-10 07:07:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38108 states. [2019-09-10 07:07:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38108 states to 38108 states and 59023 transitions. [2019-09-10 07:07:33,977 INFO L78 Accepts]: Start accepts. Automaton has 38108 states and 59023 transitions. Word has length 86 [2019-09-10 07:07:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:33,978 INFO L475 AbstractCegarLoop]: Abstraction has 38108 states and 59023 transitions. [2019-09-10 07:07:33,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 38108 states and 59023 transitions. [2019-09-10 07:07:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:07:33,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:33,989 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:07:33,989 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1584577227, now seen corresponding path program 1 times [2019-09-10 07:07:33,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:33,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:33,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:34,271 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:07:34,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:34,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:07:34,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:34,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:07:34,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:07:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:07:34,274 INFO L87 Difference]: Start difference. First operand 38108 states and 59023 transitions. Second operand 5 states. [2019-09-10 07:07:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:34,526 INFO L93 Difference]: Finished difference Result 71292 states and 109623 transitions. [2019-09-10 07:07:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:07:34,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-10 07:07:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:34,794 INFO L225 Difference]: With dead ends: 71292 [2019-09-10 07:07:34,794 INFO L226 Difference]: Without dead ends: 71292 [2019-09-10 07:07:34,795 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:07:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71292 states. [2019-09-10 07:07:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71292 to 38588. [2019-09-10 07:07:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38588 states. [2019-09-10 07:07:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38588 states to 38588 states and 59503 transitions. [2019-09-10 07:07:36,489 INFO L78 Accepts]: Start accepts. Automaton has 38588 states and 59503 transitions. Word has length 87 [2019-09-10 07:07:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:36,489 INFO L475 AbstractCegarLoop]: Abstraction has 38588 states and 59503 transitions. [2019-09-10 07:07:36,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:07:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 38588 states and 59503 transitions. [2019-09-10 07:07:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:07:36,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:36,501 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:07:36,501 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2139259668, now seen corresponding path program 1 times [2019-09-10 07:07:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:36,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:36,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:36,804 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:07:36,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:36,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:07:36,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:36,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:07:36,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:07:36,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:07:36,806 INFO L87 Difference]: Start difference. First operand 38588 states and 59503 transitions. Second operand 10 states. [2019-09-10 07:07:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:41,805 INFO L93 Difference]: Finished difference Result 302932 states and 467205 transitions. [2019-09-10 07:07:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 07:07:41,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:07:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:42,244 INFO L225 Difference]: With dead ends: 302932 [2019-09-10 07:07:42,244 INFO L226 Difference]: Without dead ends: 302932 [2019-09-10 07:07:42,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:07:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302932 states. [2019-09-10 07:07:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302932 to 38823. [2019-09-10 07:07:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38823 states. [2019-09-10 07:07:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38823 states to 38823 states and 59800 transitions. [2019-09-10 07:07:44,622 INFO L78 Accepts]: Start accepts. Automaton has 38823 states and 59800 transitions. Word has length 88 [2019-09-10 07:07:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:44,622 INFO L475 AbstractCegarLoop]: Abstraction has 38823 states and 59800 transitions. [2019-09-10 07:07:44,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:07:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 38823 states and 59800 transitions. [2019-09-10 07:07:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:07:44,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:44,639 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:07:44,639 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1011869172, now seen corresponding path program 1 times [2019-09-10 07:07:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:44,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:44,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:44,893 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:07:44,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:44,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:07:44,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:44,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:07:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:07:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:07:44,894 INFO L87 Difference]: Start difference. First operand 38823 states and 59800 transitions. Second operand 10 states. [2019-09-10 07:07:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:48,160 INFO L93 Difference]: Finished difference Result 200774 states and 307832 transitions. [2019-09-10 07:07:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:07:48,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:07:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:48,472 INFO L225 Difference]: With dead ends: 200774 [2019-09-10 07:07:48,472 INFO L226 Difference]: Without dead ends: 200774 [2019-09-10 07:07:48,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:07:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200774 states. [2019-09-10 07:07:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200774 to 38823. [2019-09-10 07:07:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38823 states. [2019-09-10 07:07:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38823 states to 38823 states and 59798 transitions. [2019-09-10 07:07:51,371 INFO L78 Accepts]: Start accepts. Automaton has 38823 states and 59798 transitions. Word has length 88 [2019-09-10 07:07:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:51,371 INFO L475 AbstractCegarLoop]: Abstraction has 38823 states and 59798 transitions. [2019-09-10 07:07:51,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:07:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 38823 states and 59798 transitions. [2019-09-10 07:07:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:07:51,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:51,382 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:07:51,382 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1484118612, now seen corresponding path program 1 times [2019-09-10 07:07:51,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:51,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:51,630 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:07:51,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:51,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:07:51,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:51,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:07:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:07:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:07:51,632 INFO L87 Difference]: Start difference. First operand 38823 states and 59798 transitions. Second operand 10 states. [2019-09-10 07:07:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:54,232 INFO L93 Difference]: Finished difference Result 112917 states and 171599 transitions. [2019-09-10 07:07:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:07:54,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:07:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:54,378 INFO L225 Difference]: With dead ends: 112917 [2019-09-10 07:07:54,378 INFO L226 Difference]: Without dead ends: 112917 [2019-09-10 07:07:54,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:07:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112917 states. [2019-09-10 07:07:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112917 to 39471. [2019-09-10 07:07:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39471 states. [2019-09-10 07:07:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39471 states to 39471 states and 60738 transitions. [2019-09-10 07:07:55,100 INFO L78 Accepts]: Start accepts. Automaton has 39471 states and 60738 transitions. Word has length 88 [2019-09-10 07:07:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:55,101 INFO L475 AbstractCegarLoop]: Abstraction has 39471 states and 60738 transitions. [2019-09-10 07:07:55,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:07:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 39471 states and 60738 transitions. [2019-09-10 07:07:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:07:55,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:55,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] [2019-09-10 07:07:55,109 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1369706164, now seen corresponding path program 1 times [2019-09-10 07:07:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:55,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:55,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:55,425 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-10 07:07:55,539 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:07:55,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:55,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:07:55,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:55,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:07:55,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:07:55,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:07:55,541 INFO L87 Difference]: Start difference. First operand 39471 states and 60738 transitions. Second operand 10 states. [2019-09-10 07:07:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:58,822 INFO L93 Difference]: Finished difference Result 246347 states and 376378 transitions. [2019-09-10 07:07:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:07:58,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:07:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:59,114 INFO L225 Difference]: With dead ends: 246347 [2019-09-10 07:07:59,114 INFO L226 Difference]: Without dead ends: 246347 [2019-09-10 07:07:59,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:07:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246347 states. [2019-09-10 07:08:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246347 to 40219. [2019-09-10 07:08:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40219 states. [2019-09-10 07:08:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40219 states to 40219 states and 61719 transitions. [2019-09-10 07:08:02,793 INFO L78 Accepts]: Start accepts. Automaton has 40219 states and 61719 transitions. Word has length 88 [2019-09-10 07:08:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:02,794 INFO L475 AbstractCegarLoop]: Abstraction has 40219 states and 61719 transitions. [2019-09-10 07:08:02,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:08:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40219 states and 61719 transitions. [2019-09-10 07:08:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:02,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:02,802 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:08:02,802 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash -28915572, now seen corresponding path program 1 times [2019-09-10 07:08:02,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:02,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:02,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:03,014 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:08:03,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:03,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:08:03,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:03,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:08:03,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:08:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:08:03,016 INFO L87 Difference]: Start difference. First operand 40219 states and 61719 transitions. Second operand 10 states. [2019-09-10 07:08:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:06,502 INFO L93 Difference]: Finished difference Result 248482 states and 378357 transitions. [2019-09-10 07:08:06,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:08:06,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:08:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:07,520 INFO L225 Difference]: With dead ends: 248482 [2019-09-10 07:08:07,521 INFO L226 Difference]: Without dead ends: 248482 [2019-09-10 07:08:07,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:08:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248482 states. [2019-09-10 07:08:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248482 to 40578. [2019-09-10 07:08:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-09-10 07:08:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 62130 transitions. [2019-09-10 07:08:11,551 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 62130 transitions. Word has length 88 [2019-09-10 07:08:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:11,551 INFO L475 AbstractCegarLoop]: Abstraction has 40578 states and 62130 transitions. [2019-09-10 07:08:11,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:08:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 62130 transitions. [2019-09-10 07:08:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:11,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:11,559 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:08:11,560 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash -849303856, now seen corresponding path program 1 times [2019-09-10 07:08:11,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:11,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:11,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:11,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:11,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:11,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:11,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:11,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:11,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:11,627 INFO L87 Difference]: Start difference. First operand 40578 states and 62130 transitions. Second operand 3 states. [2019-09-10 07:08:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:11,780 INFO L93 Difference]: Finished difference Result 50464 states and 76292 transitions. [2019-09-10 07:08:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:11,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:08:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:11,837 INFO L225 Difference]: With dead ends: 50464 [2019-09-10 07:08:11,837 INFO L226 Difference]: Without dead ends: 50464 [2019-09-10 07:08:11,838 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:08:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50464 states. [2019-09-10 07:08:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50464 to 50078. [2019-09-10 07:08:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50078 states. [2019-09-10 07:08:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50078 states to 50078 states and 75907 transitions. [2019-09-10 07:08:12,309 INFO L78 Accepts]: Start accepts. Automaton has 50078 states and 75907 transitions. Word has length 89 [2019-09-10 07:08:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:12,309 INFO L475 AbstractCegarLoop]: Abstraction has 50078 states and 75907 transitions. [2019-09-10 07:08:12,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states and 75907 transitions. [2019-09-10 07:08:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:12,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:12,319 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:08:12,319 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1873505628, now seen corresponding path program 1 times [2019-09-10 07:08:12,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:12,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:12,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:12,427 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:08:12,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:12,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:08:12,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:12,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:08:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:08:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:08:12,428 INFO L87 Difference]: Start difference. First operand 50078 states and 75907 transitions. Second operand 4 states. [2019-09-10 07:08:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:12,777 INFO L93 Difference]: Finished difference Result 91476 states and 137236 transitions. [2019-09-10 07:08:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:08:12,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 07:08:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:12,966 INFO L225 Difference]: With dead ends: 91476 [2019-09-10 07:08:12,966 INFO L226 Difference]: Without dead ends: 91476 [2019-09-10 07:08:12,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:08:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91476 states. [2019-09-10 07:08:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91476 to 90874. [2019-09-10 07:08:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90874 states. [2019-09-10 07:08:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90874 states to 90874 states and 136635 transitions. [2019-09-10 07:08:14,787 INFO L78 Accepts]: Start accepts. Automaton has 90874 states and 136635 transitions. Word has length 89 [2019-09-10 07:08:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:14,788 INFO L475 AbstractCegarLoop]: Abstraction has 90874 states and 136635 transitions. [2019-09-10 07:08:14,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:08:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 90874 states and 136635 transitions. [2019-09-10 07:08:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:14,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:14,797 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:08:14,797 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash 354142704, now seen corresponding path program 1 times [2019-09-10 07:08:14,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:14,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:14,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:14,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:08:14,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:14,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:14,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:14,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:14,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:14,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:14,866 INFO L87 Difference]: Start difference. First operand 90874 states and 136635 transitions. Second operand 3 states. [2019-09-10 07:08:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:15,487 INFO L93 Difference]: Finished difference Result 158805 states and 237570 transitions. [2019-09-10 07:08:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:15,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:08:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:15,806 INFO L225 Difference]: With dead ends: 158805 [2019-09-10 07:08:15,806 INFO L226 Difference]: Without dead ends: 158805 [2019-09-10 07:08:15,807 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:08:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158805 states. [2019-09-10 07:08:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158805 to 158539. [2019-09-10 07:08:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158539 states. [2019-09-10 07:08:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158539 states to 158539 states and 237305 transitions. [2019-09-10 07:08:18,244 INFO L78 Accepts]: Start accepts. Automaton has 158539 states and 237305 transitions. Word has length 89 [2019-09-10 07:08:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:18,244 INFO L475 AbstractCegarLoop]: Abstraction has 158539 states and 237305 transitions. [2019-09-10 07:08:18,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 158539 states and 237305 transitions. [2019-09-10 07:08:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:18,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:18,257 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:08:18,257 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1105953187, now seen corresponding path program 1 times [2019-09-10 07:08:18,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:18,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:18,310 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:08:18,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:18,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:18,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:18,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:18,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:18,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:18,312 INFO L87 Difference]: Start difference. First operand 158539 states and 237305 transitions. Second operand 3 states. [2019-09-10 07:08:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:18,732 INFO L93 Difference]: Finished difference Result 176247 states and 258850 transitions. [2019-09-10 07:08:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:18,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:08:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:19,096 INFO L225 Difference]: With dead ends: 176247 [2019-09-10 07:08:19,097 INFO L226 Difference]: Without dead ends: 174855 [2019-09-10 07:08:19,099 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:08:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174855 states. [2019-09-10 07:08:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174855 to 155053. [2019-09-10 07:08:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155053 states. [2019-09-10 07:08:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155053 states to 155053 states and 228609 transitions. [2019-09-10 07:08:23,656 INFO L78 Accepts]: Start accepts. Automaton has 155053 states and 228609 transitions. Word has length 89 [2019-09-10 07:08:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:23,656 INFO L475 AbstractCegarLoop]: Abstraction has 155053 states and 228609 transitions. [2019-09-10 07:08:23,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 155053 states and 228609 transitions. [2019-09-10 07:08:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:23,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:23,667 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:08:23,668 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1939422446, now seen corresponding path program 1 times [2019-09-10 07:08:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:23,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:23,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:23,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:23,723 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:08:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:23,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:23,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:23,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:23,725 INFO L87 Difference]: Start difference. First operand 155053 states and 228609 transitions. Second operand 3 states. [2019-09-10 07:08:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:24,100 INFO L93 Difference]: Finished difference Result 165034 states and 238187 transitions. [2019-09-10 07:08:24,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:24,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:08:24,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:24,297 INFO L225 Difference]: With dead ends: 165034 [2019-09-10 07:08:24,297 INFO L226 Difference]: Without dead ends: 165034 [2019-09-10 07:08:24,297 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:08:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165034 states. [2019-09-10 07:08:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165034 to 163412. [2019-09-10 07:08:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163412 states. [2019-09-10 07:08:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163412 states to 163412 states and 236566 transitions. [2019-09-10 07:08:26,486 INFO L78 Accepts]: Start accepts. Automaton has 163412 states and 236566 transitions. Word has length 89 [2019-09-10 07:08:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:26,487 INFO L475 AbstractCegarLoop]: Abstraction has 163412 states and 236566 transitions. [2019-09-10 07:08:26,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 163412 states and 236566 transitions. [2019-09-10 07:08:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:26,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:26,494 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:08:26,494 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1377715858, now seen corresponding path program 1 times [2019-09-10 07:08:26,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:26,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:26,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:26,545 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:08:26,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:26,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:26,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:26,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:26,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:26,547 INFO L87 Difference]: Start difference. First operand 163412 states and 236566 transitions. Second operand 3 states. [2019-09-10 07:08:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:27,015 INFO L93 Difference]: Finished difference Result 218687 states and 310839 transitions. [2019-09-10 07:08:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:27,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:08:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:27,258 INFO L225 Difference]: With dead ends: 218687 [2019-09-10 07:08:27,258 INFO L226 Difference]: Without dead ends: 218687 [2019-09-10 07:08:27,259 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:08:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218687 states. [2019-09-10 07:08:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218687 to 216925. [2019-09-10 07:08:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216925 states. [2019-09-10 07:08:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216925 states to 216925 states and 309078 transitions. [2019-09-10 07:08:32,614 INFO L78 Accepts]: Start accepts. Automaton has 216925 states and 309078 transitions. Word has length 89 [2019-09-10 07:08:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:32,614 INFO L475 AbstractCegarLoop]: Abstraction has 216925 states and 309078 transitions. [2019-09-10 07:08:32,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 216925 states and 309078 transitions. [2019-09-10 07:08:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:08:32,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:32,621 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:08:32,621 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:32,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2021811832, now seen corresponding path program 1 times [2019-09-10 07:08:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:32,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:33,388 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:08:33,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:33,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:33,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:33,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:33,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:33,390 INFO L87 Difference]: Start difference. First operand 216925 states and 309078 transitions. Second operand 7 states. [2019-09-10 07:08:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:36,083 INFO L93 Difference]: Finished difference Result 875042 states and 1236442 transitions. [2019-09-10 07:08:36,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:36,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:08:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:37,341 INFO L225 Difference]: With dead ends: 875042 [2019-09-10 07:08:37,342 INFO L226 Difference]: Without dead ends: 875042 [2019-09-10 07:08:37,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:08:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875042 states. [2019-09-10 07:08:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875042 to 217137. [2019-09-10 07:08:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217137 states. [2019-09-10 07:08:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217137 states to 217137 states and 309333 transitions. [2019-09-10 07:08:51,449 INFO L78 Accepts]: Start accepts. Automaton has 217137 states and 309333 transitions. Word has length 90 [2019-09-10 07:08:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:51,449 INFO L475 AbstractCegarLoop]: Abstraction has 217137 states and 309333 transitions. [2019-09-10 07:08:51,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 217137 states and 309333 transitions. [2019-09-10 07:08:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:08:51,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:51,457 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:08:51,457 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1199896505, now seen corresponding path program 1 times [2019-09-10 07:08:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:51,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:51,544 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:08:51,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:51,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:51,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:51,546 INFO L87 Difference]: Start difference. First operand 217137 states and 309333 transitions. Second operand 7 states. [2019-09-10 07:08:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:55,090 INFO L93 Difference]: Finished difference Result 672517 states and 946920 transitions. [2019-09-10 07:08:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:55,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:08:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:55,992 INFO L225 Difference]: With dead ends: 672517 [2019-09-10 07:08:55,993 INFO L226 Difference]: Without dead ends: 672517 [2019-09-10 07:08:55,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:08:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672517 states. [2019-09-10 07:09:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672517 to 272974. [2019-09-10 07:09:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272974 states. [2019-09-10 07:09:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272974 states to 272974 states and 388098 transitions. [2019-09-10 07:09:08,458 INFO L78 Accepts]: Start accepts. Automaton has 272974 states and 388098 transitions. Word has length 90 [2019-09-10 07:09:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:08,459 INFO L475 AbstractCegarLoop]: Abstraction has 272974 states and 388098 transitions. [2019-09-10 07:09:08,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 272974 states and 388098 transitions. [2019-09-10 07:09:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:09:08,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:08,466 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:09:08,466 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1439056758, now seen corresponding path program 1 times [2019-09-10 07:09:08,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:08,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:08,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:09:08,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:08,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:08,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:08,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:08,557 INFO L87 Difference]: Start difference. First operand 272974 states and 388098 transitions. Second operand 7 states. [2019-09-10 07:09:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:17,118 INFO L93 Difference]: Finished difference Result 1123674 states and 1577295 transitions. [2019-09-10 07:09:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:17,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:09:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:19,088 INFO L225 Difference]: With dead ends: 1123674 [2019-09-10 07:09:19,088 INFO L226 Difference]: Without dead ends: 1123674 [2019-09-10 07:09:19,089 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:09:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123674 states. [2019-09-10 07:09:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123674 to 273711. [2019-09-10 07:09:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273711 states. [2019-09-10 07:09:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273711 states to 273711 states and 388985 transitions. [2019-09-10 07:09:34,935 INFO L78 Accepts]: Start accepts. Automaton has 273711 states and 388985 transitions. Word has length 90 [2019-09-10 07:09:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:34,936 INFO L475 AbstractCegarLoop]: Abstraction has 273711 states and 388985 transitions. [2019-09-10 07:09:34,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 273711 states and 388985 transitions. [2019-09-10 07:09:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:09:34,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:34,945 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:09:34,945 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1741962972, now seen corresponding path program 1 times [2019-09-10 07:09:34,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:34,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:34,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:35,038 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:09:35,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:35,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:35,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:35,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:35,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:35,040 INFO L87 Difference]: Start difference. First operand 273711 states and 388985 transitions. Second operand 7 states. [2019-09-10 07:09:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:39,907 INFO L93 Difference]: Finished difference Result 1107940 states and 1556753 transitions. [2019-09-10 07:09:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:39,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:09:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:41,786 INFO L225 Difference]: With dead ends: 1107940 [2019-09-10 07:09:41,787 INFO L226 Difference]: Without dead ends: 1107940 [2019-09-10 07:09:41,787 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:09:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107940 states. [2019-09-10 07:09:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107940 to 274162. [2019-09-10 07:09:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274162 states. [2019-09-10 07:09:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274162 states to 274162 states and 389536 transitions. [2019-09-10 07:09:58,713 INFO L78 Accepts]: Start accepts. Automaton has 274162 states and 389536 transitions. Word has length 90 [2019-09-10 07:09:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:58,713 INFO L475 AbstractCegarLoop]: Abstraction has 274162 states and 389536 transitions. [2019-09-10 07:09:58,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 274162 states and 389536 transitions. [2019-09-10 07:09:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:09:58,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:58,723 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:09:58,723 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:58,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1333696040, now seen corresponding path program 1 times [2019-09-10 07:09:58,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:58,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:58,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:58,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:58,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:58,811 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:09:58,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:58,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:58,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:58,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:58,814 INFO L87 Difference]: Start difference. First operand 274162 states and 389536 transitions. Second operand 7 states. [2019-09-10 07:10:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:02,406 INFO L93 Difference]: Finished difference Result 837344 states and 1180523 transitions. [2019-09-10 07:10:02,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:02,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:10:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:03,751 INFO L225 Difference]: With dead ends: 837344 [2019-09-10 07:10:03,752 INFO L226 Difference]: Without dead ends: 837344 [2019-09-10 07:10:03,752 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:10:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837344 states. [2019-09-10 07:10:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837344 to 274282. [2019-09-10 07:10:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274282 states. [2019-09-10 07:10:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274282 states to 274282 states and 389680 transitions. [2019-09-10 07:10:17,732 INFO L78 Accepts]: Start accepts. Automaton has 274282 states and 389680 transitions. Word has length 90 [2019-09-10 07:10:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:17,733 INFO L475 AbstractCegarLoop]: Abstraction has 274282 states and 389680 transitions. [2019-09-10 07:10:17,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 274282 states and 389680 transitions. [2019-09-10 07:10:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:10:17,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:17,743 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:10:17,743 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1374139495, now seen corresponding path program 1 times [2019-09-10 07:10:17,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:17,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:17,899 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:10:17,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:17,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:17,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:17,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:17,900 INFO L87 Difference]: Start difference. First operand 274282 states and 389680 transitions. Second operand 7 states. [2019-09-10 07:10:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:23,057 INFO L93 Difference]: Finished difference Result 983394 states and 1396842 transitions. [2019-09-10 07:10:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:10:23,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:10:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:24,502 INFO L225 Difference]: With dead ends: 983394 [2019-09-10 07:10:24,502 INFO L226 Difference]: Without dead ends: 983394 [2019-09-10 07:10:24,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 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:10:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983394 states. [2019-09-10 07:10:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983394 to 311552. [2019-09-10 07:10:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311552 states. [2019-09-10 07:10:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311552 states to 311552 states and 443094 transitions. [2019-09-10 07:10:41,759 INFO L78 Accepts]: Start accepts. Automaton has 311552 states and 443094 transitions. Word has length 92 [2019-09-10 07:10:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:41,760 INFO L475 AbstractCegarLoop]: Abstraction has 311552 states and 443094 transitions. [2019-09-10 07:10:41,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 311552 states and 443094 transitions. [2019-09-10 07:10:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:10:41,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:41,767 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:10:41,767 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash -646849668, now seen corresponding path program 1 times [2019-09-10 07:10:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:41,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:41,887 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:10:41,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:41,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:41,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:41,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:41,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:41,889 INFO L87 Difference]: Start difference. First operand 311552 states and 443094 transitions. Second operand 7 states. [2019-09-10 07:10:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:49,908 INFO L93 Difference]: Finished difference Result 1024348 states and 1456136 transitions. [2019-09-10 07:10:49,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:10:49,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:10:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:51,292 INFO L225 Difference]: With dead ends: 1024348 [2019-09-10 07:10:51,292 INFO L226 Difference]: Without dead ends: 1024348 [2019-09-10 07:10:51,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:10:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024348 states. [2019-09-10 07:10:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024348 to 380680. [2019-09-10 07:10:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380680 states. [2019-09-10 07:11:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380680 states to 380680 states and 540912 transitions. [2019-09-10 07:11:00,480 INFO L78 Accepts]: Start accepts. Automaton has 380680 states and 540912 transitions. Word has length 92 [2019-09-10 07:11:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:00,480 INFO L475 AbstractCegarLoop]: Abstraction has 380680 states and 540912 transitions. [2019-09-10 07:11:00,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 380680 states and 540912 transitions. [2019-09-10 07:11:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:11:00,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:00,488 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:11:00,488 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash -494923189, now seen corresponding path program 1 times [2019-09-10 07:11:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:00,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:00,606 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:11:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:00,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:00,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:00,607 INFO L87 Difference]: Start difference. First operand 380680 states and 540912 transitions. Second operand 7 states. [2019-09-10 07:11:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:09,854 INFO L93 Difference]: Finished difference Result 1052326 states and 1494958 transitions. [2019-09-10 07:11:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:11:09,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:11:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:11,201 INFO L225 Difference]: With dead ends: 1052326 [2019-09-10 07:11:11,201 INFO L226 Difference]: Without dead ends: 1052326 [2019-09-10 07:11:11,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:11:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052326 states. [2019-09-10 07:11:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052326 to 430454. [2019-09-10 07:11:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430454 states. [2019-09-10 07:11:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430454 states to 430454 states and 612325 transitions. [2019-09-10 07:11:20,674 INFO L78 Accepts]: Start accepts. Automaton has 430454 states and 612325 transitions. Word has length 92 [2019-09-10 07:11:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:20,674 INFO L475 AbstractCegarLoop]: Abstraction has 430454 states and 612325 transitions. [2019-09-10 07:11:20,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 430454 states and 612325 transitions. [2019-09-10 07:11:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:11:20,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:20,681 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:11:20,682 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 946118557, now seen corresponding path program 1 times [2019-09-10 07:11:20,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:20,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:20,800 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:11:20,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:20,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:20,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:20,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:20,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:20,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:20,801 INFO L87 Difference]: Start difference. First operand 430454 states and 612325 transitions. Second operand 7 states. [2019-09-10 07:11:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:24,822 INFO L93 Difference]: Finished difference Result 1102742 states and 1566296 transitions. [2019-09-10 07:11:24,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:11:24,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:11:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:26,917 INFO L225 Difference]: With dead ends: 1102742 [2019-09-10 07:11:26,917 INFO L226 Difference]: Without dead ends: 1102742 [2019-09-10 07:11:26,918 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:11:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102742 states. [2019-09-10 07:11:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102742 to 496811. [2019-09-10 07:11:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496811 states. [2019-09-10 07:11:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496811 states to 496811 states and 707357 transitions. [2019-09-10 07:11:47,537 INFO L78 Accepts]: Start accepts. Automaton has 496811 states and 707357 transitions. Word has length 92 [2019-09-10 07:11:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:47,538 INFO L475 AbstractCegarLoop]: Abstraction has 496811 states and 707357 transitions. [2019-09-10 07:11:47,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 496811 states and 707357 transitions. [2019-09-10 07:11:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:11:47,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:47,547 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:11:47,547 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1908629869, now seen corresponding path program 1 times [2019-09-10 07:11:47,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:47,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:47,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:47,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:11:47,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:47,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:47,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:47,670 INFO L87 Difference]: Start difference. First operand 496811 states and 707357 transitions. Second operand 7 states. [2019-09-10 07:11:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:58,094 INFO L93 Difference]: Finished difference Result 1158018 states and 1646217 transitions. [2019-09-10 07:11:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:11:58,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-10 07:11:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:59,931 INFO L225 Difference]: With dead ends: 1158018 [2019-09-10 07:11:59,931 INFO L226 Difference]: Without dead ends: 1158018 [2019-09-10 07:11:59,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 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:12:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158018 states. [2019-09-10 07:12:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158018 to 564374. [2019-09-10 07:12:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564374 states. [2019-09-10 07:12:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564374 states to 564374 states and 803699 transitions. [2019-09-10 07:12:12,654 INFO L78 Accepts]: Start accepts. Automaton has 564374 states and 803699 transitions. Word has length 92 [2019-09-10 07:12:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:12,654 INFO L475 AbstractCegarLoop]: Abstraction has 564374 states and 803699 transitions. [2019-09-10 07:12:12,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:12:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 564374 states and 803699 transitions. [2019-09-10 07:12:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:12:12,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:12,669 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:12:12,669 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -890562151, now seen corresponding path program 1 times [2019-09-10 07:12:12,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:12,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:12,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:12,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:12,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:13,108 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:12:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:13,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:12:13,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:13,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:12:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:12:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:12:13,111 INFO L87 Difference]: Start difference. First operand 564374 states and 803699 transitions. Second operand 13 states. [2019-09-10 07:12:13,671 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:12:13,849 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:12:14,053 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:12:14,305 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 07:12:14,579 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:12:14,845 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:12:15,010 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:12:15,293 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:12:15,916 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:12:18,046 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:12:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:53,704 INFO L93 Difference]: Finished difference Result 3487042 states and 4941632 transitions. [2019-09-10 07:12:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:12:53,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:12:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:00,475 INFO L225 Difference]: With dead ends: 3487042 [2019-09-10 07:13:00,476 INFO L226 Difference]: Without dead ends: 3487042 [2019-09-10 07:13:00,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:13:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487042 states. [2019-09-10 07:13:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487042 to 564030. [2019-09-10 07:13:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564030 states. [2019-09-10 07:13:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564030 states to 564030 states and 803254 transitions. [2019-09-10 07:13:23,539 INFO L78 Accepts]: Start accepts. Automaton has 564030 states and 803254 transitions. Word has length 97 [2019-09-10 07:13:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:23,539 INFO L475 AbstractCegarLoop]: Abstraction has 564030 states and 803254 transitions. [2019-09-10 07:13:23,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:13:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 564030 states and 803254 transitions. [2019-09-10 07:13:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:13:23,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:23,552 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:13:23,552 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 92342314, now seen corresponding path program 1 times [2019-09-10 07:13:23,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:24,303 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:13:24,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:24,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:13:24,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:24,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:13:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:13:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:13:24,305 INFO L87 Difference]: Start difference. First operand 564030 states and 803254 transitions. Second operand 14 states. [2019-09-10 07:13:24,901 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:13:25,069 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:13:25,208 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 07:13:25,346 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 07:13:25,681 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-10 07:13:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:39,807 INFO L93 Difference]: Finished difference Result 2074891 states and 2937346 transitions. [2019-09-10 07:13:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:13:39,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-10 07:13:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:43,033 INFO L225 Difference]: With dead ends: 2074891 [2019-09-10 07:13:43,033 INFO L226 Difference]: Without dead ends: 2074891 [2019-09-10 07:13:43,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:13:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074891 states. [2019-09-10 07:14:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074891 to 1062174. [2019-09-10 07:14:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062174 states. [2019-09-10 07:14:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062174 states to 1062174 states and 1509943 transitions. [2019-09-10 07:14:29,403 INFO L78 Accepts]: Start accepts. Automaton has 1062174 states and 1509943 transitions. Word has length 97 [2019-09-10 07:14:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:29,403 INFO L475 AbstractCegarLoop]: Abstraction has 1062174 states and 1509943 transitions. [2019-09-10 07:14:29,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:14:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1062174 states and 1509943 transitions. [2019-09-10 07:14:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:14:29,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:29,418 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:14:29,419 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash 727160075, now seen corresponding path program 1 times [2019-09-10 07:14:29,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:29,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:29,911 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:14:29,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:29,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:14:29,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:29,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:14:29,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:14:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:14:29,912 INFO L87 Difference]: Start difference. First operand 1062174 states and 1509943 transitions. Second operand 13 states. [2019-09-10 07:14:32,007 WARN L188 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-09-10 07:14:32,325 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 07:14:32,489 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:14:32,687 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:14:32,926 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 07:14:33,275 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:15:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:09,660 INFO L93 Difference]: Finished difference Result 3809928 states and 5405577 transitions. [2019-09-10 07:15:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:15:09,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:15:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:16,837 INFO L225 Difference]: With dead ends: 3809928 [2019-09-10 07:15:16,838 INFO L226 Difference]: Without dead ends: 3809928 [2019-09-10 07:15:16,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:15:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809928 states. [2019-09-10 07:15:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809928 to 1061678. [2019-09-10 07:15:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061678 states.