java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:52:39,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:52:39,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:52:39,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:52:39,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:52:39,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:52:39,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:52:39,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:52:39,686 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:52:39,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:52:39,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:52:39,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:52:39,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:52:39,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:52:39,700 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:52:39,701 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:52:39,702 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:52:39,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:52:39,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:52:39,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:52:39,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:52:39,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:52:39,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:52:39,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:52:39,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:52:39,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:52:39,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:52:39,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:52:39,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:52:39,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:52:39,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:52:39,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:52:39,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:52:39,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:52:39,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:52:39,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:52:39,740 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 09:52:39,762 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:52:39,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:52:39,763 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:52:39,764 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:52:39,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:52:39,765 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:52:39,765 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:52:39,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:52:39,766 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:52:39,766 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:52:39,766 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:52:39,766 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:52:39,766 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:52:39,768 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:52:39,768 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:52:39,768 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:52:39,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:52:39,769 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:52:39,770 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:52:39,771 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:52:39,771 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:52:39,771 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:52:39,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:52:39,771 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:52:39,772 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:52:39,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:52:39,772 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:52:39,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:52:39,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:52:39,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:52:39,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:52:39,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:52:39,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:52:39,775 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:52:39,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:52:39,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:52:39,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:52:39,776 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:52:39,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:52:39,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:52:39,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:52:39,833 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:52:39,834 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:52:39,835 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2019-02-18 09:52:39,836 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-02-18 09:52:39,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:52:39,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:52:39,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:52:39,902 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:52:39,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:52:39,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:52:39,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:52:39,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:52:39,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:52:39,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:40,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:52:40,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:52:40,393 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:52:40,393 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-18 09:52:40,395 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40 BoogieIcfgContainer [2019-02-18 09:52:40,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:52:40,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:52:40,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:52:40,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:52:40,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/2) ... [2019-02-18 09:52:40,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537e91b and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:52:40, skipping insertion in model container [2019-02-18 09:52:40,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40" (2/2) ... [2019-02-18 09:52:40,403 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-02-18 09:52:40,413 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:52:40,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:52:40,439 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:52:40,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:52:40,473 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:52:40,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:52:40,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:52:40,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:52:40,473 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:52:40,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:52:40,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:52:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-18 09:52:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:52:40,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:52:40,500 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-02-18 09:52:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:40,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:52:40,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:52:40,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:52:40,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:52:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:52:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:52:40,872 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-02-18 09:52:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:41,064 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-18 09:52:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:52:41,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:52:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:41,078 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:52:41,078 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:52:41,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:52:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:52:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-02-18 09:52:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:52:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-18 09:52:41,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-02-18 09:52:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:41,119 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-02-18 09:52:41,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:52:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-02-18 09:52:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:52:41,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:41,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:52:41,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-02-18 09:52:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:41,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:41,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:41,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:41,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:41,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:41,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:41,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:52:41,247 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-02-18 09:52:41,313 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:52:41,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:57:49,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-18 09:57:49,866 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2019-02-18 09:57:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:49,870 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-18 09:57:51,990 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-18 09:58:06,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int) (v_idx_65 Int) (v_idx_66 Int) (v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int) (v_idx_104 Int) (v_idx_105 Int) (v_idx_102 Int) (v_idx_103 Int) (v_idx_108 Int) (v_idx_109 Int) (v_idx_106 Int) (v_idx_107 Int) (v_idx_100 Int) (v_idx_101 Int) (v_idx_58 Int) (v_idx_59 Int) (v_idx_98 Int) (v_idx_99 Int) (v_idx_96 Int) (v_idx_97 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int) (v_idx_89 Int) (v_idx_87 Int) (v_idx_88 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int) (v_idx_76 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int) (v_idx_111 Int) (v_idx_110 Int)) (let ((.cse2 (* 2 c_ULTIMATE.start_main_~i~4)) (.cse11 (+ c_ULTIMATE.start_main_~source~4 20)) (.cse5 (+ c_ULTIMATE.start_main_~edgecount~4 879)) (.cse20 (* 2 c_ULTIMATE.start_main_~edgecount~4)) (.cse6 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~source~4)) (.cse7 (+ c_ULTIMATE.start_main_~i~4 20)) (.cse18 (+ c_ULTIMATE.start_main_~nodecount~4 15)) (.cse19 (+ c_ULTIMATE.start_main_~edgecount~4 c_~INFINITY)) (.cse22 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse21 (+ c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (.cse14 (+ c_ULTIMATE.start_main_~source~4 c_~INFINITY)) (.cse17 (+ c_ULTIMATE.start_main_~source~4 13)) (.cse3 (+ c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse15 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~i~4)) (.cse16 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~source~4)) (.cse9 (+ c_ULTIMATE.start_main_~source~4 899)) (.cse24 (+ c_ULTIMATE.start_main_~i~4 5)) (.cse10 (+ c_ULTIMATE.start_main_~source~4 5)) (.cse8 (+ c_ULTIMATE.start_main_~nodecount~4 894)) (.cse27 (+ c_ULTIMATE.start_main_~i~4 899)) (.cse12 (* 2 c_~INFINITY)) (.cse13 (* 2 c_ULTIMATE.start_main_~source~4)) (.cse1 (+ c_ULTIMATE.start_main_~i~4 3)) (.cse28 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse4 (+ c_ULTIMATE.start_main_~i~4 17)) (.cse26 (* 2 c_ULTIMATE.start_main_~nodecount~4)) (.cse30 (+ c_ULTIMATE.start_main_~i~4 c_~INFINITY)) (.cse25 (+ c_ULTIMATE.start_main_~nodecount~4 c_~INFINITY)) (.cse0 (+ c_ULTIMATE.start_main_~i~4 16))) (and (or (<= .cse0 v_idx_73) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_73) 15) (= (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_73)) 15)) (or (< (+ v_idx_85 c_ULTIMATE.start_main_~edgecount~4) 27) (= .cse1 (select c_ULTIMATE.start_main_~Source~4 v_idx_85)) (<= 13 (+ v_idx_85 c_ULTIMATE.start_main_~nodecount~4))) (<= 0 .cse2) (or (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_67 10)) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_67) c_ULTIMATE.start_main_~source~4) 9) (< (+ v_idx_67 c_ULTIMATE.start_main_~source~4) 9)) (or (= (+ c_ULTIMATE.start_main_~edgecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_72)) 34) (< (+ v_idx_72 c_ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ c_ULTIMATE.start_main_~i~4 v_idx_72))) (<= .cse2 0) (or (< (+ c_ULTIMATE.start_main_~source~4 v_idx_60) 2) (<= .cse1 v_idx_60) (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_60)) 2)) (or (< (+ v_idx_59 4) c_ULTIMATE.start_main_~nodecount~4) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_59) 4) c_ULTIMATE.start_main_~nodecount~4) (<= 2 (+ v_idx_59 c_ULTIMATE.start_main_~source~4))) (<= .cse3 20) (or (= 13 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_66) c_ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_66 c_ULTIMATE.start_main_~nodecount~4) 13) (<= 9 (+ v_idx_66 c_ULTIMATE.start_main_~source~4))) (or (< v_idx_92 .cse4) (<= 19 (+ c_ULTIMATE.start_main_~source~4 v_idx_92)) (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Source~4 v_idx_92)) 2)) (<= c_~INFINITY .cse5) (<= 0 .cse6) (<= c_ULTIMATE.start_main_~edgecount~4 .cse7) (<= c_~INFINITY .cse8) (<= .cse9 c_~INFINITY) (<= .cse10 c_ULTIMATE.start_main_~nodecount~4) (or (= 6 (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_64))) (<= 27 (+ v_idx_64 c_ULTIMATE.start_main_~edgecount~4)) (< (+ v_idx_64 c_ULTIMATE.start_main_~source~4) 6)) (<= c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~source~4) (<= c_ULTIMATE.start_main_~edgecount~4 .cse11) (<= .cse12 1798) (<= 0 .cse13) (<= .cse14 899) (<= .cse11 c_ULTIMATE.start_main_~edgecount~4) (<= .cse5 c_~INFINITY) (or (<= 17 (+ v_idx_87 c_ULTIMATE.start_main_~nodecount~4)) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_87) c_ULTIMATE.start_main_~source~4) 2) (< (+ v_idx_87 10) c_ULTIMATE.start_main_~edgecount~4)) (<= 5 .cse15) (or (<= .cse4 v_idx_91) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_91) 4) c_ULTIMATE.start_main_~nodecount~4) (< v_idx_91 .cse0)) (or (< (+ v_idx_96 c_~INFINITY) 899) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_96 4)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_96) 4))) (<= .cse16 5) (or (< v_idx_71 .cse17) (<= 34 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_71)) (= .cse17 (select c_ULTIMATE.start_main_~Weight~4 v_idx_71))) (or (<= 6 (+ c_ULTIMATE.start_main_~source~4 v_idx_83)) (< (+ v_idx_83 895) c_~INFINITY) (= 899 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_83) c_~INFINITY))) (<= c_ULTIMATE.start_main_~edgecount~4 .cse18) (or (< (+ v_idx_88 c_ULTIMATE.start_main_~nodecount~4) 17) (<= .cse17 v_idx_88) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_88) .cse1)) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_103) .cse1) (< (+ v_idx_103 c_ULTIMATE.start_main_~nodecount~4) 13) (<= 9 (+ v_idx_103 c_ULTIMATE.start_main_~source~4))) (<= 919 .cse19) (or (<= .cse17 v_idx_70) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_70) 17) (= 17 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_70) c_ULTIMATE.start_main_~nodecount~4))) (or (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_77) (< (+ v_idx_77 c_ULTIMATE.start_main_~source~4) 19) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_77) c_ULTIMATE.start_main_~source~4) 19)) (<= 40 .cse20) (or (<= .cse17 v_idx_104) (< (+ v_idx_104 c_ULTIMATE.start_main_~source~4) 9) (= 899 (+ c_~INFINITY (select c_ULTIMATE.start_main_~Dest~4 v_idx_104)))) (<= 0 .cse21) (<= .cse20 40) (<= 20 .cse22) (or (= 899 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_89) c_~INFINITY)) (< v_idx_89 .cse17) (<= 15 (+ v_idx_89 c_ULTIMATE.start_main_~i~4))) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_102) 895) c_~INFINITY) (< (+ v_idx_102 c_ULTIMATE.start_main_~edgecount~4) 27) (<= 13 (+ v_idx_102 c_ULTIMATE.start_main_~nodecount~4))) (<= .cse6 0) (<= .cse7 c_ULTIMATE.start_main_~edgecount~4) (let ((.cse23 (+ c_ULTIMATE.start_main_~source~4 v_idx_110))) (or (= 899 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_110) c_~INFINITY)) (< .cse23 18) (<= 19 .cse23))) (<= c_ULTIMATE.start_main_~nodecount~4 .cse24) (<= .cse18 c_ULTIMATE.start_main_~edgecount~4) (<= .cse25 904) (or (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_81) 895)) (<= 2 (+ c_ULTIMATE.start_main_~source~4 v_idx_81)) (< (+ v_idx_81 4) c_ULTIMATE.start_main_~nodecount~4)) (<= .cse19 919) (or (< (+ v_idx_58 c_~INFINITY) 899) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_58 4)) (= 899 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_58) c_~INFINITY))) (or (< (+ c_ULTIMATE.start_main_~source~4 v_idx_82) 2) (<= c_~INFINITY (+ v_idx_82 895)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_82) 4))) (<= .cse26 10) (or (<= .cse0 v_idx_90) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_90) 15) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_90) .cse1)) (<= .cse22 20) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_101) .cse1) (< (+ c_ULTIMATE.start_main_~source~4 v_idx_101) 6) (<= 27 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_101))) (<= .cse21 0) (or (< v_idx_74 .cse0) (= .cse0 (select c_ULTIMATE.start_main_~Weight~4 v_idx_74)) (<= .cse4 v_idx_74)) (<= 899 .cse14) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_99) 4) c_ULTIMATE.start_main_~nodecount~4) (<= 25 (+ v_idx_99 c_ULTIMATE.start_main_~edgecount~4)) (< v_idx_99 .cse1)) (or (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_105)) 2) (<= 34 (+ v_idx_105 c_ULTIMATE.start_main_~edgecount~4)) (< v_idx_105 .cse17)) (<= 20 .cse3) (or (< (+ c_ULTIMATE.start_main_~source~4 v_idx_93) 19) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_93) (= .cse1 (select c_ULTIMATE.start_main_~Source~4 v_idx_93))) (<= .cse15 5) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_68) 10) c_ULTIMATE.start_main_~edgecount~4) (<= c_~INFINITY (+ v_idx_68 888)) (< (+ v_idx_68 10) c_ULTIMATE.start_main_~edgecount~4)) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_69) 888) c_~INFINITY) (< (+ v_idx_69 888) c_~INFINITY) (<= 17 (+ v_idx_69 c_ULTIMATE.start_main_~nodecount~4))) (or (<= .cse1 v_idx_98) (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_98) 895)) (< (+ v_idx_98 c_ULTIMATE.start_main_~source~4) 2)) (<= .cse27 c_~INFINITY) (<= 5 .cse16) (<= c_~INFINITY .cse9) (<= .cse24 c_ULTIMATE.start_main_~nodecount~4) (or (< (+ v_idx_80 c_~INFINITY) 899) (= 899 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_80) c_~INFINITY)) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_80 4))) (<= c_ULTIMATE.start_main_~nodecount~4 .cse10) (or (<= 13 (+ v_idx_65 c_ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_65 c_ULTIMATE.start_main_~edgecount~4) 27) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_65) c_ULTIMATE.start_main_~edgecount~4) 27)) (<= .cse28 25) (or (<= 27 (+ v_idx_84 c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~source~4 v_idx_84) 6) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_84) 4))) (or (< (+ v_idx_86 c_ULTIMATE.start_main_~nodecount~4) 13) (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_86) 895)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_86 10))) (or (= .cse4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_75)) (<= 18 (+ v_idx_75 c_ULTIMATE.start_main_~source~4)) (< v_idx_75 .cse4)) (or (<= 25 (+ v_idx_62 c_ULTIMATE.start_main_~edgecount~4)) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_62) 895) c_~INFINITY) (< (+ v_idx_62 895) c_~INFINITY)) (or (<= c_~INFINITY (+ v_idx_61 895)) (< v_idx_61 .cse1) (= .cse1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_61))) (or (< (+ v_idx_106 c_ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ v_idx_106 c_ULTIMATE.start_main_~i~4)) (= .cse1 (select c_ULTIMATE.start_main_~Dest~4 v_idx_106))) (<= .cse8 c_~INFINITY) (or (= 25 (+ c_ULTIMATE.start_main_~edgecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_63))) (<= 6 (+ v_idx_63 c_ULTIMATE.start_main_~source~4)) (< (+ v_idx_63 c_ULTIMATE.start_main_~edgecount~4) 25)) (let ((.cse29 (+ v_idx_76 c_ULTIMATE.start_main_~source~4))) (or (= 18 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_76) c_ULTIMATE.start_main_~source~4)) (<= 19 .cse29) (< .cse29 18))) (<= c_~INFINITY .cse27) (<= 899 .cse30) (<= 1798 .cse12) (<= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4) (<= .cse13 0) (or (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_111) (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_111) 895)) (< (+ c_ULTIMATE.start_main_~source~4 v_idx_111) 19)) (or (= .cse1 (select c_ULTIMATE.start_main_~Dest~4 v_idx_97)) (< (+ v_idx_97 4) c_ULTIMATE.start_main_~nodecount~4) (<= 2 (+ v_idx_97 c_ULTIMATE.start_main_~source~4))) (<= 25 .cse28) (or (<= .cse4 v_idx_108) (< v_idx_108 .cse0) (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_108)) 2)) (or (< v_idx_109 .cse4) (<= 18 (+ v_idx_109 c_ULTIMATE.start_main_~source~4)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_109) 4))) (<= 10 .cse26) (<= .cse30 899) (<= 904 .cse25) (or (<= .cse0 v_idx_107) (= 899 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_107) c_~INFINITY)) (< (+ v_idx_107 c_ULTIMATE.start_main_~i~4) 15)) (or (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_100) 895)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_100) 25) (<= 6 (+ c_ULTIMATE.start_main_~source~4 v_idx_100)))))) is different from false [2019-02-18 09:58:06,795 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-18 09:58:06,795 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-18 09:58:06,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-18 09:58:06,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-02-18 09:58:06,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:58:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:58:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:58:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-02-18 09:58:06,802 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-02-18 09:58:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:07,238 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2019-02-18 09:58:07,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:58:07,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-02-18 09:58:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:07,240 INFO L225 Difference]: With dead ends: 9 [2019-02-18 09:58:07,240 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:58:07,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-02-18 09:58:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:58:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:58:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:58:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:58:07,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-18 09:58:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:07,242 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:58:07,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:58:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:58:07,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:58:07,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.