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/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 14:57:20,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 14:57:20,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 14:57:20,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 14:57:20,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 14:57:20,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 14:57:20,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 14:57:20,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 14:57:20,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 14:57:20,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 14:57:20,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 14:57:20,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 14:57:20,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 14:57:20,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 14:57:20,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 14:57:20,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 14:57:20,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 14:57:20,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 14:57:20,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 14:57:20,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 14:57:20,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 14:57:20,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 14:57:20,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 14:57:20,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 14:57:20,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 14:57:20,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 14:57:20,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 14:57:20,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 14:57:20,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 14:57:20,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 14:57:20,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 14:57:20,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 14:57:20,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 14:57:20,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 14:57:20,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 14:57:20,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 14:57:20,613 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-15 14:57:20,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 14:57:20,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 14:57:20,625 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 14:57:20,625 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 14:57:20,625 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 14:57:20,626 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 14:57:20,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 14:57:20,627 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 14:57:20,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 14:57:20,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 14:57:20,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 14:57:20,628 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 14:57:20,629 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 14:57:20,629 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 14:57:20,630 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 14:57:20,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 14:57:20,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 14:57:20,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 14:57:20,703 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 14:57:20,704 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 14:57:20,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2018-10-15 14:57:20,705 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2018-10-15 14:57:20,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 14:57:20,768 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 14:57:20,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 14:57:20,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 14:57:20,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 14:57:20,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 14:57:20,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 14:57:20,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 14:57:20,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 14:57:20,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (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-15 14:57:20,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 14:57:20,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 14:57:21,352 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 14:57:21,354 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:21 BoogieIcfgContainer [2018-10-15 14:57:21,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 14:57:21,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 14:57:21,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 14:57:21,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 14:57:21,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/2) ... [2018-10-15 14:57:21,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6e57d4 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:21, skipping insertion in model container [2018-10-15 14:57:21,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:21" (2/2) ... [2018-10-15 14:57:21,373 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2018-10-15 14:57:21,398 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 14:57:21,417 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 14:57:21,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 14:57:21,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 14:57:21,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 14:57:21,529 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 14:57:21,529 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 14:57:21,529 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 14:57:21,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 14:57:21,530 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 14:57:21,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 14:57:21,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 14:57:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-15 14:57:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 14:57:21,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:21,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:21,583 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:21,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash 452380209, now seen corresponding path program 1 times [2018-10-15 14:57:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:21,821 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-15 14:57:21,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 14:57:21,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 14:57:21,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 14:57:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 14:57:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 14:57:21,846 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-15 14:57:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:21,922 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 14:57:21,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 14:57:21,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-15 14:57:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:21,936 INFO L225 Difference]: With dead ends: 27 [2018-10-15 14:57:21,936 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 14:57:21,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 14:57:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 14:57:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-10-15 14:57:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 14:57:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 14:57:21,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 15 [2018-10-15 14:57:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:21,975 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 14:57:21,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 14:57:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 14:57:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 14:57:21,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:21,977 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:21,977 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:21,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash -911457384, now seen corresponding path program 1 times [2018-10-15 14:57:21,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:22,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:22,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 14:57:22,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 14:57:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 14:57:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 14:57:22,077 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2018-10-15 14:57:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:22,292 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 14:57:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 14:57:22,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-15 14:57:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:22,294 INFO L225 Difference]: With dead ends: 34 [2018-10-15 14:57:22,294 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 14:57:22,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 14:57:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-10-15 14:57:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 14:57:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-15 14:57:22,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 22 [2018-10-15 14:57:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:22,301 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-15 14:57:22,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 14:57:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-15 14:57:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 14:57:22,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:22,302 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:22,302 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:22,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash -740740015, now seen corresponding path program 2 times [2018-10-15 14:57:22,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:22,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:22,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 14:57:22,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 14:57:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 14:57:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:22,628 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 7 states. [2018-10-15 14:57:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:22,852 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 14:57:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 14:57:22,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-10-15 14:57:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:22,854 INFO L225 Difference]: With dead ends: 41 [2018-10-15 14:57:22,854 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 14:57:22,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 14:57:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-15 14:57:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 14:57:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 14:57:22,861 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 29 [2018-10-15 14:57:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:22,862 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 14:57:22,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 14:57:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 14:57:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 14:57:22,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:22,864 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:22,865 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:22,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1811394936, now seen corresponding path program 3 times [2018-10-15 14:57:22,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 14:57:23,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 14:57:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 14:57:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 14:57:23,074 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 9 states. [2018-10-15 14:57:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:23,532 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 14:57:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 14:57:23,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-10-15 14:57:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:23,534 INFO L225 Difference]: With dead ends: 48 [2018-10-15 14:57:23,534 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 14:57:23,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 14:57:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-15 14:57:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-15 14:57:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-15 14:57:23,542 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 36 [2018-10-15 14:57:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:23,542 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-15 14:57:23,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 14:57:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-15 14:57:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-15 14:57:23,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:23,544 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:23,545 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:23,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -598709647, now seen corresponding path program 4 times [2018-10-15 14:57:23,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:23,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:23,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 14:57:23,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 14:57:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 14:57:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:23,850 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 11 states. [2018-10-15 14:57:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:24,138 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-15 14:57:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 14:57:24,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-10-15 14:57:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:24,141 INFO L225 Difference]: With dead ends: 55 [2018-10-15 14:57:24,142 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 14:57:24,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 14:57:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-10-15 14:57:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 14:57:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 14:57:24,149 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 43 [2018-10-15 14:57:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:24,149 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 14:57:24,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 14:57:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 14:57:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 14:57:24,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:24,151 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:24,152 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:24,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1153607848, now seen corresponding path program 5 times [2018-10-15 14:57:24,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:24,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:24,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 14:57:24,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 14:57:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 14:57:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 14:57:24,390 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 13 states. [2018-10-15 14:57:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:25,005 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 14:57:25,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 14:57:25,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-10-15 14:57:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:25,008 INFO L225 Difference]: With dead ends: 62 [2018-10-15 14:57:25,008 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 14:57:25,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:25,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 14:57:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-10-15 14:57:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 14:57:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 14:57:25,015 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 50 [2018-10-15 14:57:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:25,016 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 14:57:25,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 14:57:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 14:57:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 14:57:25,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:25,017 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:25,018 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:25,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash -866228079, now seen corresponding path program 6 times [2018-10-15 14:57:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:25,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:25,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 14:57:25,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 14:57:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 14:57:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:25,229 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 15 states. [2018-10-15 14:57:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:25,592 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 14:57:25,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 14:57:25,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-10-15 14:57:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:25,595 INFO L225 Difference]: With dead ends: 69 [2018-10-15 14:57:25,595 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 14:57:25,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 14:57:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-15 14:57:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 14:57:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 14:57:25,611 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 57 [2018-10-15 14:57:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:25,612 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 14:57:25,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 14:57:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 14:57:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 14:57:25,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:25,615 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:25,615 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:25,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2033923384, now seen corresponding path program 7 times [2018-10-15 14:57:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:26,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:26,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 14:57:26,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 14:57:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 14:57:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 14:57:26,026 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 17 states. [2018-10-15 14:57:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:26,336 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 14:57:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 14:57:26,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-10-15 14:57:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:26,345 INFO L225 Difference]: With dead ends: 76 [2018-10-15 14:57:26,345 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 14:57:26,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 14:57:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-10-15 14:57:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-15 14:57:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-15 14:57:26,353 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 64 [2018-10-15 14:57:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:26,353 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-15 14:57:26,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 14:57:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-15 14:57:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-15 14:57:26,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:26,356 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:26,357 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash 277163697, now seen corresponding path program 8 times [2018-10-15 14:57:26,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:26,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 14:57:26,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 14:57:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 14:57:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:26,635 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 19 states. [2018-10-15 14:57:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:27,254 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-15 14:57:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 14:57:27,255 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-10-15 14:57:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:27,256 INFO L225 Difference]: With dead ends: 83 [2018-10-15 14:57:27,256 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 14:57:27,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 14:57:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-10-15 14:57:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 14:57:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 14:57:27,265 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 71 [2018-10-15 14:57:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:27,266 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 14:57:27,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 14:57:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 14:57:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 14:57:27,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:27,267 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:27,268 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:27,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2094052584, now seen corresponding path program 9 times [2018-10-15 14:57:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:27,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 14:57:27,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 14:57:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 14:57:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 14:57:27,606 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 21 states. [2018-10-15 14:57:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:28,165 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 14:57:28,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 14:57:28,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-10-15 14:57:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:28,166 INFO L225 Difference]: With dead ends: 90 [2018-10-15 14:57:28,166 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 14:57:28,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 14:57:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-10-15 14:57:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 14:57:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 14:57:28,174 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 78 [2018-10-15 14:57:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:28,174 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 14:57:28,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 14:57:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 14:57:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 14:57:28,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:28,176 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:28,176 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:28,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:28,177 INFO L82 PathProgramCache]: Analyzing trace with hash 164019409, now seen corresponding path program 10 times [2018-10-15 14:57:28,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:28,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:28,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 14:57:28,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 14:57:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 14:57:28,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:28,534 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 23 states. [2018-10-15 14:57:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:28,942 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 14:57:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 14:57:28,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-15 14:57:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:28,943 INFO L225 Difference]: With dead ends: 97 [2018-10-15 14:57:28,944 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 14:57:28,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 14:57:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-10-15 14:57:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 14:57:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 14:57:28,950 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 85 [2018-10-15 14:57:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:28,951 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 14:57:28,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 14:57:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 14:57:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 14:57:28,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:28,954 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:28,954 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:28,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1311270664, now seen corresponding path program 11 times [2018-10-15 14:57:28,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:29,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:29,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 14:57:29,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 14:57:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 14:57:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 14:57:29,288 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 25 states. [2018-10-15 14:57:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:29,826 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 14:57:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 14:57:29,826 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2018-10-15 14:57:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:29,828 INFO L225 Difference]: With dead ends: 104 [2018-10-15 14:57:29,828 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 14:57:29,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:57:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 14:57:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-10-15 14:57:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 14:57:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 14:57:29,836 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 92 [2018-10-15 14:57:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:29,836 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 14:57:29,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 14:57:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 14:57:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 14:57:29,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:29,838 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:29,838 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:29,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 765793009, now seen corresponding path program 12 times [2018-10-15 14:57:29,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:30,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:30,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 14:57:30,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 14:57:30,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 14:57:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:30,188 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 27 states. [2018-10-15 14:57:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:30,904 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-15 14:57:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 14:57:30,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-10-15 14:57:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:30,905 INFO L225 Difference]: With dead ends: 111 [2018-10-15 14:57:30,905 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 14:57:30,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:57:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 14:57:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-10-15 14:57:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 14:57:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 14:57:30,912 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 99 [2018-10-15 14:57:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:30,912 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 14:57:30,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 14:57:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 14:57:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 14:57:30,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:30,914 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:30,914 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:30,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1183703336, now seen corresponding path program 13 times [2018-10-15 14:57:30,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:31,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 14:57:31,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 14:57:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 14:57:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 14:57:31,432 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 29 states. [2018-10-15 14:57:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:32,348 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 14:57:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 14:57:32,351 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 106 [2018-10-15 14:57:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:32,352 INFO L225 Difference]: With dead ends: 118 [2018-10-15 14:57:32,352 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 14:57:32,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:57:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 14:57:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-10-15 14:57:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 14:57:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-15 14:57:32,358 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 106 [2018-10-15 14:57:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:32,358 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-15 14:57:32,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 14:57:32,359 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-15 14:57:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-15 14:57:32,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:32,360 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:32,360 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:32,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:32,360 INFO L82 PathProgramCache]: Analyzing trace with hash 639774993, now seen corresponding path program 14 times [2018-10-15 14:57:32,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:33,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:33,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 14:57:33,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 14:57:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 14:57:33,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:33,019 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 31 states. [2018-10-15 14:57:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:33,694 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-15 14:57:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 14:57:33,694 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 113 [2018-10-15 14:57:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:33,696 INFO L225 Difference]: With dead ends: 125 [2018-10-15 14:57:33,696 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 14:57:33,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:57:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 14:57:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-10-15 14:57:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 14:57:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 14:57:33,702 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 113 [2018-10-15 14:57:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:33,702 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 14:57:33,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 14:57:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 14:57:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 14:57:33,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:33,703 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:33,704 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:33,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash 163372216, now seen corresponding path program 15 times [2018-10-15 14:57:33,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:34,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:34,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 14:57:34,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 14:57:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 14:57:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 14:57:34,851 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 33 states. [2018-10-15 14:57:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:35,548 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 14:57:35,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 14:57:35,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-10-15 14:57:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:35,551 INFO L225 Difference]: With dead ends: 132 [2018-10-15 14:57:35,551 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 14:57:35,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:57:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 14:57:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-10-15 14:57:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 14:57:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 14:57:35,556 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 120 [2018-10-15 14:57:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:35,556 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 14:57:35,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 14:57:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 14:57:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 14:57:35,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:35,558 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:35,558 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -239069391, now seen corresponding path program 16 times [2018-10-15 14:57:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:36,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:36,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 14:57:36,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 14:57:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 14:57:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:36,305 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 35 states. [2018-10-15 14:57:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:37,159 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 14:57:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 14:57:37,168 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 127 [2018-10-15 14:57:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:37,169 INFO L225 Difference]: With dead ends: 139 [2018-10-15 14:57:37,169 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 14:57:37,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:57:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 14:57:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-10-15 14:57:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 14:57:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 14:57:37,175 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 127 [2018-10-15 14:57:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:37,182 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 14:57:37,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 14:57:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 14:57:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 14:57:37,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:37,183 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:37,187 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:37,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1376398696, now seen corresponding path program 17 times [2018-10-15 14:57:37,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:37,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 14:57:37,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 14:57:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 14:57:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 14:57:37,858 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 37 states. [2018-10-15 14:57:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:38,971 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 14:57:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 14:57:38,971 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 134 [2018-10-15 14:57:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:38,973 INFO L225 Difference]: With dead ends: 146 [2018-10-15 14:57:38,973 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 14:57:38,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:57:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 14:57:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2018-10-15 14:57:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-15 14:57:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-15 14:57:38,979 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 134 [2018-10-15 14:57:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:38,979 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-15 14:57:38,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 14:57:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-15 14:57:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-15 14:57:38,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:38,980 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:38,980 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:38,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 58770769, now seen corresponding path program 18 times [2018-10-15 14:57:38,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:39,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:39,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 14:57:39,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 14:57:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 14:57:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:39,987 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 39 states. [2018-10-15 14:57:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:40,986 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 14:57:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 14:57:40,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 141 [2018-10-15 14:57:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:40,988 INFO L225 Difference]: With dead ends: 153 [2018-10-15 14:57:40,988 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 14:57:40,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:57:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 14:57:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-10-15 14:57:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 14:57:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-15 14:57:40,994 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 141 [2018-10-15 14:57:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:40,994 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-15 14:57:40,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 14:57:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-15 14:57:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 14:57:40,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:40,995 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:40,996 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:40,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash 752550008, now seen corresponding path program 19 times [2018-10-15 14:57:40,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 14:57:41,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 14:57:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 14:57:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 14:57:41,691 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 41 states. [2018-10-15 14:57:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:42,739 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 14:57:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 14:57:42,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 148 [2018-10-15 14:57:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:42,741 INFO L225 Difference]: With dead ends: 160 [2018-10-15 14:57:42,742 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 14:57:42,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:57:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 14:57:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-10-15 14:57:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 14:57:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 14:57:42,748 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 148 [2018-10-15 14:57:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:42,749 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 14:57:42,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 14:57:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 14:57:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 14:57:42,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:42,750 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:42,750 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:42,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1659255665, now seen corresponding path program 20 times [2018-10-15 14:57:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:43,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 14:57:43,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 14:57:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 14:57:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:43,520 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 43 states. [2018-10-15 14:57:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:44,670 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-15 14:57:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 14:57:44,670 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 155 [2018-10-15 14:57:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:44,672 INFO L225 Difference]: With dead ends: 167 [2018-10-15 14:57:44,672 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 14:57:44,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:57:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 14:57:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-10-15 14:57:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 14:57:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 14:57:44,678 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 155 [2018-10-15 14:57:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:44,679 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 14:57:44,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 14:57:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 14:57:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 14:57:44,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:44,680 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:44,680 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:44,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1755997784, now seen corresponding path program 21 times [2018-10-15 14:57:44,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:45,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:45,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 14:57:45,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 14:57:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 14:57:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 14:57:45,592 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 45 states. [2018-10-15 14:57:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:47,055 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 14:57:47,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 14:57:47,063 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 162 [2018-10-15 14:57:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:47,064 INFO L225 Difference]: With dead ends: 174 [2018-10-15 14:57:47,064 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 14:57:47,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 14:57:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 14:57:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-10-15 14:57:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 14:57:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 14:57:47,069 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 162 [2018-10-15 14:57:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:47,069 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 14:57:47,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 14:57:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 14:57:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 14:57:47,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:47,071 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:47,071 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:47,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:47,071 INFO L82 PathProgramCache]: Analyzing trace with hash -873301615, now seen corresponding path program 22 times [2018-10-15 14:57:47,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:47,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:47,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 14:57:47,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 14:57:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 14:57:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:57:47,764 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 47 states. [2018-10-15 14:57:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:49,169 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 14:57:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 14:57:49,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 169 [2018-10-15 14:57:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:49,172 INFO L225 Difference]: With dead ends: 181 [2018-10-15 14:57:49,172 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 14:57:49,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 14:57:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 14:57:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-10-15 14:57:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 14:57:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 14:57:49,177 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 169 [2018-10-15 14:57:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:49,177 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 14:57:49,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 14:57:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 14:57:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 14:57:49,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:49,178 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:49,179 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:49,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2132935736, now seen corresponding path program 23 times [2018-10-15 14:57:49,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:49,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:49,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 14:57:49,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 14:57:49,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 14:57:49,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 14:57:49,951 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 49 states. [2018-10-15 14:57:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:51,420 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 14:57:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 14:57:51,421 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 176 [2018-10-15 14:57:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:51,422 INFO L225 Difference]: With dead ends: 188 [2018-10-15 14:57:51,422 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 14:57:51,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:57:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 14:57:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-10-15 14:57:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-15 14:57:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-15 14:57:51,428 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 176 [2018-10-15 14:57:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:51,428 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-15 14:57:51,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 14:57:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-15 14:57:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-15 14:57:51,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:51,429 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:51,430 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:51,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash -819494991, now seen corresponding path program 24 times [2018-10-15 14:57:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 14:57:52,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 14:57:52,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 14:57:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:57:52,319 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 51 states. [2018-10-15 14:57:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:53,902 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-15 14:57:53,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 14:57:53,903 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 183 [2018-10-15 14:57:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:53,904 INFO L225 Difference]: With dead ends: 195 [2018-10-15 14:57:53,904 INFO L226 Difference]: Without dead ends: 195 [2018-10-15 14:57:53,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 14:57:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-15 14:57:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-10-15 14:57:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 14:57:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 14:57:53,910 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 183 [2018-10-15 14:57:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:53,910 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 14:57:53,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 14:57:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 14:57:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 14:57:53,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:53,912 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:53,912 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:53,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1451238888, now seen corresponding path program 25 times [2018-10-15 14:57:53,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:54,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:54,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 14:57:54,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 14:57:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 14:57:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 14:57:54,795 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 53 states. [2018-10-15 14:57:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:57,066 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 14:57:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 14:57:57,067 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-10-15 14:57:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:57,069 INFO L225 Difference]: With dead ends: 202 [2018-10-15 14:57:57,069 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 14:57:57,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 14:57:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 14:57:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-10-15 14:57:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-15 14:57:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-15 14:57:57,074 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 190 [2018-10-15 14:57:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:57,074 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-15 14:57:57,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 14:57:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-15 14:57:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-15 14:57:57,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:57,076 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:57,076 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:57,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -242790959, now seen corresponding path program 26 times [2018-10-15 14:57:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:58,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:58,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 14:57:58,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 14:57:58,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 14:57:58,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:57:58,270 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 55 states. [2018-10-15 14:58:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:00,229 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 14:58:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 14:58:00,230 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 197 [2018-10-15 14:58:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:00,231 INFO L225 Difference]: With dead ends: 209 [2018-10-15 14:58:00,232 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 14:58:00,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 14:58:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 14:58:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-10-15 14:58:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 14:58:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 14:58:00,237 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 197 [2018-10-15 14:58:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:00,237 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 14:58:00,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 14:58:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 14:58:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 14:58:00,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:00,239 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:00,239 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:00,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:00,239 INFO L82 PathProgramCache]: Analyzing trace with hash 478275576, now seen corresponding path program 27 times [2018-10-15 14:58:00,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:02,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:02,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 14:58:02,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 14:58:02,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 14:58:02,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 14:58:02,003 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 57 states. [2018-10-15 14:58:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:05,025 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-15 14:58:05,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 14:58:05,026 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 204 [2018-10-15 14:58:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:05,028 INFO L225 Difference]: With dead ends: 216 [2018-10-15 14:58:05,028 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 14:58:05,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 14:58:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 14:58:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2018-10-15 14:58:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-15 14:58:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-15 14:58:05,033 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 204 [2018-10-15 14:58:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:05,033 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-15 14:58:05,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 14:58:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-15 14:58:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-15 14:58:05,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:05,034 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:05,035 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:05,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash -862723087, now seen corresponding path program 28 times [2018-10-15 14:58:05,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:06,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:06,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 14:58:06,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 14:58:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 14:58:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:58:06,325 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 59 states. [2018-10-15 14:58:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:08,438 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-15 14:58:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 14:58:08,439 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 211 [2018-10-15 14:58:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:08,441 INFO L225 Difference]: With dead ends: 223 [2018-10-15 14:58:08,441 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 14:58:08,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 14:58:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 14:58:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2018-10-15 14:58:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 14:58:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 14:58:08,446 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 211 [2018-10-15 14:58:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:08,446 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 14:58:08,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 14:58:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 14:58:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 14:58:08,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:08,448 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:08,448 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:08,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:08,448 INFO L82 PathProgramCache]: Analyzing trace with hash -395956776, now seen corresponding path program 29 times [2018-10-15 14:58:08,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 14:58:09,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 14:58:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 14:58:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 14:58:09,572 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 61 states. [2018-10-15 14:58:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:11,501 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-15 14:58:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 14:58:11,502 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 218 [2018-10-15 14:58:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:11,504 INFO L225 Difference]: With dead ends: 230 [2018-10-15 14:58:11,504 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 14:58:11,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 14:58:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 14:58:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2018-10-15 14:58:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-15 14:58:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-15 14:58:11,510 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 218 [2018-10-15 14:58:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:11,511 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-15 14:58:11,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 14:58:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-15 14:58:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-15 14:58:11,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:11,513 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:11,513 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:11,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash 776946193, now seen corresponding path program 30 times [2018-10-15 14:58:11,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:13,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:13,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 14:58:13,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 14:58:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 14:58:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:58:13,704 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 63 states. [2018-10-15 14:58:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:15,864 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-15 14:58:15,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 14:58:15,864 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 225 [2018-10-15 14:58:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:15,867 INFO L225 Difference]: With dead ends: 237 [2018-10-15 14:58:15,867 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 14:58:15,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 14:58:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 14:58:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-10-15 14:58:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 14:58:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-15 14:58:15,872 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 225 [2018-10-15 14:58:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:15,873 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-15 14:58:15,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 14:58:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-15 14:58:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 14:58:15,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:15,874 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:15,874 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:15,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:15,875 INFO L82 PathProgramCache]: Analyzing trace with hash -655709256, now seen corresponding path program 31 times [2018-10-15 14:58:15,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3317 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:17,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 14:58:17,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 14:58:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 14:58:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 14:58:17,650 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 65 states. [2018-10-15 14:58:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:19,886 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 14:58:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 14:58:19,886 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 232 [2018-10-15 14:58:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:19,889 INFO L225 Difference]: With dead ends: 244 [2018-10-15 14:58:19,889 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 14:58:19,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 14:58:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 14:58:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2018-10-15 14:58:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 14:58:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 14:58:19,894 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 232 [2018-10-15 14:58:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:19,895 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 14:58:19,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 14:58:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 14:58:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 14:58:19,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:19,896 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:19,896 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:19,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:19,897 INFO L82 PathProgramCache]: Analyzing trace with hash 960194609, now seen corresponding path program 32 times [2018-10-15 14:58:19,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3536 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:21,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:21,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 14:58:21,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 14:58:21,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 14:58:21,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:58:21,531 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 67 states. [2018-10-15 14:58:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:24,284 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-15 14:58:24,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 14:58:24,300 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 239 [2018-10-15 14:58:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:24,301 INFO L225 Difference]: With dead ends: 251 [2018-10-15 14:58:24,301 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 14:58:24,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 14:58:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 14:58:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-10-15 14:58:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 14:58:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-15 14:58:24,307 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 239 [2018-10-15 14:58:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:24,307 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-15 14:58:24,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 14:58:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-15 14:58:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 14:58:24,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:24,309 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:24,310 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:24,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1431134616, now seen corresponding path program 33 times [2018-10-15 14:58:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3762 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:26,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:26,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 14:58:26,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 14:58:26,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 14:58:26,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 14:58:26,354 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 69 states. [2018-10-15 14:58:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:29,213 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 14:58:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 14:58:29,213 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 246 [2018-10-15 14:58:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:29,215 INFO L225 Difference]: With dead ends: 258 [2018-10-15 14:58:29,215 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 14:58:29,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 14:58:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 14:58:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2018-10-15 14:58:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 14:58:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 14:58:29,220 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 246 [2018-10-15 14:58:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:29,220 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 14:58:29,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 14:58:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 14:58:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 14:58:29,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:29,221 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:29,222 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:29,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2074454447, now seen corresponding path program 34 times [2018-10-15 14:58:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3995 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:31,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:31,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 14:58:31,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 14:58:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 14:58:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:58:31,257 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 71 states. [2018-10-15 14:58:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:34,183 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 14:58:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 14:58:34,184 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 253 [2018-10-15 14:58:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:34,186 INFO L225 Difference]: With dead ends: 265 [2018-10-15 14:58:34,186 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 14:58:34,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 14:58:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 14:58:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2018-10-15 14:58:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 14:58:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 14:58:34,191 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 253 [2018-10-15 14:58:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:34,191 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 14:58:34,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 14:58:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 14:58:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 14:58:34,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:34,193 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:34,193 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:34,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1078742904, now seen corresponding path program 35 times [2018-10-15 14:58:34,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:35,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:35,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 14:58:35,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 14:58:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 14:58:35,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 14:58:35,950 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 73 states. [2018-10-15 14:58:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:38,963 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-15 14:58:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 14:58:38,963 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2018-10-15 14:58:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:38,965 INFO L225 Difference]: With dead ends: 272 [2018-10-15 14:58:38,965 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 14:58:38,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 14:58:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 14:58:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2018-10-15 14:58:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-15 14:58:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-10-15 14:58:38,970 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 260 [2018-10-15 14:58:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:38,970 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-10-15 14:58:38,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 14:58:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-10-15 14:58:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 14:58:38,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:38,972 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:38,972 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:38,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash 992873585, now seen corresponding path program 36 times [2018-10-15 14:58:38,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4482 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:41,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:41,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 14:58:41,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 14:58:41,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 14:58:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:58:41,092 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 75 states. [2018-10-15 14:58:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:44,367 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-15 14:58:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 14:58:44,368 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 267 [2018-10-15 14:58:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:44,370 INFO L225 Difference]: With dead ends: 279 [2018-10-15 14:58:44,370 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 14:58:44,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 14:58:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 14:58:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-10-15 14:58:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 14:58:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 14:58:44,375 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 267 [2018-10-15 14:58:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:44,376 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 14:58:44,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 14:58:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 14:58:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 14:58:44,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:44,378 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:44,378 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:44,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -668633768, now seen corresponding path program 37 times [2018-10-15 14:58:44,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4736 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:46,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:46,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 14:58:46,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 14:58:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 14:58:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 14:58:46,543 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 77 states. [2018-10-15 14:58:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:49,827 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-15 14:58:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 14:58:49,828 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 274 [2018-10-15 14:58:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:49,829 INFO L225 Difference]: With dead ends: 286 [2018-10-15 14:58:49,829 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 14:58:49,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 14:58:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 14:58:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2018-10-15 14:58:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-15 14:58:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-15 14:58:49,836 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 274 [2018-10-15 14:58:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:49,836 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-15 14:58:49,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 14:58:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-15 14:58:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-15 14:58:49,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:49,838 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:49,838 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:49,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1035504273, now seen corresponding path program 38 times [2018-10-15 14:58:49,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4997 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:52,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:52,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 14:58:52,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 14:58:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 14:58:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:58:52,492 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 79 states. [2018-10-15 14:58:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:55,850 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-15 14:58:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 14:58:55,850 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 281 [2018-10-15 14:58:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:55,853 INFO L225 Difference]: With dead ends: 293 [2018-10-15 14:58:55,853 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 14:58:55,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 14:58:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 14:58:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2018-10-15 14:58:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 14:58:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-15 14:58:55,858 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 281 [2018-10-15 14:58:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:55,859 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-15 14:58:55,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 14:58:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-15 14:58:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 14:58:55,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:55,860 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:55,861 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:55,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1768500424, now seen corresponding path program 39 times [2018-10-15 14:58:55,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:58,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:58,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 14:58:58,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 14:58:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 14:58:58,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 14:58:58,421 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 81 states. [2018-10-15 14:59:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:01,903 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-15 14:59:01,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 14:59:01,903 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 288 [2018-10-15 14:59:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:01,905 INFO L225 Difference]: With dead ends: 300 [2018-10-15 14:59:01,905 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 14:59:01,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 14:59:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 14:59:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2018-10-15 14:59:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-15 14:59:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-15 14:59:01,910 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 288 [2018-10-15 14:59:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:01,911 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-15 14:59:01,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 14:59:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-15 14:59:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 14:59:01,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:01,912 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:01,913 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:01,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1081856177, now seen corresponding path program 40 times [2018-10-15 14:59:01,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5540 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:04,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:04,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 14:59:04,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 14:59:04,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 14:59:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:59:04,247 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 83 states. [2018-10-15 14:59:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:07,814 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-15 14:59:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 14:59:07,815 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 295 [2018-10-15 14:59:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:07,820 INFO L225 Difference]: With dead ends: 307 [2018-10-15 14:59:07,820 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 14:59:07,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 14:59:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 14:59:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-10-15 14:59:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 14:59:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-15 14:59:07,826 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 295 [2018-10-15 14:59:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:07,826 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-15 14:59:07,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 14:59:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-15 14:59:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 14:59:07,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:07,828 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:07,828 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:07,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 283011352, now seen corresponding path program 41 times [2018-10-15 14:59:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5822 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:10,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 14:59:10,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 14:59:10,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 14:59:10,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 14:59:10,158 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 85 states. [2018-10-15 14:59:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:14,179 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-15 14:59:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 14:59:14,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 302 [2018-10-15 14:59:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:14,181 INFO L225 Difference]: With dead ends: 314 [2018-10-15 14:59:14,181 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 14:59:14,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 14:59:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 14:59:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2018-10-15 14:59:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 14:59:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-15 14:59:14,185 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 302 [2018-10-15 14:59:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:14,185 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-15 14:59:14,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 14:59:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-15 14:59:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 14:59:14,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:14,187 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:14,187 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:14,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -327557423, now seen corresponding path program 42 times [2018-10-15 14:59:14,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6111 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:16,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:16,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 14:59:16,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 14:59:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 14:59:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 14:59:16,412 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 87 states. [2018-10-15 14:59:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:20,822 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-15 14:59:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 14:59:20,823 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 309 [2018-10-15 14:59:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:20,824 INFO L225 Difference]: With dead ends: 321 [2018-10-15 14:59:20,824 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 14:59:20,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 14:59:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 14:59:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2018-10-15 14:59:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 14:59:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-15 14:59:20,829 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 309 [2018-10-15 14:59:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:20,829 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-15 14:59:20,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 14:59:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-15 14:59:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 14:59:20,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:20,830 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:20,831 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:20,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:20,831 INFO L82 PathProgramCache]: Analyzing trace with hash -675662088, now seen corresponding path program 43 times [2018-10-15 14:59:20,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6407 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:23,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:23,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 14:59:23,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 14:59:23,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 14:59:23,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 14:59:23,211 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 89 states. [2018-10-15 14:59:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:27,627 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 14:59:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 14:59:27,627 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 316 [2018-10-15 14:59:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:27,629 INFO L225 Difference]: With dead ends: 328 [2018-10-15 14:59:27,629 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 14:59:27,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 14:59:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 14:59:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-10-15 14:59:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-15 14:59:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-10-15 14:59:27,634 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 316 [2018-10-15 14:59:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:27,634 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-10-15 14:59:27,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 14:59:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-10-15 14:59:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-15 14:59:27,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:27,636 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:27,636 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:27,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash -13323023, now seen corresponding path program 44 times [2018-10-15 14:59:27,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6710 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:30,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:30,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 14:59:30,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 14:59:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 14:59:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 14:59:30,336 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 91 states. [2018-10-15 14:59:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:34,877 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 14:59:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 14:59:34,877 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 323 [2018-10-15 14:59:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:34,878 INFO L225 Difference]: With dead ends: 335 [2018-10-15 14:59:34,879 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 14:59:34,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 14:59:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 14:59:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-10-15 14:59:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 14:59:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-15 14:59:34,883 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 323 [2018-10-15 14:59:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:34,884 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-15 14:59:34,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 14:59:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-15 14:59:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 14:59:34,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:34,886 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:34,886 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:34,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1466449112, now seen corresponding path program 45 times [2018-10-15 14:59:34,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7020 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:37,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:37,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 14:59:37,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 14:59:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 14:59:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 14:59:37,419 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 93 states. [2018-10-15 14:59:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:42,096 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-10-15 14:59:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 14:59:42,096 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 330 [2018-10-15 14:59:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:42,098 INFO L225 Difference]: With dead ends: 342 [2018-10-15 14:59:42,098 INFO L226 Difference]: Without dead ends: 342 [2018-10-15 14:59:42,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 14:59:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-15 14:59:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2018-10-15 14:59:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-15 14:59:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-10-15 14:59:42,103 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 330 [2018-10-15 14:59:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:42,104 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-10-15 14:59:42,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 14:59:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-10-15 14:59:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-15 14:59:42,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:42,105 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:42,105 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:42,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1789809425, now seen corresponding path program 46 times [2018-10-15 14:59:42,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:45,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 14:59:45,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 14:59:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 14:59:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:59:45,039 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 95 states. [2018-10-15 14:59:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:49,826 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-10-15 14:59:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 14:59:49,827 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 337 [2018-10-15 14:59:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:49,829 INFO L225 Difference]: With dead ends: 349 [2018-10-15 14:59:49,829 INFO L226 Difference]: Without dead ends: 349 [2018-10-15 14:59:49,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 14:59:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-15 14:59:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-10-15 14:59:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-15 14:59:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-10-15 14:59:49,833 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 337 [2018-10-15 14:59:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:49,833 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-10-15 14:59:49,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 14:59:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-10-15 14:59:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-15 14:59:49,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:49,835 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:49,835 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:49,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1213826376, now seen corresponding path program 47 times [2018-10-15 14:59:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7661 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:52,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:52,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 14:59:52,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 14:59:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 14:59:52,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 14:59:52,498 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 97 states. [2018-10-15 14:59:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:57,862 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-15 14:59:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 14:59:57,862 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 344 [2018-10-15 14:59:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:57,864 INFO L225 Difference]: With dead ends: 356 [2018-10-15 14:59:57,864 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 14:59:57,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 14:59:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 14:59:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2018-10-15 14:59:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-15 14:59:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-10-15 14:59:57,871 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 344 [2018-10-15 14:59:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:57,871 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-10-15 14:59:57,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 14:59:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-10-15 14:59:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-15 14:59:57,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:57,873 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:57,873 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:57,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1969797425, now seen corresponding path program 48 times [2018-10-15 14:59:57,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7992 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:00:01,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:00:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:00:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:00:01,051 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 99 states. [2018-10-15 15:00:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:06,294 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-10-15 15:00:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 15:00:06,294 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 351 [2018-10-15 15:00:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:06,296 INFO L225 Difference]: With dead ends: 363 [2018-10-15 15:00:06,296 INFO L226 Difference]: Without dead ends: 363 [2018-10-15 15:00:06,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:00:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-15 15:00:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-10-15 15:00:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 15:00:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-15 15:00:06,301 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 351 [2018-10-15 15:00:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:06,302 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-15 15:00:06,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:00:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-15 15:00:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 15:00:06,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:06,304 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:06,304 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:06,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1145900904, now seen corresponding path program 49 times [2018-10-15 15:00:06,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8330 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:09,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:00:09,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:00:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:00:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:00:09,232 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 101 states. [2018-10-15 15:00:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:14,872 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-10-15 15:00:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:00:14,873 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 358 [2018-10-15 15:00:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:14,875 INFO L225 Difference]: With dead ends: 370 [2018-10-15 15:00:14,875 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 15:00:14,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:00:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 15:00:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2018-10-15 15:00:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-15 15:00:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-10-15 15:00:14,881 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 358 [2018-10-15 15:00:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:14,881 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-10-15 15:00:14,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:00:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-10-15 15:00:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-15 15:00:14,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:14,883 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:14,884 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:14,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -630855855, now seen corresponding path program 50 times [2018-10-15 15:00:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8675 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:17,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:17,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:00:17,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:00:17,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:00:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:00:17,870 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 103 states. [2018-10-15 15:00:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:23,526 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-15 15:00:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 15:00:23,527 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 365 [2018-10-15 15:00:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:23,529 INFO L225 Difference]: With dead ends: 377 [2018-10-15 15:00:23,529 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 15:00:23,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:00:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 15:00:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 373. [2018-10-15 15:00:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-15 15:00:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-15 15:00:23,534 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 365 [2018-10-15 15:00:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:23,534 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-15 15:00:23,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:00:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-15 15:00:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-15 15:00:23,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:23,536 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:23,537 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:23,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1572102536, now seen corresponding path program 51 times [2018-10-15 15:00:23,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9027 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:27,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:27,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:00:27,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:00:27,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:00:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:00:27,071 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 105 states. [2018-10-15 15:00:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:32,934 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-10-15 15:00:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 15:00:32,934 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 372 [2018-10-15 15:00:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:32,935 INFO L225 Difference]: With dead ends: 384 [2018-10-15 15:00:32,935 INFO L226 Difference]: Without dead ends: 384 [2018-10-15 15:00:32,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:00:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-15 15:00:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2018-10-15 15:00:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 15:00:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 15:00:32,940 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 372 [2018-10-15 15:00:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:32,941 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 15:00:32,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:00:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 15:00:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 15:00:32,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:32,943 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:32,944 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:32,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash -383263375, now seen corresponding path program 52 times [2018-10-15 15:00:32,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9386 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:36,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:36,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:00:36,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:00:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:00:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:00:36,393 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 107 states. [2018-10-15 15:00:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:42,543 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-15 15:00:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 15:00:42,544 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 379 [2018-10-15 15:00:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:42,546 INFO L225 Difference]: With dead ends: 391 [2018-10-15 15:00:42,546 INFO L226 Difference]: Without dead ends: 391 [2018-10-15 15:00:42,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:00:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-15 15:00:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 387. [2018-10-15 15:00:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-15 15:00:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-15 15:00:42,551 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 379 [2018-10-15 15:00:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:42,551 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-15 15:00:42,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:00:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-15 15:00:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-15 15:00:42,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:42,553 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:42,554 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:42,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash 95323224, now seen corresponding path program 53 times [2018-10-15 15:00:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9752 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:46,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:46,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:00:46,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:00:46,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:00:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:00:46,108 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 109 states. [2018-10-15 15:00:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:52,299 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-15 15:00:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 15:00:52,299 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 386 [2018-10-15 15:00:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:52,301 INFO L225 Difference]: With dead ends: 398 [2018-10-15 15:00:52,301 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 15:00:52,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 15:00:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 15:00:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2018-10-15 15:00:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 15:00:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 394 transitions. [2018-10-15 15:00:52,307 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 394 transitions. Word has length 386 [2018-10-15 15:00:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:52,307 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 394 transitions. [2018-10-15 15:00:52,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:00:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 394 transitions. [2018-10-15 15:00:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-15 15:00:52,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:52,309 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:52,309 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:52,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1515152495, now seen corresponding path program 54 times [2018-10-15 15:00:52,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10125 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:55,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:55,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:00:55,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:00:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:00:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:00:55,966 INFO L87 Difference]: Start difference. First operand 394 states and 394 transitions. Second operand 111 states. [2018-10-15 15:01:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:02,471 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-10-15 15:01:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 15:01:02,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 393 [2018-10-15 15:01:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:02,473 INFO L225 Difference]: With dead ends: 405 [2018-10-15 15:01:02,473 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 15:01:02,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 15:01:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 15:01:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2018-10-15 15:01:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-15 15:01:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-10-15 15:01:02,478 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 393 [2018-10-15 15:01:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:02,478 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-10-15 15:01:02,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:01:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-10-15 15:01:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-15 15:01:02,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:02,480 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:02,480 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:02,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1147559368, now seen corresponding path program 55 times [2018-10-15 15:01:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10505 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:06,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:01:06,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:01:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:01:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:01:06,657 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 113 states. [2018-10-15 15:01:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:13,410 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-15 15:01:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 15:01:13,411 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 400 [2018-10-15 15:01:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:13,413 INFO L225 Difference]: With dead ends: 412 [2018-10-15 15:01:13,413 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 15:01:13,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:01:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 15:01:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 408. [2018-10-15 15:01:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-15 15:01:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-10-15 15:01:13,418 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 400 [2018-10-15 15:01:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:13,418 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-10-15 15:01:13,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:01:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-10-15 15:01:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-15 15:01:13,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:13,420 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:13,421 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:13,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash -394124879, now seen corresponding path program 56 times [2018-10-15 15:01:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10892 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:17,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:17,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:01:17,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:01:17,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:01:17,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:01:17,435 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 115 states. [2018-10-15 15:01:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:24,332 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-10-15 15:01:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 15:01:24,332 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 407 [2018-10-15 15:01:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:24,334 INFO L225 Difference]: With dead ends: 419 [2018-10-15 15:01:24,334 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 15:01:24,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 15:01:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 15:01:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2018-10-15 15:01:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-15 15:01:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-10-15 15:01:24,339 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 407 [2018-10-15 15:01:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:24,339 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-10-15 15:01:24,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:01:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-10-15 15:01:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-15 15:01:24,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:24,341 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:24,341 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:24,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1253378024, now seen corresponding path program 57 times [2018-10-15 15:01:24,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11286 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:01:28,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:01:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:01:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:01:28,404 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 117 states. [2018-10-15 15:01:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:35,340 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2018-10-15 15:01:35,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 15:01:35,341 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 414 [2018-10-15 15:01:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:35,343 INFO L225 Difference]: With dead ends: 426 [2018-10-15 15:01:35,343 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 15:01:35,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 15:01:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 15:01:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2018-10-15 15:01:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-15 15:01:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2018-10-15 15:01:35,348 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 414 [2018-10-15 15:01:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:35,348 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2018-10-15 15:01:35,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:01:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2018-10-15 15:01:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-15 15:01:35,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:35,350 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:35,350 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:35,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2124312529, now seen corresponding path program 58 times [2018-10-15 15:01:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11687 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:39,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:39,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:01:39,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:01:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:01:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:01:39,589 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 119 states. [2018-10-15 15:01:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:47,164 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-10-15 15:01:47,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 15:01:47,165 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 421 [2018-10-15 15:01:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:47,166 INFO L225 Difference]: With dead ends: 433 [2018-10-15 15:01:47,167 INFO L226 Difference]: Without dead ends: 433 [2018-10-15 15:01:47,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 15:01:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-15 15:01:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 429. [2018-10-15 15:01:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-15 15:01:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 429 transitions. [2018-10-15 15:01:47,171 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 429 transitions. Word has length 421 [2018-10-15 15:01:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:47,171 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 429 transitions. [2018-10-15 15:01:47,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:01:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 429 transitions. [2018-10-15 15:01:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-15 15:01:47,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:47,173 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:47,173 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:47,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -545225224, now seen corresponding path program 59 times [2018-10-15 15:01:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12095 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:51,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:51,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:01:51,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:01:51,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:01:51,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:01:51,288 INFO L87 Difference]: Start difference. First operand 429 states and 429 transitions. Second operand 121 states. [2018-10-15 15:01:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:59,186 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-10-15 15:01:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 15:01:59,186 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 428 [2018-10-15 15:01:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:59,188 INFO L225 Difference]: With dead ends: 440 [2018-10-15 15:01:59,188 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 15:01:59,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:01:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 15:01:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2018-10-15 15:01:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 15:01:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-10-15 15:01:59,194 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 428 [2018-10-15 15:01:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:59,194 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-10-15 15:01:59,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:01:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-10-15 15:01:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-15 15:01:59,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:59,196 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:59,197 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:59,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1233618417, now seen corresponding path program 60 times [2018-10-15 15:01:59,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12510 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:03,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:03,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:02:03,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:02:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:02:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:02:03,757 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 123 states. [2018-10-15 15:02:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:11,475 INFO L93 Difference]: Finished difference Result 447 states and 447 transitions. [2018-10-15 15:02:11,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 15:02:11,476 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 435 [2018-10-15 15:02:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:11,478 INFO L225 Difference]: With dead ends: 447 [2018-10-15 15:02:11,478 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 15:02:11,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 15:02:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 15:02:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2018-10-15 15:02:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 15:02:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 15:02:11,483 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 435 [2018-10-15 15:02:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:11,483 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 15:02:11,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:02:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 15:02:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 15:02:11,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:11,485 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:11,486 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:11,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 41438168, now seen corresponding path program 61 times [2018-10-15 15:02:11,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12932 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:16,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:16,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:02:16,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:02:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:02:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:02:16,013 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 125 states. [2018-10-15 15:02:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:24,226 INFO L93 Difference]: Finished difference Result 454 states and 454 transitions. [2018-10-15 15:02:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 15:02:24,227 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 442 [2018-10-15 15:02:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:24,229 INFO L225 Difference]: With dead ends: 454 [2018-10-15 15:02:24,229 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 15:02:24,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 15:02:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 15:02:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 450. [2018-10-15 15:02:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-15 15:02:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 450 transitions. [2018-10-15 15:02:24,235 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 450 transitions. Word has length 442 [2018-10-15 15:02:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:24,235 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 450 transitions. [2018-10-15 15:02:24,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:02:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 450 transitions. [2018-10-15 15:02:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 15:02:24,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:24,237 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:24,237 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:24,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1597989905, now seen corresponding path program 62 times [2018-10-15 15:02:24,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13361 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:29,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:02:29,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:02:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:02:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:02:29,008 INFO L87 Difference]: Start difference. First operand 450 states and 450 transitions. Second operand 127 states. [2018-10-15 15:02:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:37,191 INFO L93 Difference]: Finished difference Result 461 states and 461 transitions. [2018-10-15 15:02:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 15:02:37,191 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 449 [2018-10-15 15:02:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:37,194 INFO L225 Difference]: With dead ends: 461 [2018-10-15 15:02:37,194 INFO L226 Difference]: Without dead ends: 461 [2018-10-15 15:02:37,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:02:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-15 15:02:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 457. [2018-10-15 15:02:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-15 15:02:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 457 transitions. [2018-10-15 15:02:37,199 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 457 transitions. Word has length 449 [2018-10-15 15:02:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:37,200 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 457 transitions. [2018-10-15 15:02:37,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:02:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 457 transitions. [2018-10-15 15:02:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-15 15:02:37,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:37,202 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:37,202 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:37,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1578088008, now seen corresponding path program 63 times [2018-10-15 15:02:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13797 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:42,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:42,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:02:42,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:02:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:02:42,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:02:42,009 INFO L87 Difference]: Start difference. First operand 457 states and 457 transitions. Second operand 129 states. [2018-10-15 15:02:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:50,661 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-15 15:02:50,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 15:02:50,662 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 456 [2018-10-15 15:02:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:50,664 INFO L225 Difference]: With dead ends: 468 [2018-10-15 15:02:50,665 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 15:02:50,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 15:02:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 15:02:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2018-10-15 15:02:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 15:02:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 464 transitions. [2018-10-15 15:02:50,671 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 464 transitions. Word has length 456 [2018-10-15 15:02:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:50,671 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 464 transitions. [2018-10-15 15:02:50,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:02:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 464 transitions. [2018-10-15 15:02:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 15:02:50,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:50,673 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:50,674 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:50,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 709364273, now seen corresponding path program 64 times [2018-10-15 15:02:50,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14240 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:02:55,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:02:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:02:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:02:55,694 INFO L87 Difference]: Start difference. First operand 464 states and 464 transitions. Second operand 131 states. [2018-10-15 15:03:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:04,729 INFO L93 Difference]: Finished difference Result 475 states and 475 transitions. [2018-10-15 15:03:04,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 15:03:04,729 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 463 [2018-10-15 15:03:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:04,731 INFO L225 Difference]: With dead ends: 475 [2018-10-15 15:03:04,731 INFO L226 Difference]: Without dead ends: 475 [2018-10-15 15:03:04,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:03:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-15 15:03:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2018-10-15 15:03:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-15 15:03:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2018-10-15 15:03:04,736 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 463 [2018-10-15 15:03:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:04,736 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 471 transitions. [2018-10-15 15:03:04,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:03:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 471 transitions. [2018-10-15 15:03:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-10-15 15:03:04,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:04,738 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:04,738 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:04,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -584679528, now seen corresponding path program 65 times [2018-10-15 15:03:04,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14690 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:10,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:10,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:03:10,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:03:10,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:03:10,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:03:10,016 INFO L87 Difference]: Start difference. First operand 471 states and 471 transitions. Second operand 133 states. [2018-10-15 15:03:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:19,309 INFO L93 Difference]: Finished difference Result 482 states and 482 transitions. [2018-10-15 15:03:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 15:03:19,310 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 470 [2018-10-15 15:03:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:19,311 INFO L225 Difference]: With dead ends: 482 [2018-10-15 15:03:19,311 INFO L226 Difference]: Without dead ends: 482 [2018-10-15 15:03:19,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 15:03:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-15 15:03:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2018-10-15 15:03:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-15 15:03:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 478 transitions. [2018-10-15 15:03:19,316 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 478 transitions. Word has length 470 [2018-10-15 15:03:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:19,317 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 478 transitions. [2018-10-15 15:03:19,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:03:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 478 transitions. [2018-10-15 15:03:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-10-15 15:03:19,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:19,319 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:19,319 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:19,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1985775535, now seen corresponding path program 66 times [2018-10-15 15:03:19,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15147 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:24,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:24,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:03:24,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:03:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:03:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:03:24,619 INFO L87 Difference]: Start difference. First operand 478 states and 478 transitions. Second operand 135 states. [2018-10-15 15:03:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:33,927 INFO L93 Difference]: Finished difference Result 489 states and 489 transitions. [2018-10-15 15:03:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 15:03:33,928 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 477 [2018-10-15 15:03:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:33,929 INFO L225 Difference]: With dead ends: 489 [2018-10-15 15:03:33,929 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 15:03:33,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 15:03:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 15:03:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2018-10-15 15:03:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-15 15:03:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 485 transitions. [2018-10-15 15:03:33,934 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 485 transitions. Word has length 477 [2018-10-15 15:03:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:33,935 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 485 transitions. [2018-10-15 15:03:33,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:03:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 485 transitions. [2018-10-15 15:03:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-15 15:03:33,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:33,937 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:33,937 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:33,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1322839416, now seen corresponding path program 67 times [2018-10-15 15:03:33,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15611 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:39,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:39,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:03:39,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:03:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:03:39,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:03:39,333 INFO L87 Difference]: Start difference. First operand 485 states and 485 transitions. Second operand 137 states. [2018-10-15 15:03:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:48,703 INFO L93 Difference]: Finished difference Result 496 states and 496 transitions. [2018-10-15 15:03:48,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 15:03:48,703 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 484 [2018-10-15 15:03:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:48,705 INFO L225 Difference]: With dead ends: 496 [2018-10-15 15:03:48,705 INFO L226 Difference]: Without dead ends: 496 [2018-10-15 15:03:48,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 15:03:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-15 15:03:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 492. [2018-10-15 15:03:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-15 15:03:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 492 transitions. [2018-10-15 15:03:48,710 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 492 transitions. Word has length 484 [2018-10-15 15:03:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:48,710 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 492 transitions. [2018-10-15 15:03:48,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:03:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 492 transitions. [2018-10-15 15:03:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-15 15:03:48,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:48,712 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:48,712 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:48,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash -254562703, now seen corresponding path program 68 times [2018-10-15 15:03:48,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16082 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:54,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:54,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:03:54,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:03:54,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:03:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:03:54,208 INFO L87 Difference]: Start difference. First operand 492 states and 492 transitions. Second operand 139 states. [2018-10-15 15:04:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:04,316 INFO L93 Difference]: Finished difference Result 503 states and 503 transitions. [2018-10-15 15:04:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 15:04:04,316 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 491 [2018-10-15 15:04:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:04,318 INFO L225 Difference]: With dead ends: 503 [2018-10-15 15:04:04,318 INFO L226 Difference]: Without dead ends: 503 [2018-10-15 15:04:04,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:04:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-15 15:04:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2018-10-15 15:04:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-15 15:04:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 499 transitions. [2018-10-15 15:04:04,323 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 499 transitions. Word has length 491 [2018-10-15 15:04:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:04,323 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 499 transitions. [2018-10-15 15:04:04,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:04:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 499 transitions. [2018-10-15 15:04:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-10-15 15:04:04,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:04,326 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:04,326 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:04,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash -314207400, now seen corresponding path program 69 times [2018-10-15 15:04:04,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16560 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:10,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:10,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:04:10,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:04:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:04:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:04:10,075 INFO L87 Difference]: Start difference. First operand 499 states and 499 transitions. Second operand 141 states. [2018-10-15 15:04:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:20,101 INFO L93 Difference]: Finished difference Result 510 states and 510 transitions. [2018-10-15 15:04:20,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 15:04:20,102 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 498 [2018-10-15 15:04:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:20,104 INFO L225 Difference]: With dead ends: 510 [2018-10-15 15:04:20,104 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 15:04:20,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 15:04:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 15:04:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 506. [2018-10-15 15:04:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-15 15:04:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2018-10-15 15:04:20,110 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 498 [2018-10-15 15:04:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:20,110 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2018-10-15 15:04:20,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:04:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2018-10-15 15:04:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-15 15:04:20,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:20,112 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:20,112 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:20,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2015712111, now seen corresponding path program 70 times [2018-10-15 15:04:20,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17045 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:26,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:26,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 15:04:26,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 15:04:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 15:04:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:04:26,335 INFO L87 Difference]: Start difference. First operand 506 states and 506 transitions. Second operand 143 states. [2018-10-15 15:04:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:36,895 INFO L93 Difference]: Finished difference Result 517 states and 517 transitions. [2018-10-15 15:04:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 15:04:36,895 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 505 [2018-10-15 15:04:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:36,897 INFO L225 Difference]: With dead ends: 517 [2018-10-15 15:04:36,897 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 15:04:36,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 15:04:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 15:04:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 513. [2018-10-15 15:04:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-15 15:04:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2018-10-15 15:04:36,902 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 505 [2018-10-15 15:04:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:36,902 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 513 transitions. [2018-10-15 15:04:36,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 15:04:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 513 transitions. [2018-10-15 15:04:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-15 15:04:36,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:36,904 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:36,905 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:36,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -366317256, now seen corresponding path program 71 times [2018-10-15 15:04:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17537 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:43,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:43,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:04:43,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:04:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:04:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:04:43,061 INFO L87 Difference]: Start difference. First operand 513 states and 513 transitions. Second operand 145 states. [2018-10-15 15:04:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:54,090 INFO L93 Difference]: Finished difference Result 524 states and 524 transitions. [2018-10-15 15:04:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 15:04:54,090 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 512 [2018-10-15 15:04:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:54,092 INFO L225 Difference]: With dead ends: 524 [2018-10-15 15:04:54,092 INFO L226 Difference]: Without dead ends: 524 [2018-10-15 15:04:54,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 15:04:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-15 15:04:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2018-10-15 15:04:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 15:04:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 520 transitions. [2018-10-15 15:04:54,098 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 520 transitions. Word has length 512 [2018-10-15 15:04:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:54,098 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 520 transitions. [2018-10-15 15:04:54,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:04:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 520 transitions. [2018-10-15 15:04:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 15:04:54,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:54,100 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:54,100 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:54,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:54,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1262121649, now seen corresponding path program 72 times [2018-10-15 15:04:54,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18036 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:00,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:00,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 15:05:00,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 15:05:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 15:05:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:05:00,331 INFO L87 Difference]: Start difference. First operand 520 states and 520 transitions. Second operand 147 states. [2018-10-15 15:05:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:11,333 INFO L93 Difference]: Finished difference Result 531 states and 531 transitions. [2018-10-15 15:05:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 15:05:11,333 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 519 [2018-10-15 15:05:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:11,336 INFO L225 Difference]: With dead ends: 531 [2018-10-15 15:05:11,336 INFO L226 Difference]: Without dead ends: 531 [2018-10-15 15:05:11,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 15:05:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-15 15:05:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-10-15 15:05:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-15 15:05:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 527 transitions. [2018-10-15 15:05:11,342 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 527 transitions. Word has length 519 [2018-10-15 15:05:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:11,342 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 527 transitions. [2018-10-15 15:05:11,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 15:05:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 527 transitions. [2018-10-15 15:05:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-10-15 15:05:11,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:11,370 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:11,370 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:11,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1832548584, now seen corresponding path program 73 times [2018-10-15 15:05:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18542 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:18,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:18,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 15:05:18,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 15:05:18,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 15:05:18,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:05:18,029 INFO L87 Difference]: Start difference. First operand 527 states and 527 transitions. Second operand 149 states. [2018-10-15 15:05:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:29,188 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2018-10-15 15:05:29,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-10-15 15:05:29,188 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 526 [2018-10-15 15:05:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:29,191 INFO L225 Difference]: With dead ends: 538 [2018-10-15 15:05:29,191 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 15:05:29,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 15:05:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 15:05:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 534. [2018-10-15 15:05:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-10-15 15:05:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 534 transitions. [2018-10-15 15:05:29,197 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 534 transitions. Word has length 526 [2018-10-15 15:05:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:29,197 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 534 transitions. [2018-10-15 15:05:29,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 15:05:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 534 transitions. [2018-10-15 15:05:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-10-15 15:05:29,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:29,199 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:29,199 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:29,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 737476817, now seen corresponding path program 74 times [2018-10-15 15:05:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19055 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:35,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:35,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 15:05:35,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 15:05:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 15:05:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:05:35,741 INFO L87 Difference]: Start difference. First operand 534 states and 534 transitions. Second operand 151 states.