java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:23:37,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:23:37,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:23:37,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:23:37,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:23:37,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:23:37,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:23:37,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:23:37,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:23:37,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:23:37,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:23:37,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:23:37,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:23:37,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:23:37,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:23:37,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:23:37,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:23:37,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:23:37,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:23:37,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:23:37,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:23:37,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:23:37,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:23:37,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:23:37,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:23:37,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:23:37,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:23:37,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:23:37,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:23:37,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:23:37,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:23:37,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:23:37,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:23:37,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:23:37,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:23:37,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:23:37,773 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:23:37,783 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:23:37,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:23:37,784 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:23:37,784 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:23:37,785 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:23:37,785 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:23:37,786 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:23:37,786 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:23:37,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:23:37,787 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:23:37,787 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:23:37,787 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:23:37,787 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:23:37,788 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:23:37,788 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:23:37,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:23:37,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:23:37,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:23:37,861 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:23:37,861 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:23:37,862 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl [2018-10-10 15:23:37,862 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl' [2018-10-10 15:23:37,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:23:37,953 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:23:37,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:23:37,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:23:37,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:23:37,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:37,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:37,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:37,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:38,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:38,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:38,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/1) ... [2018-10-10 15:23:38,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:23:38,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:23:38,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:23:38,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:23:38,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:23:38,072 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:23:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:23:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:23:38,580 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:23:38,581 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:23:38 BoogieIcfgContainer [2018-10-10 15:23:38,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:23:38,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:23:38,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:23:38,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:23:38,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:37" (1/2) ... [2018-10-10 15:23:38,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c366f42 and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:23:38, skipping insertion in model container [2018-10-10 15:23:38,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:23:38" (2/2) ... [2018-10-10 15:23:38,589 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_10.bpl [2018-10-10 15:23:38,599 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:23:38,608 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:23:38,626 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:23:38,656 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:23:38,656 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:23:38,657 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:23:38,657 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:23:38,657 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:23:38,657 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:23:38,657 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:23:38,658 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:23:38,658 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:23:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 15:23:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 15:23:38,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:38,689 INFO L375 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] [2018-10-10 15:23:38,690 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:38,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2107550204, now seen corresponding path program 1 times [2018-10-10 15:23:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:39,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:23:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 15:23:39,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:23:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:23:39,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:23:39,050 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2018-10-10 15:23:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:39,513 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-10 15:23:39,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:23:39,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-10 15:23:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:39,528 INFO L225 Difference]: With dead ends: 127 [2018-10-10 15:23:39,529 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 15:23:39,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:23:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 15:23:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2018-10-10 15:23:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 15:23:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-10 15:23:39,578 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-10-10 15:23:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:39,579 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-10 15:23:39,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:23:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-10 15:23:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 15:23:39,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:39,582 INFO L375 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] [2018-10-10 15:23:39,582 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:39,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -477820300, now seen corresponding path program 1 times [2018-10-10 15:23:39,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:23:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:23:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 15:23:40,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:23:40,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:23:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:40,134 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 12 states. [2018-10-10 15:23:40,451 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 15:23:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:41,451 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-10-10 15:23:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:23:41,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-10-10 15:23:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:41,455 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:23:41,455 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:23:41,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:23:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:23:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2018-10-10 15:23:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-10 15:23:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-10-10 15:23:41,467 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 60 [2018-10-10 15:23:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:41,468 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-10-10 15:23:41,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:23:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-10-10 15:23:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 15:23:41,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:41,471 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:41,472 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:41,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -344888071, now seen corresponding path program 1 times [2018-10-10 15:23:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:23:41,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:23:41,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:23:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:23:41,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:23:41,672 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 8 states. [2018-10-10 15:23:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:41,986 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-10-10 15:23:41,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:23:41,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-10-10 15:23:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:41,989 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:23:41,989 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:23:41,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:23:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:23:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 118. [2018-10-10 15:23:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 15:23:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-10-10 15:23:42,001 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 85 [2018-10-10 15:23:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:42,002 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-10 15:23:42,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:23:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-10-10 15:23:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 15:23:42,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:42,006 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:42,006 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:42,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1574991137, now seen corresponding path program 2 times [2018-10-10 15:23:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:23:42,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:42,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:23:42,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:23:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:23:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:23:42,233 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 10 states. [2018-10-10 15:23:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:42,597 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-10-10 15:23:42,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:23:42,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2018-10-10 15:23:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:42,600 INFO L225 Difference]: With dead ends: 169 [2018-10-10 15:23:42,600 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 15:23:42,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:23:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 15:23:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2018-10-10 15:23:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 15:23:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-10 15:23:42,612 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 100 [2018-10-10 15:23:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:42,613 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-10 15:23:42,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:23:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-10 15:23:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:23:42,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:42,616 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:42,616 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:42,617 INFO L82 PathProgramCache]: Analyzing trace with hash 685843513, now seen corresponding path program 3 times [2018-10-10 15:23:42,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:23:43,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:43,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:23:43,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:23:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:23:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:23:43,870 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 15 states. [2018-10-10 15:23:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:45,350 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2018-10-10 15:23:45,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:23:45,350 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-10-10 15:23:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:45,352 INFO L225 Difference]: With dead ends: 192 [2018-10-10 15:23:45,352 INFO L226 Difference]: Without dead ends: 192 [2018-10-10 15:23:45,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:23:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-10 15:23:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2018-10-10 15:23:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 15:23:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-10-10 15:23:45,370 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 115 [2018-10-10 15:23:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:45,370 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-10-10 15:23:45,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:23:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-10-10 15:23:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:23:45,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:45,373 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:45,374 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:45,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash -890213676, now seen corresponding path program 4 times [2018-10-10 15:23:45,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:23:45,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:45,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:23:45,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:23:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:23:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:23:45,659 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 10 states. [2018-10-10 15:23:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:46,023 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-10-10 15:23:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:23:46,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-10-10 15:23:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:46,028 INFO L225 Difference]: With dead ends: 181 [2018-10-10 15:23:46,028 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 15:23:46,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:23:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 15:23:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2018-10-10 15:23:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:23:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2018-10-10 15:23:46,038 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 140 [2018-10-10 15:23:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:46,038 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2018-10-10 15:23:46,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:23:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2018-10-10 15:23:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:23:46,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:46,042 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:46,042 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:46,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 921680804, now seen corresponding path program 5 times [2018-10-10 15:23:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 17 proven. 126 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:23:46,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:46,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:23:46,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:23:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:23:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:46,573 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 12 states. [2018-10-10 15:23:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:47,135 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-10-10 15:23:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:23:47,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2018-10-10 15:23:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:47,137 INFO L225 Difference]: With dead ends: 196 [2018-10-10 15:23:47,138 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 15:23:47,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:23:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 15:23:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2018-10-10 15:23:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:23:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2018-10-10 15:23:47,146 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 155 [2018-10-10 15:23:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:47,146 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2018-10-10 15:23:47,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:23:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2018-10-10 15:23:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:23:47,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:47,152 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:47,152 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:47,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:47,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1223340244, now seen corresponding path program 6 times [2018-10-10 15:23:47,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:23:47,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:47,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:23:47,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:23:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:23:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:23:47,420 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 14 states. [2018-10-10 15:23:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:47,997 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-10-10 15:23:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:23:48,003 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2018-10-10 15:23:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:48,005 INFO L225 Difference]: With dead ends: 198 [2018-10-10 15:23:48,005 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 15:23:48,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:23:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 15:23:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-10-10 15:23:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:23:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-10 15:23:48,011 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 170 [2018-10-10 15:23:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:48,011 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-10 15:23:48,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:23:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-10 15:23:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:23:48,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:48,014 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:48,015 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:48,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1470057052, now seen corresponding path program 7 times [2018-10-10 15:23:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-10 15:23:48,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:48,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:23:48,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:23:48,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:23:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:23:48,541 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 18 states. [2018-10-10 15:23:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:49,881 INFO L93 Difference]: Finished difference Result 324 states and 329 transitions. [2018-10-10 15:23:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:23:49,891 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 185 [2018-10-10 15:23:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:49,893 INFO L225 Difference]: With dead ends: 324 [2018-10-10 15:23:49,893 INFO L226 Difference]: Without dead ends: 324 [2018-10-10 15:23:49,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:23:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-10 15:23:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 256. [2018-10-10 15:23:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-10 15:23:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 260 transitions. [2018-10-10 15:23:49,901 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 260 transitions. Word has length 185 [2018-10-10 15:23:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:49,901 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 260 transitions. [2018-10-10 15:23:49,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:23:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 260 transitions. [2018-10-10 15:23:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-10 15:23:49,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:49,905 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:49,906 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:49,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2006224177, now seen corresponding path program 8 times [2018-10-10 15:23:49,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 588 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-10 15:23:51,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:51,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:23:51,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:23:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:23:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:23:51,421 INFO L87 Difference]: Start difference. First operand 256 states and 260 transitions. Second operand 22 states. [2018-10-10 15:23:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:53,302 INFO L93 Difference]: Finished difference Result 394 states and 400 transitions. [2018-10-10 15:23:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:23:53,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 255 [2018-10-10 15:23:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:53,306 INFO L225 Difference]: With dead ends: 394 [2018-10-10 15:23:53,306 INFO L226 Difference]: Without dead ends: 394 [2018-10-10 15:23:53,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:23:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-10 15:23:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 326. [2018-10-10 15:23:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-10 15:23:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 331 transitions. [2018-10-10 15:23:53,314 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 331 transitions. Word has length 255 [2018-10-10 15:23:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:53,314 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 331 transitions. [2018-10-10 15:23:53,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:23:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 331 transitions. [2018-10-10 15:23:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-10 15:23:53,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:53,319 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:53,319 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:53,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash -727479366, now seen corresponding path program 9 times [2018-10-10 15:23:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 0 proven. 1106 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-10 15:23:54,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:54,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:23:54,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:23:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:23:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:23:54,892 INFO L87 Difference]: Start difference. First operand 326 states and 331 transitions. Second operand 22 states. [2018-10-10 15:23:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:57,227 INFO L93 Difference]: Finished difference Result 464 states and 471 transitions. [2018-10-10 15:23:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:23:57,228 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 325 [2018-10-10 15:23:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:57,230 INFO L225 Difference]: With dead ends: 464 [2018-10-10 15:23:57,230 INFO L226 Difference]: Without dead ends: 464 [2018-10-10 15:23:57,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:23:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-10 15:23:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 396. [2018-10-10 15:23:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-10 15:23:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 402 transitions. [2018-10-10 15:23:57,238 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 402 transitions. Word has length 325 [2018-10-10 15:23:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:57,239 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 402 transitions. [2018-10-10 15:23:57,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:23:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 402 transitions. [2018-10-10 15:23:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-10 15:23:57,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:57,242 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:57,242 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:57,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -121163675, now seen corresponding path program 10 times [2018-10-10 15:23:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 1790 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-10 15:23:58,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:58,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:23:58,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:23:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:23:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:23:58,458 INFO L87 Difference]: Start difference. First operand 396 states and 402 transitions. Second operand 24 states. [2018-10-10 15:23:59,337 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-10 15:24:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:01,553 INFO L93 Difference]: Finished difference Result 534 states and 542 transitions. [2018-10-10 15:24:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:24:01,554 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 395 [2018-10-10 15:24:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:01,558 INFO L225 Difference]: With dead ends: 534 [2018-10-10 15:24:01,558 INFO L226 Difference]: Without dead ends: 534 [2018-10-10 15:24:01,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=371, Invalid=2281, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:24:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-10 15:24:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 466. [2018-10-10 15:24:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-10-10 15:24:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 473 transitions. [2018-10-10 15:24:01,566 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 473 transitions. Word has length 395 [2018-10-10 15:24:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:01,567 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 473 transitions. [2018-10-10 15:24:01,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:24:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 473 transitions. [2018-10-10 15:24:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-10-10 15:24:01,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:01,571 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:01,571 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:01,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1538298064, now seen corresponding path program 11 times [2018-10-10 15:24:01,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 0 proven. 2640 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-10 15:24:03,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:24:03,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:24:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:24:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:24:03,953 INFO L87 Difference]: Start difference. First operand 466 states and 473 transitions. Second operand 26 states. [2018-10-10 15:24:08,576 WARN L178 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-10 15:24:09,480 WARN L178 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-10 15:24:10,174 WARN L178 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-10-10 15:24:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:11,139 INFO L93 Difference]: Finished difference Result 604 states and 613 transitions. [2018-10-10 15:24:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:24:11,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 465 [2018-10-10 15:24:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:11,143 INFO L225 Difference]: With dead ends: 604 [2018-10-10 15:24:11,143 INFO L226 Difference]: Without dead ends: 604 [2018-10-10 15:24:11,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:24:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-10 15:24:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 536. [2018-10-10 15:24:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-10 15:24:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 544 transitions. [2018-10-10 15:24:11,153 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 544 transitions. Word has length 465 [2018-10-10 15:24:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:11,154 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 544 transitions. [2018-10-10 15:24:11,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:24:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 544 transitions. [2018-10-10 15:24:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-10 15:24:11,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:11,159 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:11,159 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:11,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1168777989, now seen corresponding path program 12 times [2018-10-10 15:24:11,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3962 backedges. 0 proven. 3656 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-10 15:24:13,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:13,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:24:13,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:24:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:24:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:24:13,150 INFO L87 Difference]: Start difference. First operand 536 states and 544 transitions. Second operand 28 states. [2018-10-10 15:24:14,351 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-10 15:24:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:16,716 INFO L93 Difference]: Finished difference Result 674 states and 684 transitions. [2018-10-10 15:24:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:24:16,727 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 535 [2018-10-10 15:24:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:16,730 INFO L225 Difference]: With dead ends: 674 [2018-10-10 15:24:16,730 INFO L226 Difference]: Without dead ends: 674 [2018-10-10 15:24:16,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:24:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-10 15:24:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 606. [2018-10-10 15:24:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-10-10 15:24:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 615 transitions. [2018-10-10 15:24:16,740 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 615 transitions. Word has length 535 [2018-10-10 15:24:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:16,741 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 615 transitions. [2018-10-10 15:24:16,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:24:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 615 transitions. [2018-10-10 15:24:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2018-10-10 15:24:16,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:16,746 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:16,746 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:16,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1120486630, now seen corresponding path program 13 times [2018-10-10 15:24:16,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:17,531 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:24:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 4838 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-10-10 15:24:19,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:19,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:24:19,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:24:19,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:24:19,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:24:19,637 INFO L87 Difference]: Start difference. First operand 606 states and 615 transitions. Second operand 30 states. [2018-10-10 15:24:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:23,939 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-10 15:24:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:24:23,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 605 [2018-10-10 15:24:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:23,945 INFO L225 Difference]: With dead ends: 744 [2018-10-10 15:24:23,945 INFO L226 Difference]: Without dead ends: 744 [2018-10-10 15:24:23,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=500, Invalid=3922, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:24:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-10 15:24:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 676. [2018-10-10 15:24:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-10 15:24:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 686 transitions. [2018-10-10 15:24:23,957 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 686 transitions. Word has length 605 [2018-10-10 15:24:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:23,958 INFO L481 AbstractCegarLoop]: Abstraction has 676 states and 686 transitions. [2018-10-10 15:24:23,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:24:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 686 transitions. [2018-10-10 15:24:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-10 15:24:23,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:23,963 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:23,964 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:23,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1866004625, now seen corresponding path program 14 times [2018-10-10 15:24:23,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6588 backedges. 4677 proven. 1377 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-10-10 15:24:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:24:25,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:24:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:24:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:24:25,326 INFO L87 Difference]: Start difference. First operand 676 states and 686 transitions. Second operand 26 states. [2018-10-10 15:24:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:26,727 INFO L93 Difference]: Finished difference Result 760 states and 770 transitions. [2018-10-10 15:24:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:24:26,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 675 [2018-10-10 15:24:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:26,731 INFO L225 Difference]: With dead ends: 760 [2018-10-10 15:24:26,731 INFO L226 Difference]: Without dead ends: 760 [2018-10-10 15:24:26,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=540, Invalid=2216, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:24:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-10 15:24:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 721. [2018-10-10 15:24:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-10 15:24:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 731 transitions. [2018-10-10 15:24:26,742 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 731 transitions. Word has length 675 [2018-10-10 15:24:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:26,743 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 731 transitions. [2018-10-10 15:24:26,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:24:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 731 transitions. [2018-10-10 15:24:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2018-10-10 15:24:26,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:26,750 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:26,750 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:26,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 740421757, now seen corresponding path program 15 times [2018-10-10 15:24:26,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:27,765 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:24:28,389 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-10 15:24:28,723 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-10 15:24:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7878 backedges. 0 proven. 7338 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-10-10 15:24:31,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:31,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:24:31,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:24:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:24:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:24:31,344 INFO L87 Difference]: Start difference. First operand 721 states and 731 transitions. Second operand 32 states. [2018-10-10 15:24:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:36,346 INFO L93 Difference]: Finished difference Result 889 states and 901 transitions. [2018-10-10 15:24:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:24:36,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 720 [2018-10-10 15:24:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:36,353 INFO L225 Difference]: With dead ends: 889 [2018-10-10 15:24:36,354 INFO L226 Difference]: Without dead ends: 889 [2018-10-10 15:24:36,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=543, Invalid=4569, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:24:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-10-10 15:24:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 806. [2018-10-10 15:24:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-10 15:24:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 817 transitions. [2018-10-10 15:24:36,367 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 817 transitions. Word has length 720 [2018-10-10 15:24:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:36,367 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 817 transitions. [2018-10-10 15:24:36,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:24:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 817 transitions. [2018-10-10 15:24:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-10-10 15:24:36,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:36,375 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:36,375 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:36,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1059922672, now seen corresponding path program 16 times [2018-10-10 15:24:36,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:37,063 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:24:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10084 backedges. 0 proven. 9450 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2018-10-10 15:24:40,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:40,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:24:40,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:24:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:24:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:24:40,340 INFO L87 Difference]: Start difference. First operand 806 states and 817 transitions. Second operand 34 states. [2018-10-10 15:24:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:45,852 INFO L93 Difference]: Finished difference Result 974 states and 987 transitions. [2018-10-10 15:24:45,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:24:45,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 805 [2018-10-10 15:24:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:45,859 INFO L225 Difference]: With dead ends: 974 [2018-10-10 15:24:45,859 INFO L226 Difference]: Without dead ends: 974 [2018-10-10 15:24:45,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=586, Invalid=5266, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:24:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-10-10 15:24:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 891. [2018-10-10 15:24:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-10-10 15:24:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 903 transitions. [2018-10-10 15:24:45,872 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 903 transitions. Word has length 805 [2018-10-10 15:24:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:45,873 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 903 transitions. [2018-10-10 15:24:45,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:24:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 903 transitions. [2018-10-10 15:24:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2018-10-10 15:24:45,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:45,881 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:45,881 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:45,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 522629725, now seen corresponding path program 17 times [2018-10-10 15:24:45,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12563 backedges. 0 proven. 11835 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2018-10-10 15:24:50,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:50,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:24:50,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:24:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:24:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:24:50,144 INFO L87 Difference]: Start difference. First operand 891 states and 903 transitions. Second operand 36 states. [2018-10-10 15:24:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:56,577 INFO L93 Difference]: Finished difference Result 1059 states and 1073 transitions. [2018-10-10 15:24:56,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:24:56,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 890 [2018-10-10 15:24:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:56,582 INFO L225 Difference]: With dead ends: 1059 [2018-10-10 15:24:56,582 INFO L226 Difference]: Without dead ends: 1059 [2018-10-10 15:24:56,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=629, Invalid=6013, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:24:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-10-10 15:24:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 976. [2018-10-10 15:24:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-10-10 15:24:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 989 transitions. [2018-10-10 15:24:56,597 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 989 transitions. Word has length 890 [2018-10-10 15:24:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:56,597 INFO L481 AbstractCegarLoop]: Abstraction has 976 states and 989 transitions. [2018-10-10 15:24:56,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:24:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 989 transitions. [2018-10-10 15:24:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-10-10 15:24:56,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:56,606 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:56,606 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 950208304, now seen corresponding path program 18 times [2018-10-10 15:24:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:57,482 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:25:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15315 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2018-10-10 15:25:01,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:01,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:25:01,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:25:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:25:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:25:01,479 INFO L87 Difference]: Start difference. First operand 976 states and 989 transitions. Second operand 38 states. [2018-10-10 15:25:02,555 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-10-10 15:25:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:09,793 INFO L93 Difference]: Finished difference Result 1144 states and 1159 transitions. [2018-10-10 15:25:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:25:09,794 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 975 [2018-10-10 15:25:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:09,798 INFO L225 Difference]: With dead ends: 1144 [2018-10-10 15:25:09,798 INFO L226 Difference]: Without dead ends: 1144 [2018-10-10 15:25:09,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=672, Invalid=6810, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:25:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-10-10 15:25:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1061. [2018-10-10 15:25:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-10-10 15:25:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1075 transitions. [2018-10-10 15:25:09,813 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1075 transitions. Word has length 975 [2018-10-10 15:25:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:09,814 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1075 transitions. [2018-10-10 15:25:09,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:25:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1075 transitions. [2018-10-10 15:25:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-10-10 15:25:09,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:09,824 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:09,825 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:09,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1382882365, now seen corresponding path program 19 times [2018-10-10 15:25:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18340 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2018-10-10 15:25:14,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:14,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:25:15,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:25:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:25:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:25:15,001 INFO L87 Difference]: Start difference. First operand 1061 states and 1075 transitions. Second operand 40 states. [2018-10-10 15:25:15,922 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-10-10 15:25:17,694 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-10 15:25:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:23,795 INFO L93 Difference]: Finished difference Result 1229 states and 1245 transitions. [2018-10-10 15:25:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:25:23,796 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1060 [2018-10-10 15:25:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:23,800 INFO L225 Difference]: With dead ends: 1229 [2018-10-10 15:25:23,800 INFO L226 Difference]: Without dead ends: 1229 [2018-10-10 15:25:23,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=715, Invalid=7657, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:25:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-10 15:25:23,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1146. [2018-10-10 15:25:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2018-10-10 15:25:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1161 transitions. [2018-10-10 15:25:23,821 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1161 transitions. Word has length 1060 [2018-10-10 15:25:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:23,822 INFO L481 AbstractCegarLoop]: Abstraction has 1146 states and 1161 transitions. [2018-10-10 15:25:23,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:25:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1161 transitions. [2018-10-10 15:25:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2018-10-10 15:25:23,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:23,835 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:23,836 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:23,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 780831056, now seen corresponding path program 20 times [2018-10-10 15:25:23,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21638 backedges. 0 proven. 20628 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-10-10 15:25:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:30,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:25:30,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:25:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:25:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:25:30,304 INFO L87 Difference]: Start difference. First operand 1146 states and 1161 transitions. Second operand 42 states. [2018-10-10 15:25:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:39,353 INFO L93 Difference]: Finished difference Result 1314 states and 1331 transitions. [2018-10-10 15:25:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:25:39,354 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1145 [2018-10-10 15:25:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:39,360 INFO L225 Difference]: With dead ends: 1314 [2018-10-10 15:25:39,360 INFO L226 Difference]: Without dead ends: 1314 [2018-10-10 15:25:39,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=758, Invalid=8554, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:25:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-10-10 15:25:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1231. [2018-10-10 15:25:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-10-10 15:25:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1247 transitions. [2018-10-10 15:25:39,373 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1247 transitions. Word has length 1145 [2018-10-10 15:25:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:39,374 INFO L481 AbstractCegarLoop]: Abstraction has 1231 states and 1247 transitions. [2018-10-10 15:25:39,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:25:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1247 transitions. [2018-10-10 15:25:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1231 [2018-10-10 15:25:39,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:39,387 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:39,387 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:39,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:39,388 INFO L82 PathProgramCache]: Analyzing trace with hash 853749277, now seen corresponding path program 21 times [2018-10-10 15:25:39,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25209 backedges. 0 proven. 24105 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-10-10 15:25:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:25:45,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:25:45,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:25:45,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:25:45,992 INFO L87 Difference]: Start difference. First operand 1231 states and 1247 transitions. Second operand 44 states. [2018-10-10 15:25:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:56,126 INFO L93 Difference]: Finished difference Result 1399 states and 1417 transitions. [2018-10-10 15:25:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:25:56,127 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1230 [2018-10-10 15:25:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:56,131 INFO L225 Difference]: With dead ends: 1399 [2018-10-10 15:25:56,131 INFO L226 Difference]: Without dead ends: 1399 [2018-10-10 15:25:56,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=801, Invalid=9501, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:25:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-10-10 15:25:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1316. [2018-10-10 15:25:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2018-10-10 15:25:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1333 transitions. [2018-10-10 15:25:56,145 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1333 transitions. Word has length 1230 [2018-10-10 15:25:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:56,146 INFO L481 AbstractCegarLoop]: Abstraction has 1316 states and 1333 transitions. [2018-10-10 15:25:56,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:25:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1333 transitions. [2018-10-10 15:25:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1316 [2018-10-10 15:25:56,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:56,161 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:56,161 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:56,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1503960208, now seen corresponding path program 22 times [2018-10-10 15:25:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:57,227 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:25:57,874 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-10 15:26:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 29053 backedges. 0 proven. 27855 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-10-10 15:26:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:26:04,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:26:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:26:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:26:04,636 INFO L87 Difference]: Start difference. First operand 1316 states and 1333 transitions. Second operand 46 states. [2018-10-10 15:26:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:15,955 INFO L93 Difference]: Finished difference Result 1484 states and 1503 transitions. [2018-10-10 15:26:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:26:15,956 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1315 [2018-10-10 15:26:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:15,961 INFO L225 Difference]: With dead ends: 1484 [2018-10-10 15:26:15,961 INFO L226 Difference]: Without dead ends: 1484 [2018-10-10 15:26:15,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=844, Invalid=10498, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:26:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-10-10 15:26:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1401. [2018-10-10 15:26:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-10-10 15:26:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1419 transitions. [2018-10-10 15:26:15,976 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1419 transitions. Word has length 1315 [2018-10-10 15:26:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:15,977 INFO L481 AbstractCegarLoop]: Abstraction has 1401 states and 1419 transitions. [2018-10-10 15:26:15,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:26:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1419 transitions. [2018-10-10 15:26:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2018-10-10 15:26:15,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:15,993 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:15,993 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:15,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1140254717, now seen corresponding path program 23 times [2018-10-10 15:26:15,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33170 backedges. 0 proven. 31878 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2018-10-10 15:26:24,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:26:24,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:26:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:26:24,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:26:24,189 INFO L87 Difference]: Start difference. First operand 1401 states and 1419 transitions. Second operand 48 states. [2018-10-10 15:26:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:36,757 INFO L93 Difference]: Finished difference Result 1569 states and 1589 transitions. [2018-10-10 15:26:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:26:36,758 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1400 [2018-10-10 15:26:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:36,763 INFO L225 Difference]: With dead ends: 1569 [2018-10-10 15:26:36,763 INFO L226 Difference]: Without dead ends: 1569 [2018-10-10 15:26:36,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=887, Invalid=11545, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:26:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-10 15:26:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1486. [2018-10-10 15:26:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-10-10 15:26:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1505 transitions. [2018-10-10 15:26:36,780 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1505 transitions. Word has length 1400 [2018-10-10 15:26:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:36,781 INFO L481 AbstractCegarLoop]: Abstraction has 1486 states and 1505 transitions. [2018-10-10 15:26:36,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:26:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1505 transitions. [2018-10-10 15:26:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-10-10 15:26:36,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:36,799 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:36,799 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:36,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1654155888, now seen corresponding path program 24 times [2018-10-10 15:26:36,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 37560 backedges. 0 proven. 36174 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2018-10-10 15:26:45,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:45,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:26:45,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:26:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:26:45,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2308, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:26:45,525 INFO L87 Difference]: Start difference. First operand 1486 states and 1505 transitions. Second operand 50 states. [2018-10-10 15:26:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:59,172 INFO L93 Difference]: Finished difference Result 1654 states and 1675 transitions. [2018-10-10 15:26:59,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:26:59,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1485 [2018-10-10 15:26:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:59,178 INFO L225 Difference]: With dead ends: 1654 [2018-10-10 15:26:59,178 INFO L226 Difference]: Without dead ends: 1654 [2018-10-10 15:26:59,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2593 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=930, Invalid=12642, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 15:26:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-10-10 15:26:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1571. [2018-10-10 15:26:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-10 15:26:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1591 transitions. [2018-10-10 15:26:59,192 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1591 transitions. Word has length 1485 [2018-10-10 15:26:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:59,193 INFO L481 AbstractCegarLoop]: Abstraction has 1571 states and 1591 transitions. [2018-10-10 15:26:59,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:26:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1591 transitions. [2018-10-10 15:26:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1571 [2018-10-10 15:26:59,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:59,214 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:59,214 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:59,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash -6927907, now seen corresponding path program 25 times [2018-10-10 15:26:59,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42223 backedges. 0 proven. 40743 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-10-10 15:27:10,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:10,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:27:10,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:27:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:27:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2504, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:27:10,226 INFO L87 Difference]: Start difference. First operand 1571 states and 1591 transitions. Second operand 52 states. [2018-10-10 15:27:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:25,035 INFO L93 Difference]: Finished difference Result 1739 states and 1761 transitions. [2018-10-10 15:27:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:27:25,036 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1570 [2018-10-10 15:27:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:25,041 INFO L225 Difference]: With dead ends: 1739 [2018-10-10 15:27:25,041 INFO L226 Difference]: Without dead ends: 1739 [2018-10-10 15:27:25,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=973, Invalid=13789, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:27:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-10-10 15:27:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1656. [2018-10-10 15:27:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-10-10 15:27:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1677 transitions. [2018-10-10 15:27:25,053 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1677 transitions. Word has length 1570 [2018-10-10 15:27:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:25,054 INFO L481 AbstractCegarLoop]: Abstraction has 1656 states and 1677 transitions. [2018-10-10 15:27:25,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:27:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1677 transitions. [2018-10-10 15:27:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1656 [2018-10-10 15:27:25,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:25,074 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:25,074 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:25,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash 713105328, now seen corresponding path program 26 times [2018-10-10 15:27:25,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47159 backedges. 0 proven. 45585 refuted. 0 times theorem prover too weak. 1574 trivial. 0 not checked. [2018-10-10 15:27:35,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:35,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:27:35,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:27:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:27:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2708, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:27:35,661 INFO L87 Difference]: Start difference. First operand 1656 states and 1677 transitions. Second operand 54 states. [2018-10-10 15:27:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:52,423 INFO L93 Difference]: Finished difference Result 1824 states and 1847 transitions. [2018-10-10 15:27:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:27:52,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1655 [2018-10-10 15:27:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:52,429 INFO L225 Difference]: With dead ends: 1824 [2018-10-10 15:27:52,429 INFO L226 Difference]: Without dead ends: 1824 [2018-10-10 15:27:52,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1016, Invalid=14986, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:27:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-10-10 15:27:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1741. [2018-10-10 15:27:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2018-10-10 15:27:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 1763 transitions. [2018-10-10 15:27:52,441 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 1763 transitions. Word has length 1655 [2018-10-10 15:27:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:52,442 INFO L481 AbstractCegarLoop]: Abstraction has 1741 states and 1763 transitions. [2018-10-10 15:27:52,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:27:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 1763 transitions. [2018-10-10 15:27:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2018-10-10 15:27:52,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:52,459 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:52,459 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:52,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:52,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1238412355, now seen corresponding path program 27 times [2018-10-10 15:27:52,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 52368 backedges. 0 proven. 50700 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-10-10 15:28:03,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:03,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:28:03,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:28:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:28:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:28:03,920 INFO L87 Difference]: Start difference. First operand 1741 states and 1763 transitions. Second operand 56 states. [2018-10-10 15:28:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:21,672 INFO L93 Difference]: Finished difference Result 1909 states and 1933 transitions. [2018-10-10 15:28:21,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:28:21,672 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1740 [2018-10-10 15:28:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:21,678 INFO L225 Difference]: With dead ends: 1909 [2018-10-10 15:28:21,678 INFO L226 Difference]: Without dead ends: 1909 [2018-10-10 15:28:21,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1059, Invalid=16233, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:28:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2018-10-10 15:28:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1826. [2018-10-10 15:28:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2018-10-10 15:28:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 1849 transitions. [2018-10-10 15:28:21,693 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 1849 transitions. Word has length 1740 [2018-10-10 15:28:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:21,694 INFO L481 AbstractCegarLoop]: Abstraction has 1826 states and 1849 transitions. [2018-10-10 15:28:21,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:28:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 1849 transitions. [2018-10-10 15:28:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1826 [2018-10-10 15:28:21,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:21,712 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:21,713 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:21,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1644559920, now seen corresponding path program 28 times [2018-10-10 15:28:21,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 57850 backedges. 0 proven. 56088 refuted. 0 times theorem prover too weak. 1762 trivial. 0 not checked. [2018-10-10 15:28:34,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:34,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:28:34,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:28:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:28:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3140, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:28:34,276 INFO L87 Difference]: Start difference. First operand 1826 states and 1849 transitions. Second operand 58 states. [2018-10-10 15:28:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:53,160 INFO L93 Difference]: Finished difference Result 1994 states and 2019 transitions. [2018-10-10 15:28:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:28:53,161 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1825 [2018-10-10 15:28:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:53,167 INFO L225 Difference]: With dead ends: 1994 [2018-10-10 15:28:53,167 INFO L226 Difference]: Without dead ends: 1994 [2018-10-10 15:28:53,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1102, Invalid=17530, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 15:28:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-10-10 15:28:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1911. [2018-10-10 15:28:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2018-10-10 15:28:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 1935 transitions. [2018-10-10 15:28:53,182 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 1935 transitions. Word has length 1825 [2018-10-10 15:28:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:53,183 INFO L481 AbstractCegarLoop]: Abstraction has 1911 states and 1935 transitions. [2018-10-10 15:28:53,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:28:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 1935 transitions. [2018-10-10 15:28:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1911 [2018-10-10 15:28:53,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:53,203 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:53,203 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:53,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1857029533, now seen corresponding path program 29 times [2018-10-10 15:28:53,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 63605 backedges. 0 proven. 61749 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2018-10-10 15:29:06,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:06,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:29:06,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:29:06,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:29:06,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3368, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:29:06,746 INFO L87 Difference]: Start difference. First operand 1911 states and 1935 transitions. Second operand 60 states. [2018-10-10 15:29:11,804 WARN L178 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-10-10 15:29:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:27,766 INFO L93 Difference]: Finished difference Result 2079 states and 2105 transitions. [2018-10-10 15:29:27,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:29:27,766 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1910 [2018-10-10 15:29:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:27,773 INFO L225 Difference]: With dead ends: 2079 [2018-10-10 15:29:27,773 INFO L226 Difference]: Without dead ends: 2079 [2018-10-10 15:29:27,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3798 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1145, Invalid=18877, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:29:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-10-10 15:29:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1996. [2018-10-10 15:29:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2018-10-10 15:29:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2021 transitions. [2018-10-10 15:29:27,794 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2021 transitions. Word has length 1910 [2018-10-10 15:29:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:27,795 INFO L481 AbstractCegarLoop]: Abstraction has 1996 states and 2021 transitions. [2018-10-10 15:29:27,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:29:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2021 transitions. [2018-10-10 15:29:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1996 [2018-10-10 15:29:27,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:27,825 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:27,826 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:27,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1583072272, now seen corresponding path program 30 times [2018-10-10 15:29:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 69633 backedges. 0 proven. 67683 refuted. 0 times theorem prover too weak. 1950 trivial. 0 not checked. [2018-10-10 15:29:42,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:29:42,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:29:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:29:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3604, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:29:42,442 INFO L87 Difference]: Start difference. First operand 1996 states and 2021 transitions. Second operand 62 states. [2018-10-10 15:30:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:04,527 INFO L93 Difference]: Finished difference Result 2164 states and 2191 transitions. [2018-10-10 15:30:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:30:04,528 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1995 [2018-10-10 15:30:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:04,535 INFO L225 Difference]: With dead ends: 2164 [2018-10-10 15:30:04,535 INFO L226 Difference]: Without dead ends: 2164 [2018-10-10 15:30:04,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1188, Invalid=20274, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 15:30:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-10-10 15:30:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2081. [2018-10-10 15:30:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-10-10 15:30:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2107 transitions. [2018-10-10 15:30:04,555 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2107 transitions. Word has length 1995 [2018-10-10 15:30:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:04,556 INFO L481 AbstractCegarLoop]: Abstraction has 2081 states and 2107 transitions. [2018-10-10 15:30:04,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:30:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2107 transitions. [2018-10-10 15:30:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2081 [2018-10-10 15:30:04,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:04,579 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:04,579 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:04,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash -964272259, now seen corresponding path program 31 times [2018-10-10 15:30:04,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 75934 backedges. 0 proven. 73890 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2018-10-10 15:30:20,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:20,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:30:20,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:30:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:30:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3848, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:30:20,511 INFO L87 Difference]: Start difference. First operand 2081 states and 2107 transitions. Second operand 64 states. [2018-10-10 15:30:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:44,226 INFO L93 Difference]: Finished difference Result 2249 states and 2277 transitions. [2018-10-10 15:30:44,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:30:44,226 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2080 [2018-10-10 15:30:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:44,240 INFO L225 Difference]: With dead ends: 2249 [2018-10-10 15:30:44,240 INFO L226 Difference]: Without dead ends: 2249 [2018-10-10 15:30:44,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4343 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1231, Invalid=21721, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:30:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-10-10 15:30:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2166. [2018-10-10 15:30:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2018-10-10 15:30:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2193 transitions. [2018-10-10 15:30:44,261 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2193 transitions. Word has length 2080 [2018-10-10 15:30:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:44,262 INFO L481 AbstractCegarLoop]: Abstraction has 2166 states and 2193 transitions. [2018-10-10 15:30:44,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:30:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2193 transitions. [2018-10-10 15:30:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2166 [2018-10-10 15:30:44,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:44,288 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:44,288 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:44,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:44,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1490144784, now seen corresponding path program 32 times [2018-10-10 15:30:44,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 82508 backedges. 0 proven. 80370 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2018-10-10 15:31:01,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:31:01,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:31:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:31:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=4100, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:31:01,327 INFO L87 Difference]: Start difference. First operand 2166 states and 2193 transitions. Second operand 66 states. [2018-10-10 15:31:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:27,020 INFO L93 Difference]: Finished difference Result 2334 states and 2363 transitions. [2018-10-10 15:31:27,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:31:27,020 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2165 [2018-10-10 15:31:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:27,025 INFO L225 Difference]: With dead ends: 2334 [2018-10-10 15:31:27,025 INFO L226 Difference]: Without dead ends: 2334 [2018-10-10 15:31:27,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4629 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1274, Invalid=23218, Unknown=0, NotChecked=0, Total=24492 [2018-10-10 15:31:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-10-10 15:31:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2251. [2018-10-10 15:31:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2018-10-10 15:31:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 2279 transitions. [2018-10-10 15:31:27,042 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 2279 transitions. Word has length 2165 [2018-10-10 15:31:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:27,043 INFO L481 AbstractCegarLoop]: Abstraction has 2251 states and 2279 transitions. [2018-10-10 15:31:27,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:31:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2279 transitions. [2018-10-10 15:31:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2251 [2018-10-10 15:31:27,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:27,068 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:27,069 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:27,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash -778018467, now seen corresponding path program 33 times [2018-10-10 15:31:27,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 89355 backedges. 0 proven. 87123 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2018-10-10 15:31:45,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:45,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:31:45,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:31:45,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:31:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4360, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:31:45,334 INFO L87 Difference]: Start difference. First operand 2251 states and 2279 transitions. Second operand 68 states. [2018-10-10 15:32:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:12,351 INFO L93 Difference]: Finished difference Result 2419 states and 2449 transitions. [2018-10-10 15:32:12,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-10 15:32:12,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 2250 [2018-10-10 15:32:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:12,356 INFO L225 Difference]: With dead ends: 2419 [2018-10-10 15:32:12,356 INFO L226 Difference]: Without dead ends: 2419 [2018-10-10 15:32:12,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4940 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1317, Invalid=24765, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:32:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-10 15:32:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2336. [2018-10-10 15:32:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2018-10-10 15:32:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 2365 transitions. [2018-10-10 15:32:12,370 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 2365 transitions. Word has length 2250 [2018-10-10 15:32:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:12,371 INFO L481 AbstractCegarLoop]: Abstraction has 2336 states and 2365 transitions. [2018-10-10 15:32:12,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:32:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2365 transitions. [2018-10-10 15:32:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2336 [2018-10-10 15:32:12,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:12,400 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 106, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:12,400 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:12,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2141931472, now seen corresponding path program 34 times [2018-10-10 15:32:12,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat