java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,089 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,091 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,103 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,103 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,104 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,106 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,108 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,110 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,110 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,112 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,112 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,113 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,114 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,115 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,116 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,117 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,119 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,122 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,123 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,125 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,126 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,129 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,129 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,129 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,130 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,131 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,132 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,132 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,133 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,134 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,135 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,137 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,137 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,138 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,138 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,138 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,139 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,140 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:21:57,180 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,191 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,194 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,195 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,196 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,196 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-05-23 09:21:57,197 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-05-23 09:21:57,232 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,234 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,235 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,235 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,235 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,252 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,263 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,271 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,272 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,272 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,273 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,284 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,284 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,285 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,285 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,289 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,291 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,292 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,293 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,294 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,294 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,294 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,295 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (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:4096 -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:4096 -smt2 -in -t:12000 [2019-05-23 09:21:57,385 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:21:57,385 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:21:57,791 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:21:57,792 INFO L146 ILogger]: Removed 2 assume(true) statements. [2019-05-23 09:21:57,793 INFO L146 ILogger]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57 BoogieIcfgContainer [2019-05-23 09:21:57,793 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:57,795 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:57,795 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:57,798 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:57,799 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:57,800 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6480869c and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:21:57, skipping insertion in model container [2019-05-23 09:21:57,800 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57" (2/2) ... [2019-05-23 09:21:57,802 INFO L146 ILogger]: Analyzing ICFG array4.i_4.bpl [2019-05-23 09:21:57,812 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:57,819 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:57,836 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:57,863 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:57,863 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:57,864 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:57,864 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:57,864 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:57,864 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:57,864 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:57,864 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:57,865 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:57,880 INFO L146 ILogger]: Start isEmpty. Operand 27 states. [2019-05-23 09:21:57,888 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 16 [2019-05-23 09:21:57,888 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:57,889 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:57,892 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:57,898 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:57,898 INFO L146 ILogger]: Analyzing trace with hash 80050392, now seen corresponding path program 1 times [2019-05-23 09:21:57,953 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:57,992 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:57,995 INFO L146 ILogger]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,000 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,054 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,057 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,057 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:21:58,062 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:21:58,076 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:21:58,077 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,080 INFO L146 ILogger]: Start difference. First operand 27 states. Second operand 3 states. [2019-05-23 09:21:58,216 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,216 INFO L146 ILogger]: Finished difference Result 41 states and 42 transitions. [2019-05-23 09:21:58,217 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:21:58,218 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 15 [2019-05-23 09:21:58,219 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,229 INFO L146 ILogger]: With dead ends: 41 [2019-05-23 09:21:58,229 INFO L146 ILogger]: Without dead ends: 41 [2019-05-23 09:21:58,232 INFO L146 ILogger]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,248 INFO L146 ILogger]: Start minimizeSevpa. Operand 41 states. [2019-05-23 09:21:58,261 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-05-23 09:21:58,262 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 09:21:58,263 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-05-23 09:21:58,264 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 15 [2019-05-23 09:21:58,265 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,265 INFO L146 ILogger]: Abstraction has 26 states and 27 transitions. [2019-05-23 09:21:58,265 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:21:58,265 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 27 transitions. [2019-05-23 09:21:58,266 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 09:21:58,267 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,267 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,267 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,268 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,268 INFO L146 ILogger]: Analyzing trace with hash -646348282, now seen corresponding path program 1 times [2019-05-23 09:21:58,269 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,287 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,289 INFO L146 ILogger]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,292 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,369 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,370 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,370 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:21:58,372 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:21:58,372 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:21:58,373 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:21:58,373 INFO L146 ILogger]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2019-05-23 09:21:58,626 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,627 INFO L146 ILogger]: Finished difference Result 48 states and 49 transitions. [2019-05-23 09:21:58,627 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:21:58,628 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 22 [2019-05-23 09:21:58,628 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,629 INFO L146 ILogger]: With dead ends: 48 [2019-05-23 09:21:58,629 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 09:21:58,642 INFO L146 ILogger]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,645 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 09:21:58,648 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-05-23 09:21:58,649 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 09:21:58,650 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-05-23 09:21:58,650 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 22 [2019-05-23 09:21:58,650 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,650 INFO L146 ILogger]: Abstraction has 33 states and 34 transitions. [2019-05-23 09:21:58,651 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:21:58,651 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 34 transitions. [2019-05-23 09:21:58,652 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 30 [2019-05-23 09:21:58,652 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,652 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,653 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,653 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,653 INFO L146 ILogger]: Analyzing trace with hash -1487967976, now seen corresponding path program 2 times [2019-05-23 09:21:58,654 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,672 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,674 INFO L146 ILogger]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,676 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,850 INFO L146 ILogger]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,851 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,851 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:58,851 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:58,852 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:58,852 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,852 INFO L146 ILogger]: Start difference. First operand 33 states and 34 transitions. Second operand 7 states. [2019-05-23 09:21:59,160 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,160 INFO L146 ILogger]: Finished difference Result 55 states and 56 transitions. [2019-05-23 09:21:59,160 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:21:59,160 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 29 [2019-05-23 09:21:59,161 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,162 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 09:21:59,162 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:21:59,163 INFO L146 ILogger]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:59,163 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:21:59,168 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 40. [2019-05-23 09:21:59,168 INFO L146 ILogger]: Start removeUnreachable. Operand 40 states. [2019-05-23 09:21:59,169 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-05-23 09:21:59,170 INFO L146 ILogger]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 29 [2019-05-23 09:21:59,170 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,170 INFO L146 ILogger]: Abstraction has 40 states and 41 transitions. [2019-05-23 09:21:59,170 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:59,171 INFO L146 ILogger]: Start isEmpty. Operand 40 states and 41 transitions. [2019-05-23 09:21:59,171 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 37 [2019-05-23 09:21:59,172 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,172 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,172 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,173 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,173 INFO L146 ILogger]: Analyzing trace with hash 221039046, now seen corresponding path program 3 times [2019-05-23 09:21:59,174 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,193 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,195 INFO L146 ILogger]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,197 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,313 INFO L146 ILogger]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:59,314 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,314 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:21:59,314 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:21:59,315 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:21:59,315 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:21:59,316 INFO L146 ILogger]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2019-05-23 09:21:59,829 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,829 INFO L146 ILogger]: Finished difference Result 62 states and 63 transitions. [2019-05-23 09:21:59,830 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:21:59,830 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 36 [2019-05-23 09:21:59,831 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,832 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 09:21:59,832 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 09:21:59,833 INFO L146 ILogger]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:21:59,834 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 09:21:59,838 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 47. [2019-05-23 09:21:59,838 INFO L146 ILogger]: Start removeUnreachable. Operand 47 states. [2019-05-23 09:21:59,839 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-05-23 09:21:59,839 INFO L146 ILogger]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2019-05-23 09:21:59,839 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,840 INFO L146 ILogger]: Abstraction has 47 states and 48 transitions. [2019-05-23 09:21:59,840 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:21:59,840 INFO L146 ILogger]: Start isEmpty. Operand 47 states and 48 transitions. [2019-05-23 09:21:59,841 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 44 [2019-05-23 09:21:59,841 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,841 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,842 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,842 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,842 INFO L146 ILogger]: Analyzing trace with hash -795874984, now seen corresponding path program 4 times [2019-05-23 09:21:59,843 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,863 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,866 INFO L146 ILogger]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,868 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,025 INFO L146 ILogger]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,025 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,025 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:00,026 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:00,026 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:00,027 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:00,027 INFO L146 ILogger]: Start difference. First operand 47 states and 48 transitions. Second operand 11 states. [2019-05-23 09:22:00,337 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,337 INFO L146 ILogger]: Finished difference Result 69 states and 70 transitions. [2019-05-23 09:22:00,341 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:00,341 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 43 [2019-05-23 09:22:00,342 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,343 INFO L146 ILogger]: With dead ends: 69 [2019-05-23 09:22:00,343 INFO L146 ILogger]: Without dead ends: 69 [2019-05-23 09:22:00,343 INFO L146 ILogger]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:00,344 INFO L146 ILogger]: Start minimizeSevpa. Operand 69 states. [2019-05-23 09:22:00,349 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-05-23 09:22:00,349 INFO L146 ILogger]: Start removeUnreachable. Operand 54 states. [2019-05-23 09:22:00,350 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-05-23 09:22:00,351 INFO L146 ILogger]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 43 [2019-05-23 09:22:00,351 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,352 INFO L146 ILogger]: Abstraction has 54 states and 55 transitions. [2019-05-23 09:22:00,352 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:00,353 INFO L146 ILogger]: Start isEmpty. Operand 54 states and 55 transitions. [2019-05-23 09:22:00,359 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 09:22:00,359 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,361 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,362 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,362 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,363 INFO L146 ILogger]: Analyzing trace with hash -1968733818, now seen corresponding path program 5 times [2019-05-23 09:22:00,364 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,392 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,395 INFO L146 ILogger]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,397 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,681 INFO L146 ILogger]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,682 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,682 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:00,682 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:00,682 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:00,683 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:00,683 INFO L146 ILogger]: Start difference. First operand 54 states and 55 transitions. Second operand 13 states. [2019-05-23 09:22:01,607 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,608 INFO L146 ILogger]: Finished difference Result 76 states and 77 transitions. [2019-05-23 09:22:01,608 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:01,608 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 50 [2019-05-23 09:22:01,609 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,610 INFO L146 ILogger]: With dead ends: 76 [2019-05-23 09:22:01,610 INFO L146 ILogger]: Without dead ends: 76 [2019-05-23 09:22:01,611 INFO L146 ILogger]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:01,612 INFO L146 ILogger]: Start minimizeSevpa. Operand 76 states. [2019-05-23 09:22:01,616 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 76 to 61. [2019-05-23 09:22:01,616 INFO L146 ILogger]: Start removeUnreachable. Operand 61 states. [2019-05-23 09:22:01,617 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-05-23 09:22:01,617 INFO L146 ILogger]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 50 [2019-05-23 09:22:01,618 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,618 INFO L146 ILogger]: Abstraction has 61 states and 62 transitions. [2019-05-23 09:22:01,618 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:01,618 INFO L146 ILogger]: Start isEmpty. Operand 61 states and 62 transitions. [2019-05-23 09:22:01,619 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:22:01,619 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,619 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:01,620 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,620 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,620 INFO L146 ILogger]: Analyzing trace with hash -171247208, now seen corresponding path program 6 times [2019-05-23 09:22:01,621 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,644 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,647 INFO L146 ILogger]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,649 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,843 INFO L146 ILogger]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,845 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,845 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:01,846 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:01,846 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:01,846 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:01,846 INFO L146 ILogger]: Start difference. First operand 61 states and 62 transitions. Second operand 15 states. [2019-05-23 09:22:02,152 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,152 INFO L146 ILogger]: Finished difference Result 83 states and 84 transitions. [2019-05-23 09:22:02,153 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:02,153 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 57 [2019-05-23 09:22:02,153 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,155 INFO L146 ILogger]: With dead ends: 83 [2019-05-23 09:22:02,155 INFO L146 ILogger]: Without dead ends: 83 [2019-05-23 09:22:02,156 INFO L146 ILogger]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:02,157 INFO L146 ILogger]: Start minimizeSevpa. Operand 83 states. [2019-05-23 09:22:02,161 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 83 to 68. [2019-05-23 09:22:02,161 INFO L146 ILogger]: Start removeUnreachable. Operand 68 states. [2019-05-23 09:22:02,162 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-05-23 09:22:02,162 INFO L146 ILogger]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 57 [2019-05-23 09:22:02,162 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,163 INFO L146 ILogger]: Abstraction has 68 states and 69 transitions. [2019-05-23 09:22:02,163 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:02,163 INFO L146 ILogger]: Start isEmpty. Operand 68 states and 69 transitions. [2019-05-23 09:22:02,164 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 65 [2019-05-23 09:22:02,164 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,164 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,165 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,165 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,165 INFO L146 ILogger]: Analyzing trace with hash 673556806, now seen corresponding path program 7 times [2019-05-23 09:22:02,166 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,190 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,193 INFO L146 ILogger]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,196 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,457 INFO L146 ILogger]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:02,458 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,458 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:02,458 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:02,458 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:02,460 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:02,460 INFO L146 ILogger]: Start difference. First operand 68 states and 69 transitions. Second operand 17 states. [2019-05-23 09:22:02,747 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,748 INFO L146 ILogger]: Finished difference Result 90 states and 91 transitions. [2019-05-23 09:22:02,757 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:02,757 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 64 [2019-05-23 09:22:02,757 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,758 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:22:02,758 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:22:02,759 INFO L146 ILogger]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:02,760 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:22:02,764 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-05-23 09:22:02,764 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 09:22:02,765 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-05-23 09:22:02,765 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 64 [2019-05-23 09:22:02,765 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,766 INFO L146 ILogger]: Abstraction has 75 states and 76 transitions. [2019-05-23 09:22:02,766 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:02,766 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 76 transitions. [2019-05-23 09:22:02,767 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 72 [2019-05-23 09:22:02,767 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,767 INFO L146 ILogger]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,768 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,768 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,768 INFO L146 ILogger]: Analyzing trace with hash 88381912, now seen corresponding path program 8 times [2019-05-23 09:22:02,769 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,806 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,815 INFO L146 ILogger]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,823 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:03,011 INFO L146 ILogger]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:03,011 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,012 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:03,012 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:03,013 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:03,013 INFO L146 ILogger]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:03,013 INFO L146 ILogger]: Start difference. First operand 75 states and 76 transitions. Second operand 19 states. [2019-05-23 09:22:03,924 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:03,925 INFO L146 ILogger]: Finished difference Result 97 states and 98 transitions. [2019-05-23 09:22:03,933 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:03,933 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 71 [2019-05-23 09:22:03,933 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:03,934 INFO L146 ILogger]: With dead ends: 97 [2019-05-23 09:22:03,934 INFO L146 ILogger]: Without dead ends: 97 [2019-05-23 09:22:03,935 INFO L146 ILogger]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:03,936 INFO L146 ILogger]: Start minimizeSevpa. Operand 97 states. [2019-05-23 09:22:03,940 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 97 to 82. [2019-05-23 09:22:03,940 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 09:22:03,942 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-05-23 09:22:03,942 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 71 [2019-05-23 09:22:03,942 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:03,942 INFO L146 ILogger]: Abstraction has 82 states and 83 transitions. [2019-05-23 09:22:03,943 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:03,943 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 83 transitions. [2019-05-23 09:22:03,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 09:22:03,944 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:03,944 INFO L146 ILogger]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:03,944 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:03,945 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:03,945 INFO L146 ILogger]: Analyzing trace with hash 585318662, now seen corresponding path program 9 times [2019-05-23 09:22:03,946 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:03,968 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:03,971 INFO L146 ILogger]: Trace formula consists of 113 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:22:03,974 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,185 INFO L146 ILogger]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:04,186 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,186 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:04,186 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:04,187 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:04,187 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:04,187 INFO L146 ILogger]: Start difference. First operand 82 states and 83 transitions. Second operand 21 states. [2019-05-23 09:22:04,544 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,544 INFO L146 ILogger]: Finished difference Result 104 states and 105 transitions. [2019-05-23 09:22:04,545 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:04,545 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 78 [2019-05-23 09:22:04,545 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,546 INFO L146 ILogger]: With dead ends: 104 [2019-05-23 09:22:04,546 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 09:22:04,547 INFO L146 ILogger]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:04,547 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 09:22:04,551 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 89. [2019-05-23 09:22:04,552 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 09:22:04,553 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-05-23 09:22:04,553 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 78 [2019-05-23 09:22:04,553 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:04,553 INFO L146 ILogger]: Abstraction has 89 states and 90 transitions. [2019-05-23 09:22:04,553 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:04,554 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 90 transitions. [2019-05-23 09:22:04,555 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:22:04,555 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,555 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:04,555 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,555 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,556 INFO L146 ILogger]: Analyzing trace with hash -1505703400, now seen corresponding path program 10 times [2019-05-23 09:22:04,557 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,579 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,583 INFO L146 ILogger]: Trace formula consists of 123 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,586 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,942 INFO L146 ILogger]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:04,942 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,942 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:04,943 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:04,943 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:04,944 INFO L146 ILogger]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:04,944 INFO L146 ILogger]: Start difference. First operand 89 states and 90 transitions. Second operand 23 states. [2019-05-23 09:22:05,312 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,312 INFO L146 ILogger]: Finished difference Result 111 states and 112 transitions. [2019-05-23 09:22:05,313 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:05,313 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 85 [2019-05-23 09:22:05,313 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,314 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:22:05,315 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:22:05,316 INFO L146 ILogger]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:05,316 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:22:05,320 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-05-23 09:22:05,320 INFO L146 ILogger]: Start removeUnreachable. Operand 96 states. [2019-05-23 09:22:05,321 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-05-23 09:22:05,321 INFO L146 ILogger]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 85 [2019-05-23 09:22:05,322 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,322 INFO L146 ILogger]: Abstraction has 96 states and 97 transitions. [2019-05-23 09:22:05,322 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:05,322 INFO L146 ILogger]: Start isEmpty. Operand 96 states and 97 transitions. [2019-05-23 09:22:05,323 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 09:22:05,323 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,323 INFO L146 ILogger]: trace histogram [11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:05,324 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,324 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,324 INFO L146 ILogger]: Analyzing trace with hash -551794490, now seen corresponding path program 11 times [2019-05-23 09:22:05,325 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,352 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,358 INFO L146 ILogger]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,364 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,910 INFO L146 ILogger]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:05,910 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:05,911 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:05,911 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:05,911 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:05,912 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:05,912 INFO L146 ILogger]: Start difference. First operand 96 states and 97 transitions. Second operand 25 states. [2019-05-23 09:22:06,553 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,554 INFO L146 ILogger]: Finished difference Result 118 states and 119 transitions. [2019-05-23 09:22:06,554 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:06,554 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 92 [2019-05-23 09:22:06,555 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,555 INFO L146 ILogger]: With dead ends: 118 [2019-05-23 09:22:06,555 INFO L146 ILogger]: Without dead ends: 118 [2019-05-23 09:22:06,556 INFO L146 ILogger]: 0 DeclaredPredicates, 113 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:06,557 INFO L146 ILogger]: Start minimizeSevpa. Operand 118 states. [2019-05-23 09:22:06,562 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 118 to 103. [2019-05-23 09:22:06,562 INFO L146 ILogger]: Start removeUnreachable. Operand 103 states. [2019-05-23 09:22:06,563 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-05-23 09:22:06,563 INFO L146 ILogger]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 92 [2019-05-23 09:22:06,563 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,564 INFO L146 ILogger]: Abstraction has 103 states and 104 transitions. [2019-05-23 09:22:06,564 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:06,564 INFO L146 ILogger]: Start isEmpty. Operand 103 states and 104 transitions. [2019-05-23 09:22:06,565 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 100 [2019-05-23 09:22:06,565 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,566 INFO L146 ILogger]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:06,566 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,566 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,566 INFO L146 ILogger]: Analyzing trace with hash 2030275160, now seen corresponding path program 12 times [2019-05-23 09:22:06,567 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,590 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,592 INFO L146 ILogger]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,596 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,892 INFO L146 ILogger]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,892 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,892 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:06,893 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:06,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:06,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:06,894 INFO L146 ILogger]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2019-05-23 09:22:07,399 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,400 INFO L146 ILogger]: Finished difference Result 125 states and 126 transitions. [2019-05-23 09:22:07,400 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:07,400 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 99 [2019-05-23 09:22:07,400 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,401 INFO L146 ILogger]: With dead ends: 125 [2019-05-23 09:22:07,401 INFO L146 ILogger]: Without dead ends: 125 [2019-05-23 09:22:07,402 INFO L146 ILogger]: 0 DeclaredPredicates, 122 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:07,403 INFO L146 ILogger]: Start minimizeSevpa. Operand 125 states. [2019-05-23 09:22:07,405 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 125 to 110. [2019-05-23 09:22:07,405 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 09:22:07,406 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-05-23 09:22:07,406 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 99 [2019-05-23 09:22:07,406 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,407 INFO L146 ILogger]: Abstraction has 110 states and 111 transitions. [2019-05-23 09:22:07,407 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:07,407 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 111 transitions. [2019-05-23 09:22:07,408 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 09:22:07,408 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,408 INFO L146 ILogger]: trace histogram [13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:07,409 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,409 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,409 INFO L146 ILogger]: Analyzing trace with hash -1475559290, now seen corresponding path program 13 times [2019-05-23 09:22:07,410 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,438 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,447 INFO L146 ILogger]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,452 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,108 INFO L146 ILogger]: Checked inductivity of 559 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,109 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,109 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:08,109 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:08,109 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:08,110 INFO L146 ILogger]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:08,110 INFO L146 ILogger]: Start difference. First operand 110 states and 111 transitions. Second operand 29 states. [2019-05-23 09:22:09,195 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,196 INFO L146 ILogger]: Finished difference Result 132 states and 133 transitions. [2019-05-23 09:22:09,196 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:09,196 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 106 [2019-05-23 09:22:09,197 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,198 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 09:22:09,198 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 09:22:09,200 INFO L146 ILogger]: 0 DeclaredPredicates, 131 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:09,201 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 09:22:09,203 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 117. [2019-05-23 09:22:09,203 INFO L146 ILogger]: Start removeUnreachable. Operand 117 states. [2019-05-23 09:22:09,204 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-05-23 09:22:09,204 INFO L146 ILogger]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2019-05-23 09:22:09,204 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,204 INFO L146 ILogger]: Abstraction has 117 states and 118 transitions. [2019-05-23 09:22:09,204 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:09,204 INFO L146 ILogger]: Start isEmpty. Operand 117 states and 118 transitions. [2019-05-23 09:22:09,205 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 114 [2019-05-23 09:22:09,205 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,206 INFO L146 ILogger]: trace histogram [14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:09,206 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,206 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,206 INFO L146 ILogger]: Analyzing trace with hash 1456528024, now seen corresponding path program 14 times [2019-05-23 09:22:09,207 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,247 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,249 INFO L146 ILogger]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,253 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,613 INFO L146 ILogger]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,613 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,613 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:09,614 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:09,614 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:09,615 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:09,615 INFO L146 ILogger]: Start difference. First operand 117 states and 118 transitions. Second operand 31 states. [2019-05-23 09:22:10,234 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,234 INFO L146 ILogger]: Finished difference Result 139 states and 140 transitions. [2019-05-23 09:22:10,234 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:22:10,235 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 113 [2019-05-23 09:22:10,235 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,236 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 09:22:10,236 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:22:10,237 INFO L146 ILogger]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:10,238 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:22:10,240 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 124. [2019-05-23 09:22:10,240 INFO L146 ILogger]: Start removeUnreachable. Operand 124 states. [2019-05-23 09:22:10,241 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-05-23 09:22:10,241 INFO L146 ILogger]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 113 [2019-05-23 09:22:10,242 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,242 INFO L146 ILogger]: Abstraction has 124 states and 125 transitions. [2019-05-23 09:22:10,242 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:10,242 INFO L146 ILogger]: Start isEmpty. Operand 124 states and 125 transitions. [2019-05-23 09:22:10,243 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 121 [2019-05-23 09:22:10,243 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,243 INFO L146 ILogger]: trace histogram [15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:10,243 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,244 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,244 INFO L146 ILogger]: Analyzing trace with hash 1878042694, now seen corresponding path program 15 times [2019-05-23 09:22:10,245 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,262 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,264 INFO L146 ILogger]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,267 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,006 INFO L146 ILogger]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,007 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,007 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:11,007 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:11,008 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:11,008 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:11,008 INFO L146 ILogger]: Start difference. First operand 124 states and 125 transitions. Second operand 33 states. [2019-05-23 09:22:11,703 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,703 INFO L146 ILogger]: Finished difference Result 146 states and 147 transitions. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:22:11,704 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 120 [2019-05-23 09:22:11,705 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,705 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:22:11,706 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:22:11,707 INFO L146 ILogger]: 0 DeclaredPredicates, 149 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:11,708 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:22:11,709 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 131. [2019-05-23 09:22:11,710 INFO L146 ILogger]: Start removeUnreachable. Operand 131 states. [2019-05-23 09:22:11,710 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-05-23 09:22:11,710 INFO L146 ILogger]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 120 [2019-05-23 09:22:11,711 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,711 INFO L146 ILogger]: Abstraction has 131 states and 132 transitions. [2019-05-23 09:22:11,711 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:11,711 INFO L146 ILogger]: Start isEmpty. Operand 131 states and 132 transitions. [2019-05-23 09:22:11,712 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 128 [2019-05-23 09:22:11,712 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,712 INFO L146 ILogger]: trace histogram [16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:11,713 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,713 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,713 INFO L146 ILogger]: Analyzing trace with hash -1846756648, now seen corresponding path program 16 times [2019-05-23 09:22:11,714 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,731 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,733 INFO L146 ILogger]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,735 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,244 INFO L146 ILogger]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,245 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,245 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:12,245 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:12,246 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:12,246 INFO L146 ILogger]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:12,246 INFO L146 ILogger]: Start difference. First operand 131 states and 132 transitions. Second operand 35 states. [2019-05-23 09:22:13,080 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,081 INFO L146 ILogger]: Finished difference Result 153 states and 154 transitions. [2019-05-23 09:22:13,081 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:22:13,081 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 127 [2019-05-23 09:22:13,082 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,083 INFO L146 ILogger]: With dead ends: 153 [2019-05-23 09:22:13,083 INFO L146 ILogger]: Without dead ends: 153 [2019-05-23 09:22:13,085 INFO L146 ILogger]: 0 DeclaredPredicates, 158 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:13,085 INFO L146 ILogger]: Start minimizeSevpa. Operand 153 states. [2019-05-23 09:22:13,087 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 153 to 138. [2019-05-23 09:22:13,087 INFO L146 ILogger]: Start removeUnreachable. Operand 138 states. [2019-05-23 09:22:13,088 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-05-23 09:22:13,088 INFO L146 ILogger]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 127 [2019-05-23 09:22:13,088 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,088 INFO L146 ILogger]: Abstraction has 138 states and 139 transitions. [2019-05-23 09:22:13,088 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:13,088 INFO L146 ILogger]: Start isEmpty. Operand 138 states and 139 transitions. [2019-05-23 09:22:13,089 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 135 [2019-05-23 09:22:13,089 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,089 INFO L146 ILogger]: trace histogram [17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:13,089 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,090 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,090 INFO L146 ILogger]: Analyzing trace with hash -1878786042, now seen corresponding path program 17 times [2019-05-23 09:22:13,090 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,108 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,110 INFO L146 ILogger]: Trace formula consists of 193 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,112 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,579 INFO L146 ILogger]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,579 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,579 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:13,580 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:13,580 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:13,581 INFO L146 ILogger]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:13,581 INFO L146 ILogger]: Start difference. First operand 138 states and 139 transitions. Second operand 37 states. [2019-05-23 09:22:14,447 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,447 INFO L146 ILogger]: Finished difference Result 160 states and 161 transitions. [2019-05-23 09:22:14,448 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:22:14,448 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 134 [2019-05-23 09:22:14,448 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,449 INFO L146 ILogger]: With dead ends: 160 [2019-05-23 09:22:14,449 INFO L146 ILogger]: Without dead ends: 160 [2019-05-23 09:22:14,450 INFO L146 ILogger]: 0 DeclaredPredicates, 167 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:22:14,451 INFO L146 ILogger]: Start minimizeSevpa. Operand 160 states. [2019-05-23 09:22:14,452 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 160 to 145. [2019-05-23 09:22:14,453 INFO L146 ILogger]: Start removeUnreachable. Operand 145 states. [2019-05-23 09:22:14,453 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-05-23 09:22:14,453 INFO L146 ILogger]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 134 [2019-05-23 09:22:14,454 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,454 INFO L146 ILogger]: Abstraction has 145 states and 146 transitions. [2019-05-23 09:22:14,454 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:14,454 INFO L146 ILogger]: Start isEmpty. Operand 145 states and 146 transitions. [2019-05-23 09:22:14,455 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 09:22:14,455 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,455 INFO L146 ILogger]: trace histogram [18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:14,455 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,456 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,456 INFO L146 ILogger]: Analyzing trace with hash 899361560, now seen corresponding path program 18 times [2019-05-23 09:22:14,457 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,475 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,477 INFO L146 ILogger]: Trace formula consists of 203 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,479 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,947 INFO L146 ILogger]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,947 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,947 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:14,948 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:14,948 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:14,949 INFO L146 ILogger]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:14,949 INFO L146 ILogger]: Start difference. First operand 145 states and 146 transitions. Second operand 39 states. [2019-05-23 09:22:16,070 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,070 INFO L146 ILogger]: Finished difference Result 167 states and 168 transitions. [2019-05-23 09:22:16,071 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:22:16,071 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 141 [2019-05-23 09:22:16,071 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,072 INFO L146 ILogger]: With dead ends: 167 [2019-05-23 09:22:16,072 INFO L146 ILogger]: Without dead ends: 167 [2019-05-23 09:22:16,074 INFO L146 ILogger]: 0 DeclaredPredicates, 176 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:22:16,074 INFO L146 ILogger]: Start minimizeSevpa. Operand 167 states. [2019-05-23 09:22:16,076 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 167 to 152. [2019-05-23 09:22:16,076 INFO L146 ILogger]: Start removeUnreachable. Operand 152 states. [2019-05-23 09:22:16,077 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-05-23 09:22:16,077 INFO L146 ILogger]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 141 [2019-05-23 09:22:16,077 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,077 INFO L146 ILogger]: Abstraction has 152 states and 153 transitions. [2019-05-23 09:22:16,078 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:16,078 INFO L146 ILogger]: Start isEmpty. Operand 152 states and 153 transitions. [2019-05-23 09:22:16,078 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 149 [2019-05-23 09:22:16,078 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,079 INFO L146 ILogger]: trace histogram [19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:16,079 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,079 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,079 INFO L146 ILogger]: Analyzing trace with hash -2004695098, now seen corresponding path program 19 times [2019-05-23 09:22:16,080 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,097 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,099 INFO L146 ILogger]: Trace formula consists of 213 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,102 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,669 INFO L146 ILogger]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,670 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,670 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:16,670 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:16,671 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:16,671 INFO L146 ILogger]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:16,672 INFO L146 ILogger]: Start difference. First operand 152 states and 153 transitions. Second operand 41 states. [2019-05-23 09:22:18,033 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,033 INFO L146 ILogger]: Finished difference Result 174 states and 175 transitions. [2019-05-23 09:22:18,034 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:22:18,034 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 148 [2019-05-23 09:22:18,035 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,036 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 09:22:18,036 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 09:22:18,038 INFO L146 ILogger]: 0 DeclaredPredicates, 185 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:22:18,039 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 09:22:18,041 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 159. [2019-05-23 09:22:18,041 INFO L146 ILogger]: Start removeUnreachable. Operand 159 states. [2019-05-23 09:22:18,042 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-05-23 09:22:18,042 INFO L146 ILogger]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 148 [2019-05-23 09:22:18,042 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,042 INFO L146 ILogger]: Abstraction has 159 states and 160 transitions. [2019-05-23 09:22:18,042 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:18,042 INFO L146 ILogger]: Start isEmpty. Operand 159 states and 160 transitions. [2019-05-23 09:22:18,043 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 156 [2019-05-23 09:22:18,043 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,044 INFO L146 ILogger]: trace histogram [20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:18,044 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,044 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,044 INFO L146 ILogger]: Analyzing trace with hash 1176513368, now seen corresponding path program 20 times [2019-05-23 09:22:18,045 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,060 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,063 INFO L146 ILogger]: Trace formula consists of 223 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,065 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,631 INFO L146 ILogger]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,631 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,631 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:22:18,632 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:18,632 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:18,633 INFO L146 ILogger]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:18,633 INFO L146 ILogger]: Start difference. First operand 159 states and 160 transitions. Second operand 43 states. [2019-05-23 09:22:19,697 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,698 INFO L146 ILogger]: Finished difference Result 181 states and 182 transitions. [2019-05-23 09:22:19,698 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:22:19,698 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 155 [2019-05-23 09:22:19,699 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,700 INFO L146 ILogger]: With dead ends: 181 [2019-05-23 09:22:19,700 INFO L146 ILogger]: Without dead ends: 181 [2019-05-23 09:22:19,703 INFO L146 ILogger]: 0 DeclaredPredicates, 194 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:22:19,703 INFO L146 ILogger]: Start minimizeSevpa. Operand 181 states. [2019-05-23 09:22:19,705 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 181 to 166. [2019-05-23 09:22:19,705 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 09:22:19,706 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-05-23 09:22:19,706 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 155 [2019-05-23 09:22:19,706 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,706 INFO L146 ILogger]: Abstraction has 166 states and 167 transitions. [2019-05-23 09:22:19,707 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:19,707 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 167 transitions. [2019-05-23 09:22:19,707 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 09:22:19,708 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,708 INFO L146 ILogger]: trace histogram [21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:19,708 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,708 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,708 INFO L146 ILogger]: Analyzing trace with hash -1062666362, now seen corresponding path program 21 times [2019-05-23 09:22:19,709 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,725 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,727 INFO L146 ILogger]: Trace formula consists of 233 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,730 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,405 INFO L146 ILogger]: Checked inductivity of 1491 backedges. 0 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:20,405 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,406 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:22:20,406 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:22:20,406 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:22:20,407 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:20,407 INFO L146 ILogger]: Start difference. First operand 166 states and 167 transitions. Second operand 45 states. [2019-05-23 09:22:21,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,752 INFO L146 ILogger]: Finished difference Result 188 states and 189 transitions. [2019-05-23 09:22:21,754 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:22:21,755 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 162 [2019-05-23 09:22:21,755 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,756 INFO L146 ILogger]: With dead ends: 188 [2019-05-23 09:22:21,756 INFO L146 ILogger]: Without dead ends: 188 [2019-05-23 09:22:21,758 INFO L146 ILogger]: 0 DeclaredPredicates, 203 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:22:21,758 INFO L146 ILogger]: Start minimizeSevpa. Operand 188 states. [2019-05-23 09:22:21,760 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 188 to 173. [2019-05-23 09:22:21,760 INFO L146 ILogger]: Start removeUnreachable. Operand 173 states. [2019-05-23 09:22:21,760 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-05-23 09:22:21,761 INFO L146 ILogger]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 162 [2019-05-23 09:22:21,761 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,761 INFO L146 ILogger]: Abstraction has 173 states and 174 transitions. [2019-05-23 09:22:21,761 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:22:21,761 INFO L146 ILogger]: Start isEmpty. Operand 173 states and 174 transitions. [2019-05-23 09:22:21,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:22:21,762 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,762 INFO L146 ILogger]: trace histogram [22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:21,762 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,762 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,762 INFO L146 ILogger]: Analyzing trace with hash 12565400, now seen corresponding path program 22 times [2019-05-23 09:22:21,763 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,779 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,782 INFO L146 ILogger]: Trace formula consists of 243 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,784 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:22,425 INFO L146 ILogger]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:22,425 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,426 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:22:22,426 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:22:22,426 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:22:22,426 INFO L146 ILogger]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:22,427 INFO L146 ILogger]: Start difference. First operand 173 states and 174 transitions. Second operand 47 states. [2019-05-23 09:22:23,710 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:23,710 INFO L146 ILogger]: Finished difference Result 195 states and 196 transitions. [2019-05-23 09:22:23,711 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:22:23,711 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 169 [2019-05-23 09:22:23,711 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:23,713 INFO L146 ILogger]: With dead ends: 195 [2019-05-23 09:22:23,713 INFO L146 ILogger]: Without dead ends: 195 [2019-05-23 09:22:23,714 INFO L146 ILogger]: 0 DeclaredPredicates, 212 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:22:23,715 INFO L146 ILogger]: Start minimizeSevpa. Operand 195 states. [2019-05-23 09:22:23,717 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 195 to 180. [2019-05-23 09:22:23,717 INFO L146 ILogger]: Start removeUnreachable. Operand 180 states. [2019-05-23 09:22:23,718 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-05-23 09:22:23,718 INFO L146 ILogger]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 169 [2019-05-23 09:22:23,718 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:23,719 INFO L146 ILogger]: Abstraction has 180 states and 181 transitions. [2019-05-23 09:22:23,719 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:22:23,719 INFO L146 ILogger]: Start isEmpty. Operand 180 states and 181 transitions. [2019-05-23 09:22:23,720 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 177 [2019-05-23 09:22:23,720 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:23,720 INFO L146 ILogger]: trace histogram [23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:23,720 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:23,720 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,720 INFO L146 ILogger]: Analyzing trace with hash 1186113350, now seen corresponding path program 23 times [2019-05-23 09:22:23,721 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,737 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:23,740 INFO L146 ILogger]: Trace formula consists of 253 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:23,742 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:24,575 INFO L146 ILogger]: Checked inductivity of 1794 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:24,575 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:24,575 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:22:24,576 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:22:24,576 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:22:24,576 INFO L146 ILogger]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:24,577 INFO L146 ILogger]: Start difference. First operand 180 states and 181 transitions. Second operand 49 states. [2019-05-23 09:22:25,836 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,836 INFO L146 ILogger]: Finished difference Result 202 states and 203 transitions. [2019-05-23 09:22:25,836 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:22:25,836 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 176 [2019-05-23 09:22:25,837 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,838 INFO L146 ILogger]: With dead ends: 202 [2019-05-23 09:22:25,839 INFO L146 ILogger]: Without dead ends: 202 [2019-05-23 09:22:25,840 INFO L146 ILogger]: 0 DeclaredPredicates, 221 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:22:25,841 INFO L146 ILogger]: Start minimizeSevpa. Operand 202 states. [2019-05-23 09:22:25,843 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 202 to 187. [2019-05-23 09:22:25,843 INFO L146 ILogger]: Start removeUnreachable. Operand 187 states. [2019-05-23 09:22:25,844 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-05-23 09:22:25,844 INFO L146 ILogger]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 176 [2019-05-23 09:22:25,845 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,845 INFO L146 ILogger]: Abstraction has 187 states and 188 transitions. [2019-05-23 09:22:25,845 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:22:25,845 INFO L146 ILogger]: Start isEmpty. Operand 187 states and 188 transitions. [2019-05-23 09:22:25,846 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 184 [2019-05-23 09:22:25,846 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,846 INFO L146 ILogger]: trace histogram [24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:25,846 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,847 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,847 INFO L146 ILogger]: Analyzing trace with hash 465427416, now seen corresponding path program 24 times [2019-05-23 09:22:25,848 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,864 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,867 INFO L146 ILogger]: Trace formula consists of 263 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,870 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:27,495 INFO L146 ILogger]: Checked inductivity of 1956 backedges. 0 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:27,496 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:27,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:22:27,496 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:22:27,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:22:27,497 INFO L146 ILogger]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:27,497 INFO L146 ILogger]: Start difference. First operand 187 states and 188 transitions. Second operand 51 states. [2019-05-23 09:22:28,782 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:28,783 INFO L146 ILogger]: Finished difference Result 209 states and 210 transitions. [2019-05-23 09:22:28,783 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:22:28,783 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 183 [2019-05-23 09:22:28,784 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:28,786 INFO L146 ILogger]: With dead ends: 209 [2019-05-23 09:22:28,786 INFO L146 ILogger]: Without dead ends: 209 [2019-05-23 09:22:28,788 INFO L146 ILogger]: 0 DeclaredPredicates, 230 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:22:28,788 INFO L146 ILogger]: Start minimizeSevpa. Operand 209 states. [2019-05-23 09:22:28,790 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 209 to 194. [2019-05-23 09:22:28,791 INFO L146 ILogger]: Start removeUnreachable. Operand 194 states. [2019-05-23 09:22:28,791 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-05-23 09:22:28,791 INFO L146 ILogger]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 183 [2019-05-23 09:22:28,792 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:28,792 INFO L146 ILogger]: Abstraction has 194 states and 195 transitions. [2019-05-23 09:22:28,792 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:22:28,799 INFO L146 ILogger]: Start isEmpty. Operand 194 states and 195 transitions. [2019-05-23 09:22:28,800 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 191 [2019-05-23 09:22:28,800 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:28,800 INFO L146 ILogger]: trace histogram [25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:28,801 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:28,801 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:28,801 INFO L146 ILogger]: Analyzing trace with hash -1881424122, now seen corresponding path program 25 times [2019-05-23 09:22:28,802 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:28,821 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:28,824 INFO L146 ILogger]: Trace formula consists of 273 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:22:28,827 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,852 INFO L146 ILogger]: Checked inductivity of 2125 backedges. 0 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:29,852 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:29,852 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:22:29,853 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:22:29,853 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:22:29,854 INFO L146 ILogger]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:29,854 INFO L146 ILogger]: Start difference. First operand 194 states and 195 transitions. Second operand 53 states. [2019-05-23 09:22:31,607 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:31,607 INFO L146 ILogger]: Finished difference Result 216 states and 217 transitions. [2019-05-23 09:22:31,607 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:22:31,607 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 190 [2019-05-23 09:22:31,608 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:31,609 INFO L146 ILogger]: With dead ends: 216 [2019-05-23 09:22:31,609 INFO L146 ILogger]: Without dead ends: 216 [2019-05-23 09:22:31,611 INFO L146 ILogger]: 0 DeclaredPredicates, 239 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:22:31,611 INFO L146 ILogger]: Start minimizeSevpa. Operand 216 states. [2019-05-23 09:22:31,614 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 216 to 201. [2019-05-23 09:22:31,614 INFO L146 ILogger]: Start removeUnreachable. Operand 201 states. [2019-05-23 09:22:31,615 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-05-23 09:22:31,615 INFO L146 ILogger]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 190 [2019-05-23 09:22:31,615 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:31,616 INFO L146 ILogger]: Abstraction has 201 states and 202 transitions. [2019-05-23 09:22:31,616 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:22:31,616 INFO L146 ILogger]: Start isEmpty. Operand 201 states and 202 transitions. [2019-05-23 09:22:31,617 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 198 [2019-05-23 09:22:31,617 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:31,617 INFO L146 ILogger]: trace histogram [26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:31,617 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:31,617 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:31,618 INFO L146 ILogger]: Analyzing trace with hash 106859544, now seen corresponding path program 26 times [2019-05-23 09:22:31,618 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:31,635 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:31,638 INFO L146 ILogger]: Trace formula consists of 283 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:31,641 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:32,697 INFO L146 ILogger]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:32,697 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:32,697 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:22:32,698 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:22:32,698 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:22:32,699 INFO L146 ILogger]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:32,699 INFO L146 ILogger]: Start difference. First operand 201 states and 202 transitions. Second operand 55 states. [2019-05-23 09:22:34,503 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:34,503 INFO L146 ILogger]: Finished difference Result 223 states and 224 transitions. [2019-05-23 09:22:34,504 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:22:34,504 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 197 [2019-05-23 09:22:34,505 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:34,506 INFO L146 ILogger]: With dead ends: 223 [2019-05-23 09:22:34,506 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 09:22:34,507 INFO L146 ILogger]: 0 DeclaredPredicates, 248 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:22:34,508 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 09:22:34,510 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 208. [2019-05-23 09:22:34,511 INFO L146 ILogger]: Start removeUnreachable. Operand 208 states. [2019-05-23 09:22:34,511 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-05-23 09:22:34,511 INFO L146 ILogger]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 197 [2019-05-23 09:22:34,512 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:34,512 INFO L146 ILogger]: Abstraction has 208 states and 209 transitions. [2019-05-23 09:22:34,514 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:22:34,514 INFO L146 ILogger]: Start isEmpty. Operand 208 states and 209 transitions. [2019-05-23 09:22:34,515 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 205 [2019-05-23 09:22:34,515 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:34,515 INFO L146 ILogger]: trace histogram [27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:34,515 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:34,516 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:34,516 INFO L146 ILogger]: Analyzing trace with hash 945833670, now seen corresponding path program 27 times [2019-05-23 09:22:34,516 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:34,540 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:34,542 INFO L146 ILogger]: Trace formula consists of 293 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:22:34,546 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:35,876 INFO L146 ILogger]: Checked inductivity of 2484 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:35,876 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:35,876 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:22:35,877 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:22:35,877 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:22:35,877 INFO L146 ILogger]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:35,877 INFO L146 ILogger]: Start difference. First operand 208 states and 209 transitions. Second operand 57 states. [2019-05-23 09:22:37,730 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:37,730 INFO L146 ILogger]: Finished difference Result 230 states and 231 transitions. [2019-05-23 09:22:37,730 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:22:37,730 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 204 [2019-05-23 09:22:37,731 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:37,735 INFO L146 ILogger]: With dead ends: 230 [2019-05-23 09:22:37,735 INFO L146 ILogger]: Without dead ends: 230 [2019-05-23 09:22:37,736 INFO L146 ILogger]: 0 DeclaredPredicates, 257 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:22:37,737 INFO L146 ILogger]: Start minimizeSevpa. Operand 230 states. [2019-05-23 09:22:37,739 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 230 to 215. [2019-05-23 09:22:37,739 INFO L146 ILogger]: Start removeUnreachable. Operand 215 states. [2019-05-23 09:22:37,740 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-05-23 09:22:37,740 INFO L146 ILogger]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 204 [2019-05-23 09:22:37,740 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:37,741 INFO L146 ILogger]: Abstraction has 215 states and 216 transitions. [2019-05-23 09:22:37,741 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:22:37,741 INFO L146 ILogger]: Start isEmpty. Operand 215 states and 216 transitions. [2019-05-23 09:22:37,742 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 212 [2019-05-23 09:22:37,742 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:37,742 INFO L146 ILogger]: trace histogram [28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:37,742 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:37,743 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:37,743 INFO L146 ILogger]: Analyzing trace with hash 686148696, now seen corresponding path program 28 times [2019-05-23 09:22:37,743 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:37,764 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:37,767 INFO L146 ILogger]: Trace formula consists of 303 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:37,770 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:38,789 INFO L146 ILogger]: Checked inductivity of 2674 backedges. 0 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:38,789 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:38,789 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:22:38,790 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:22:38,790 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:22:38,791 INFO L146 ILogger]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:38,791 INFO L146 ILogger]: Start difference. First operand 215 states and 216 transitions. Second operand 59 states. [2019-05-23 09:22:40,602 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:40,602 INFO L146 ILogger]: Finished difference Result 237 states and 238 transitions. [2019-05-23 09:22:40,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:22:40,602 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 211 [2019-05-23 09:22:40,603 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:40,605 INFO L146 ILogger]: With dead ends: 237 [2019-05-23 09:22:40,605 INFO L146 ILogger]: Without dead ends: 237 [2019-05-23 09:22:40,606 INFO L146 ILogger]: 0 DeclaredPredicates, 266 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:22:40,607 INFO L146 ILogger]: Start minimizeSevpa. Operand 237 states. [2019-05-23 09:22:40,609 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 237 to 222. [2019-05-23 09:22:40,609 INFO L146 ILogger]: Start removeUnreachable. Operand 222 states. [2019-05-23 09:22:40,610 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2019-05-23 09:22:40,610 INFO L146 ILogger]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 211 [2019-05-23 09:22:40,610 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:40,610 INFO L146 ILogger]: Abstraction has 222 states and 223 transitions. [2019-05-23 09:22:40,611 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:22:40,611 INFO L146 ILogger]: Start isEmpty. Operand 222 states and 223 transitions. [2019-05-23 09:22:40,612 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 219 [2019-05-23 09:22:40,612 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:40,612 INFO L146 ILogger]: trace histogram [29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:40,612 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:40,612 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:40,612 INFO L146 ILogger]: Analyzing trace with hash -1015267706, now seen corresponding path program 29 times [2019-05-23 09:22:40,613 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:40,635 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:40,638 INFO L146 ILogger]: Trace formula consists of 313 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:40,641 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,349 INFO L146 ILogger]: Checked inductivity of 2871 backedges. 0 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:42,349 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,349 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:22:42,349 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:22:42,350 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:22:42,350 INFO L146 ILogger]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:42,350 INFO L146 ILogger]: Start difference. First operand 222 states and 223 transitions. Second operand 61 states. [2019-05-23 09:22:45,317 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:45,318 INFO L146 ILogger]: Finished difference Result 244 states and 245 transitions. [2019-05-23 09:22:45,318 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:22:45,318 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 218 [2019-05-23 09:22:45,318 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:45,319 INFO L146 ILogger]: With dead ends: 244 [2019-05-23 09:22:45,320 INFO L146 ILogger]: Without dead ends: 244 [2019-05-23 09:22:45,320 INFO L146 ILogger]: 0 DeclaredPredicates, 275 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:22:45,321 INFO L146 ILogger]: Start minimizeSevpa. Operand 244 states. [2019-05-23 09:22:45,323 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 244 to 229. [2019-05-23 09:22:45,323 INFO L146 ILogger]: Start removeUnreachable. Operand 229 states. [2019-05-23 09:22:45,324 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2019-05-23 09:22:45,324 INFO L146 ILogger]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 218 [2019-05-23 09:22:45,324 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:45,324 INFO L146 ILogger]: Abstraction has 229 states and 230 transitions. [2019-05-23 09:22:45,324 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:22:45,325 INFO L146 ILogger]: Start isEmpty. Operand 229 states and 230 transitions. [2019-05-23 09:22:45,326 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 226 [2019-05-23 09:22:45,326 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:45,326 INFO L146 ILogger]: trace histogram [30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:45,326 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:45,326 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:45,327 INFO L146 ILogger]: Analyzing trace with hash 613915800, now seen corresponding path program 30 times [2019-05-23 09:22:45,327 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:45,345 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:45,348 INFO L146 ILogger]: Trace formula consists of 323 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:22:45,351 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:46,455 INFO L146 ILogger]: Checked inductivity of 3075 backedges. 0 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:46,456 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:46,456 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:22:46,456 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:22:46,457 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:22:46,457 INFO L146 ILogger]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:46,457 INFO L146 ILogger]: Start difference. First operand 229 states and 230 transitions. Second operand 63 states. [2019-05-23 09:22:48,593 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:48,593 INFO L146 ILogger]: Finished difference Result 251 states and 252 transitions. [2019-05-23 09:22:48,594 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:22:48,594 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 225 [2019-05-23 09:22:48,594 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:48,596 INFO L146 ILogger]: With dead ends: 251 [2019-05-23 09:22:48,596 INFO L146 ILogger]: Without dead ends: 251 [2019-05-23 09:22:48,597 INFO L146 ILogger]: 0 DeclaredPredicates, 284 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:22:48,598 INFO L146 ILogger]: Start minimizeSevpa. Operand 251 states. [2019-05-23 09:22:48,600 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 251 to 236. [2019-05-23 09:22:48,600 INFO L146 ILogger]: Start removeUnreachable. Operand 236 states. [2019-05-23 09:22:48,600 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2019-05-23 09:22:48,600 INFO L146 ILogger]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 225 [2019-05-23 09:22:48,600 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:48,601 INFO L146 ILogger]: Abstraction has 236 states and 237 transitions. [2019-05-23 09:22:48,601 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:22:48,601 INFO L146 ILogger]: Start isEmpty. Operand 236 states and 237 transitions. [2019-05-23 09:22:48,602 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 233 [2019-05-23 09:22:48,602 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:48,602 INFO L146 ILogger]: trace histogram [31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:48,602 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:48,603 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:48,603 INFO L146 ILogger]: Analyzing trace with hash 1533781574, now seen corresponding path program 31 times [2019-05-23 09:22:48,603 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:48,623 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:48,625 INFO L146 ILogger]: Trace formula consists of 333 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:22:48,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:50,237 INFO L146 ILogger]: Checked inductivity of 3286 backedges. 0 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:50,238 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:50,238 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:22:50,238 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:22:50,239 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:22:50,239 INFO L146 ILogger]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:22:50,239 INFO L146 ILogger]: Start difference. First operand 236 states and 237 transitions. Second operand 65 states. [2019-05-23 09:22:52,708 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:52,708 INFO L146 ILogger]: Finished difference Result 258 states and 259 transitions. [2019-05-23 09:22:52,709 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:22:52,709 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 232 [2019-05-23 09:22:52,709 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:52,711 INFO L146 ILogger]: With dead ends: 258 [2019-05-23 09:22:52,711 INFO L146 ILogger]: Without dead ends: 258 [2019-05-23 09:22:52,712 INFO L146 ILogger]: 0 DeclaredPredicates, 293 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:22:52,712 INFO L146 ILogger]: Start minimizeSevpa. Operand 258 states. [2019-05-23 09:22:52,715 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 258 to 243. [2019-05-23 09:22:52,715 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 09:22:52,715 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2019-05-23 09:22:52,715 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 232 [2019-05-23 09:22:52,716 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:52,717 INFO L146 ILogger]: Abstraction has 243 states and 244 transitions. [2019-05-23 09:22:52,717 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:22:52,717 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 244 transitions. [2019-05-23 09:22:52,718 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 240 [2019-05-23 09:22:52,718 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:52,718 INFO L146 ILogger]: trace histogram [32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:52,718 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:52,718 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:52,719 INFO L146 ILogger]: Analyzing trace with hash 330824920, now seen corresponding path program 32 times [2019-05-23 09:22:52,719 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:52,740 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:52,743 INFO L146 ILogger]: Trace formula consists of 343 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:52,746 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,024 INFO L146 ILogger]: Checked inductivity of 3504 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:54,024 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,025 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:22:54,025 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:22:54,025 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:22:54,026 INFO L146 ILogger]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:54,026 INFO L146 ILogger]: Start difference. First operand 243 states and 244 transitions. Second operand 67 states. [2019-05-23 09:22:56,279 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:56,280 INFO L146 ILogger]: Finished difference Result 265 states and 266 transitions. [2019-05-23 09:22:56,280 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:22:56,280 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 239 [2019-05-23 09:22:56,281 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:56,282 INFO L146 ILogger]: With dead ends: 265 [2019-05-23 09:22:56,282 INFO L146 ILogger]: Without dead ends: 265 [2019-05-23 09:22:56,283 INFO L146 ILogger]: 0 DeclaredPredicates, 302 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:22:56,284 INFO L146 ILogger]: Start minimizeSevpa. Operand 265 states. [2019-05-23 09:22:56,286 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 265 to 250. [2019-05-23 09:22:56,286 INFO L146 ILogger]: Start removeUnreachable. Operand 250 states. [2019-05-23 09:22:56,287 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-05-23 09:22:56,287 INFO L146 ILogger]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 239 [2019-05-23 09:22:56,287 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:56,287 INFO L146 ILogger]: Abstraction has 250 states and 251 transitions. [2019-05-23 09:22:56,287 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:22:56,287 INFO L146 ILogger]: Start isEmpty. Operand 250 states and 251 transitions. [2019-05-23 09:22:56,288 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 247 [2019-05-23 09:22:56,288 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:56,288 INFO L146 ILogger]: trace histogram [33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:56,289 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:56,289 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:56,289 INFO L146 ILogger]: Analyzing trace with hash -1855291898, now seen corresponding path program 33 times [2019-05-23 09:22:56,289 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:56,308 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:56,311 INFO L146 ILogger]: Trace formula consists of 353 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:22:56,315 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:58,834 INFO L146 ILogger]: Checked inductivity of 3729 backedges. 0 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:58,835 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:58,835 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:22:58,835 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:22:58,836 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:22:58,836 INFO L146 ILogger]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:22:58,836 INFO L146 ILogger]: Start difference. First operand 250 states and 251 transitions. Second operand 69 states. [2019-05-23 09:23:01,129 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:01,129 INFO L146 ILogger]: Finished difference Result 272 states and 273 transitions. [2019-05-23 09:23:01,130 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:23:01,130 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 246 [2019-05-23 09:23:01,130 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:01,132 INFO L146 ILogger]: With dead ends: 272 [2019-05-23 09:23:01,132 INFO L146 ILogger]: Without dead ends: 272 [2019-05-23 09:23:01,133 INFO L146 ILogger]: 0 DeclaredPredicates, 311 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:23:01,134 INFO L146 ILogger]: Start minimizeSevpa. Operand 272 states. [2019-05-23 09:23:01,136 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 272 to 257. [2019-05-23 09:23:01,136 INFO L146 ILogger]: Start removeUnreachable. Operand 257 states. [2019-05-23 09:23:01,136 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2019-05-23 09:23:01,136 INFO L146 ILogger]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 246 [2019-05-23 09:23:01,137 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:01,137 INFO L146 ILogger]: Abstraction has 257 states and 258 transitions. [2019-05-23 09:23:01,137 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:23:01,137 INFO L146 ILogger]: Start isEmpty. Operand 257 states and 258 transitions. [2019-05-23 09:23:01,138 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 254 [2019-05-23 09:23:01,138 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:01,138 INFO L146 ILogger]: trace histogram [34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:01,138 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:01,138 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:01,138 INFO L146 ILogger]: Analyzing trace with hash -913642216, now seen corresponding path program 34 times [2019-05-23 09:23:01,139 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:01,159 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:01,162 INFO L146 ILogger]: Trace formula consists of 363 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:23:01,166 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:03,103 INFO L146 ILogger]: Checked inductivity of 3961 backedges. 0 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:03,104 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:03,104 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:23:03,104 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:23:03,104 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:23:03,105 INFO L146 ILogger]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:03,105 INFO L146 ILogger]: Start difference. First operand 257 states and 258 transitions. Second operand 71 states. [2019-05-23 09:23:05,576 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:05,576 INFO L146 ILogger]: Finished difference Result 279 states and 280 transitions. [2019-05-23 09:23:05,576 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:23:05,577 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 253 [2019-05-23 09:23:05,577 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:05,579 INFO L146 ILogger]: With dead ends: 279 [2019-05-23 09:23:05,579 INFO L146 ILogger]: Without dead ends: 279 [2019-05-23 09:23:05,581 INFO L146 ILogger]: 0 DeclaredPredicates, 320 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:23:05,581 INFO L146 ILogger]: Start minimizeSevpa. Operand 279 states. [2019-05-23 09:23:05,583 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 279 to 264. [2019-05-23 09:23:05,583 INFO L146 ILogger]: Start removeUnreachable. Operand 264 states. [2019-05-23 09:23:05,584 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-05-23 09:23:05,584 INFO L146 ILogger]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 253 [2019-05-23 09:23:05,584 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:05,584 INFO L146 ILogger]: Abstraction has 264 states and 265 transitions. [2019-05-23 09:23:05,584 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:23:05,585 INFO L146 ILogger]: Start isEmpty. Operand 264 states and 265 transitions. [2019-05-23 09:23:05,586 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 261 [2019-05-23 09:23:05,586 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:05,586 INFO L146 ILogger]: trace histogram [35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:05,586 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:05,586 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:05,587 INFO L146 ILogger]: Analyzing trace with hash 498386374, now seen corresponding path program 35 times [2019-05-23 09:23:05,587 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:05,607 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:05,610 INFO L146 ILogger]: Trace formula consists of 373 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:23:05,614 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:07,169 INFO L146 ILogger]: Checked inductivity of 4200 backedges. 0 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:07,169 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:07,169 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:23:07,170 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:23:07,170 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:23:07,170 INFO L146 ILogger]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:07,171 INFO L146 ILogger]: Start difference. First operand 264 states and 265 transitions. Second operand 73 states. [2019-05-23 09:23:09,716 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:09,716 INFO L146 ILogger]: Finished difference Result 286 states and 287 transitions. [2019-05-23 09:23:09,717 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:23:09,717 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 260 [2019-05-23 09:23:09,717 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:09,719 INFO L146 ILogger]: With dead ends: 286 [2019-05-23 09:23:09,719 INFO L146 ILogger]: Without dead ends: 286 [2019-05-23 09:23:09,720 INFO L146 ILogger]: 0 DeclaredPredicates, 329 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:23:09,721 INFO L146 ILogger]: Start minimizeSevpa. Operand 286 states. [2019-05-23 09:23:09,724 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 286 to 271. [2019-05-23 09:23:09,724 INFO L146 ILogger]: Start removeUnreachable. Operand 271 states. [2019-05-23 09:23:09,724 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-05-23 09:23:09,725 INFO L146 ILogger]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 260 [2019-05-23 09:23:09,725 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:09,725 INFO L146 ILogger]: Abstraction has 271 states and 272 transitions. [2019-05-23 09:23:09,725 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:23:09,725 INFO L146 ILogger]: Start isEmpty. Operand 271 states and 272 transitions. [2019-05-23 09:23:09,726 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 268 [2019-05-23 09:23:09,727 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:09,727 INFO L146 ILogger]: trace histogram [36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:09,727 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:09,727 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:09,727 INFO L146 ILogger]: Analyzing trace with hash 307522904, now seen corresponding path program 36 times [2019-05-23 09:23:09,728 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:09,750 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:09,754 INFO L146 ILogger]: Trace formula consists of 383 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:23:09,758 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:11,362 INFO L146 ILogger]: Checked inductivity of 4446 backedges. 0 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:11,362 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:11,362 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:23:11,363 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:23:11,363 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:23:11,364 INFO L146 ILogger]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:11,364 INFO L146 ILogger]: Start difference. First operand 271 states and 272 transitions. Second operand 75 states. [2019-05-23 09:23:14,311 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:14,312 INFO L146 ILogger]: Finished difference Result 293 states and 294 transitions. [2019-05-23 09:23:14,312 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 09:23:14,312 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 267 [2019-05-23 09:23:14,313 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:14,314 INFO L146 ILogger]: With dead ends: 293 [2019-05-23 09:23:14,314 INFO L146 ILogger]: Without dead ends: 293 [2019-05-23 09:23:14,315 INFO L146 ILogger]: 0 DeclaredPredicates, 338 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:23:14,316 INFO L146 ILogger]: Start minimizeSevpa. Operand 293 states. [2019-05-23 09:23:14,318 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 293 to 278. [2019-05-23 09:23:14,318 INFO L146 ILogger]: Start removeUnreachable. Operand 278 states. [2019-05-23 09:23:14,319 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 278 states to 278 states and 279 transitions. [2019-05-23 09:23:14,319 INFO L146 ILogger]: Start accepts. Automaton has 278 states and 279 transitions. Word has length 267 [2019-05-23 09:23:14,319 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:14,319 INFO L146 ILogger]: Abstraction has 278 states and 279 transitions. [2019-05-23 09:23:14,320 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:23:14,320 INFO L146 ILogger]: Start isEmpty. Operand 278 states and 279 transitions. [2019-05-23 09:23:14,321 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 275 [2019-05-23 09:23:14,321 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:14,321 INFO L146 ILogger]: trace histogram [37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:14,322 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:14,322 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:14,322 INFO L146 ILogger]: Analyzing trace with hash -1618575994, now seen corresponding path program 37 times [2019-05-23 09:23:14,323 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:14,344 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:14,347 INFO L146 ILogger]: Trace formula consists of 393 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:23:14,351 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,224 INFO L146 ILogger]: Checked inductivity of 4699 backedges. 0 proven. 4699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:16,225 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:16,225 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:23:16,225 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:23:16,226 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:23:16,226 INFO L146 ILogger]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:16,226 INFO L146 ILogger]: Start difference. First operand 278 states and 279 transitions. Second operand 77 states. [2019-05-23 09:23:19,312 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:19,312 INFO L146 ILogger]: Finished difference Result 300 states and 301 transitions. [2019-05-23 09:23:19,313 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:23:19,313 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 274 [2019-05-23 09:23:19,313 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:19,315 INFO L146 ILogger]: With dead ends: 300 [2019-05-23 09:23:19,315 INFO L146 ILogger]: Without dead ends: 300 [2019-05-23 09:23:19,316 INFO L146 ILogger]: 0 DeclaredPredicates, 347 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:23:19,317 INFO L146 ILogger]: Start minimizeSevpa. Operand 300 states. [2019-05-23 09:23:19,320 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 300 to 285. [2019-05-23 09:23:19,320 INFO L146 ILogger]: Start removeUnreachable. Operand 285 states. [2019-05-23 09:23:19,320 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2019-05-23 09:23:19,321 INFO L146 ILogger]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 274 [2019-05-23 09:23:19,321 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:19,321 INFO L146 ILogger]: Abstraction has 285 states and 286 transitions. [2019-05-23 09:23:19,321 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:23:19,321 INFO L146 ILogger]: Start isEmpty. Operand 285 states and 286 transitions. [2019-05-23 09:23:19,322 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 282 [2019-05-23 09:23:19,322 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:19,323 INFO L146 ILogger]: trace histogram [38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:19,323 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:19,323 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:19,323 INFO L146 ILogger]: Analyzing trace with hash -212304488, now seen corresponding path program 38 times [2019-05-23 09:23:19,324 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:19,346 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:19,349 INFO L146 ILogger]: Trace formula consists of 403 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:23:19,354 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:21,159 INFO L146 ILogger]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:21,159 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:21,160 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:23:21,160 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:23:21,160 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:23:21,161 INFO L146 ILogger]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:21,161 INFO L146 ILogger]: Start difference. First operand 285 states and 286 transitions. Second operand 79 states. [2019-05-23 09:23:24,342 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:24,342 INFO L146 ILogger]: Finished difference Result 307 states and 308 transitions. [2019-05-23 09:23:24,349 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 09:23:24,349 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 281 [2019-05-23 09:23:24,349 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:24,351 INFO L146 ILogger]: With dead ends: 307 [2019-05-23 09:23:24,351 INFO L146 ILogger]: Without dead ends: 307 [2019-05-23 09:23:24,352 INFO L146 ILogger]: 0 DeclaredPredicates, 356 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:23:24,352 INFO L146 ILogger]: Start minimizeSevpa. Operand 307 states. [2019-05-23 09:23:24,355 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 307 to 292. [2019-05-23 09:23:24,355 INFO L146 ILogger]: Start removeUnreachable. Operand 292 states. [2019-05-23 09:23:24,356 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 292 states to 292 states and 293 transitions. [2019-05-23 09:23:24,356 INFO L146 ILogger]: Start accepts. Automaton has 292 states and 293 transitions. Word has length 281 [2019-05-23 09:23:24,356 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:24,356 INFO L146 ILogger]: Abstraction has 292 states and 293 transitions. [2019-05-23 09:23:24,356 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:23:24,356 INFO L146 ILogger]: Start isEmpty. Operand 292 states and 293 transitions. [2019-05-23 09:23:24,357 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 289 [2019-05-23 09:23:24,358 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:24,358 INFO L146 ILogger]: trace histogram [39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:24,358 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:24,358 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:24,358 INFO L146 ILogger]: Analyzing trace with hash 1562092870, now seen corresponding path program 39 times [2019-05-23 09:23:24,359 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:24,381 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:24,384 INFO L146 ILogger]: Trace formula consists of 413 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:23:24,388 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:26,230 INFO L146 ILogger]: Checked inductivity of 5226 backedges. 0 proven. 5226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:26,230 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:26,230 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:23:26,231 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:23:26,231 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:23:26,232 INFO L146 ILogger]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:26,232 INFO L146 ILogger]: Start difference. First operand 292 states and 293 transitions. Second operand 81 states. [2019-05-23 09:23:29,643 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:29,644 INFO L146 ILogger]: Finished difference Result 314 states and 315 transitions. [2019-05-23 09:23:29,644 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:23:29,644 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 288 [2019-05-23 09:23:29,645 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:29,646 INFO L146 ILogger]: With dead ends: 314 [2019-05-23 09:23:29,646 INFO L146 ILogger]: Without dead ends: 314 [2019-05-23 09:23:29,647 INFO L146 ILogger]: 0 DeclaredPredicates, 365 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:23:29,647 INFO L146 ILogger]: Start minimizeSevpa. Operand 314 states. [2019-05-23 09:23:29,649 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 314 to 299. [2019-05-23 09:23:29,650 INFO L146 ILogger]: Start removeUnreachable. Operand 299 states. [2019-05-23 09:23:29,650 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2019-05-23 09:23:29,650 INFO L146 ILogger]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 288 [2019-05-23 09:23:29,650 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:29,650 INFO L146 ILogger]: Abstraction has 299 states and 300 transitions. [2019-05-23 09:23:29,651 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:23:29,651 INFO L146 ILogger]: Start isEmpty. Operand 299 states and 300 transitions. [2019-05-23 09:23:29,652 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 296 [2019-05-23 09:23:29,652 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:29,652 INFO L146 ILogger]: trace histogram [40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:29,652 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:29,652 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:29,652 INFO L146 ILogger]: Analyzing trace with hash -354738728, now seen corresponding path program 40 times [2019-05-23 09:23:29,653 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:29,675 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:29,678 INFO L146 ILogger]: Trace formula consists of 423 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:23:29,683 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:32,388 INFO L146 ILogger]: Checked inductivity of 5500 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:32,388 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:32,389 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:23:32,389 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:23:32,389 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:23:32,390 INFO L146 ILogger]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:32,390 INFO L146 ILogger]: Start difference. First operand 299 states and 300 transitions. Second operand 83 states. [2019-05-23 09:23:35,884 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:35,885 INFO L146 ILogger]: Finished difference Result 321 states and 322 transitions. [2019-05-23 09:23:35,885 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 09:23:35,885 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 295 [2019-05-23 09:23:35,886 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:35,887 INFO L146 ILogger]: With dead ends: 321 [2019-05-23 09:23:35,887 INFO L146 ILogger]: Without dead ends: 321 [2019-05-23 09:23:35,888 INFO L146 ILogger]: 0 DeclaredPredicates, 374 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:23:35,889 INFO L146 ILogger]: Start minimizeSevpa. Operand 321 states. [2019-05-23 09:23:35,891 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 321 to 306. [2019-05-23 09:23:35,891 INFO L146 ILogger]: Start removeUnreachable. Operand 306 states. [2019-05-23 09:23:35,892 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2019-05-23 09:23:35,892 INFO L146 ILogger]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 295 [2019-05-23 09:23:35,892 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:35,893 INFO L146 ILogger]: Abstraction has 306 states and 307 transitions. [2019-05-23 09:23:35,893 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:23:35,893 INFO L146 ILogger]: Start isEmpty. Operand 306 states and 307 transitions. [2019-05-23 09:23:35,894 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 303 [2019-05-23 09:23:35,894 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:35,894 INFO L146 ILogger]: trace histogram [41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:35,895 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:35,895 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:35,895 INFO L146 ILogger]: Analyzing trace with hash 61881606, now seen corresponding path program 41 times [2019-05-23 09:23:35,896 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:35,919 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:35,923 INFO L146 ILogger]: Trace formula consists of 433 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:23:35,927 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:38,608 INFO L146 ILogger]: Checked inductivity of 5781 backedges. 0 proven. 5781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:38,609 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:38,609 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:23:38,609 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:23:38,609 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:23:38,610 INFO L146 ILogger]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:38,610 INFO L146 ILogger]: Start difference. First operand 306 states and 307 transitions. Second operand 85 states. [2019-05-23 09:23:41,934 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:41,935 INFO L146 ILogger]: Finished difference Result 328 states and 329 transitions. [2019-05-23 09:23:41,935 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 09:23:41,935 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 302 [2019-05-23 09:23:41,936 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:41,937 INFO L146 ILogger]: With dead ends: 328 [2019-05-23 09:23:41,937 INFO L146 ILogger]: Without dead ends: 328 [2019-05-23 09:23:41,939 INFO L146 ILogger]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:23:41,939 INFO L146 ILogger]: Start minimizeSevpa. Operand 328 states. [2019-05-23 09:23:41,941 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 328 to 313. [2019-05-23 09:23:41,942 INFO L146 ILogger]: Start removeUnreachable. Operand 313 states. [2019-05-23 09:23:41,942 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2019-05-23 09:23:41,942 INFO L146 ILogger]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 302 [2019-05-23 09:23:41,943 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:41,943 INFO L146 ILogger]: Abstraction has 313 states and 314 transitions. [2019-05-23 09:23:41,943 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:23:41,943 INFO L146 ILogger]: Start isEmpty. Operand 313 states and 314 transitions. [2019-05-23 09:23:41,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 310 [2019-05-23 09:23:41,944 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:41,945 INFO L146 ILogger]: trace histogram [42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:41,945 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:41,945 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:41,945 INFO L146 ILogger]: Analyzing trace with hash 807423512, now seen corresponding path program 42 times [2019-05-23 09:23:41,946 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:41,970 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:41,974 INFO L146 ILogger]: Trace formula consists of 443 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:23:41,977 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:44,112 INFO L146 ILogger]: Checked inductivity of 6069 backedges. 0 proven. 6069 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:44,113 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:44,113 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:23:44,113 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:23:44,114 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:23:44,114 INFO L146 ILogger]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:23:44,114 INFO L146 ILogger]: Start difference. First operand 313 states and 314 transitions. Second operand 87 states. [2019-05-23 09:23:47,854 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:47,854 INFO L146 ILogger]: Finished difference Result 335 states and 336 transitions. [2019-05-23 09:23:47,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 09:23:47,854 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 309 [2019-05-23 09:23:47,855 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:47,856 INFO L146 ILogger]: With dead ends: 335 [2019-05-23 09:23:47,856 INFO L146 ILogger]: Without dead ends: 335 [2019-05-23 09:23:47,858 INFO L146 ILogger]: 0 DeclaredPredicates, 392 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:23:47,858 INFO L146 ILogger]: Start minimizeSevpa. Operand 335 states. [2019-05-23 09:23:47,861 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 335 to 320. [2019-05-23 09:23:47,861 INFO L146 ILogger]: Start removeUnreachable. Operand 320 states. [2019-05-23 09:23:47,862 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-05-23 09:23:47,862 INFO L146 ILogger]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 309 [2019-05-23 09:23:47,862 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:47,862 INFO L146 ILogger]: Abstraction has 320 states and 321 transitions. [2019-05-23 09:23:47,863 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:23:47,863 INFO L146 ILogger]: Start isEmpty. Operand 320 states and 321 transitions. [2019-05-23 09:23:47,864 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 317 [2019-05-23 09:23:47,864 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:47,865 INFO L146 ILogger]: trace histogram [43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:47,865 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:47,865 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:47,865 INFO L146 ILogger]: Analyzing trace with hash 1736459462, now seen corresponding path program 43 times [2019-05-23 09:23:47,866 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:47,889 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:47,893 INFO L146 ILogger]: Trace formula consists of 453 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:23:47,897 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:49,975 INFO L146 ILogger]: Checked inductivity of 6364 backedges. 0 proven. 6364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:49,976 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:49,976 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:23:49,977 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:23:49,977 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:23:49,978 INFO L146 ILogger]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:23:49,978 INFO L146 ILogger]: Start difference. First operand 320 states and 321 transitions. Second operand 89 states. [2019-05-23 09:23:54,098 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:54,098 INFO L146 ILogger]: Finished difference Result 342 states and 343 transitions. [2019-05-23 09:23:54,099 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 09:23:54,099 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 316 [2019-05-23 09:23:54,099 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:54,101 INFO L146 ILogger]: With dead ends: 342 [2019-05-23 09:23:54,101 INFO L146 ILogger]: Without dead ends: 342 [2019-05-23 09:23:54,103 INFO L146 ILogger]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:23:54,103 INFO L146 ILogger]: Start minimizeSevpa. Operand 342 states. [2019-05-23 09:23:54,105 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 342 to 327. [2019-05-23 09:23:54,105 INFO L146 ILogger]: Start removeUnreachable. Operand 327 states. [2019-05-23 09:23:54,106 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-05-23 09:23:54,106 INFO L146 ILogger]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 316 [2019-05-23 09:23:54,107 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:54,107 INFO L146 ILogger]: Abstraction has 327 states and 328 transitions. [2019-05-23 09:23:54,107 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:23:54,107 INFO L146 ILogger]: Start isEmpty. Operand 327 states and 328 transitions. [2019-05-23 09:23:54,108 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 324 [2019-05-23 09:23:54,108 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:54,109 INFO L146 ILogger]: trace histogram [44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:54,109 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:54,109 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:54,109 INFO L146 ILogger]: Analyzing trace with hash -211022248, now seen corresponding path program 44 times [2019-05-23 09:23:54,110 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:54,169 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:54,173 INFO L146 ILogger]: Trace formula consists of 463 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:23:54,176 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:56,439 INFO L146 ILogger]: Checked inductivity of 6666 backedges. 0 proven. 6666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:56,439 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:56,440 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:23:56,440 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:23:56,441 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:23:56,441 INFO L146 ILogger]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:23:56,441 INFO L146 ILogger]: Start difference. First operand 327 states and 328 transitions. Second operand 91 states. [2019-05-23 09:24:00,528 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:00,528 INFO L146 ILogger]: Finished difference Result 349 states and 350 transitions. [2019-05-23 09:24:00,528 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 09:24:00,529 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 323 [2019-05-23 09:24:00,529 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:00,531 INFO L146 ILogger]: With dead ends: 349 [2019-05-23 09:24:00,531 INFO L146 ILogger]: Without dead ends: 349 [2019-05-23 09:24:00,532 INFO L146 ILogger]: 0 DeclaredPredicates, 410 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:24:00,533 INFO L146 ILogger]: Start minimizeSevpa. Operand 349 states. [2019-05-23 09:24:00,535 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 349 to 334. [2019-05-23 09:24:00,535 INFO L146 ILogger]: Start removeUnreachable. Operand 334 states. [2019-05-23 09:24:00,536 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2019-05-23 09:24:00,536 INFO L146 ILogger]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 323 [2019-05-23 09:24:00,536 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:00,536 INFO L146 ILogger]: Abstraction has 334 states and 335 transitions. [2019-05-23 09:24:00,536 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:24:00,536 INFO L146 ILogger]: Start isEmpty. Operand 334 states and 335 transitions. [2019-05-23 09:24:00,537 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 331 [2019-05-23 09:24:00,538 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:00,538 INFO L146 ILogger]: trace histogram [45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:00,538 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:00,538 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:00,538 INFO L146 ILogger]: Analyzing trace with hash 1137163398, now seen corresponding path program 45 times [2019-05-23 09:24:00,539 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:00,566 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:00,570 INFO L146 ILogger]: Trace formula consists of 473 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:24:00,574 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:03,226 INFO L146 ILogger]: Checked inductivity of 6975 backedges. 0 proven. 6975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:03,226 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:03,226 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:24:03,227 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:24:03,228 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:24:03,228 INFO L146 ILogger]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:03,228 INFO L146 ILogger]: Start difference. First operand 334 states and 335 transitions. Second operand 93 states. [2019-05-23 09:24:07,543 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:07,543 INFO L146 ILogger]: Finished difference Result 356 states and 357 transitions. [2019-05-23 09:24:07,544 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 09:24:07,544 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 330 [2019-05-23 09:24:07,544 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:07,545 INFO L146 ILogger]: With dead ends: 356 [2019-05-23 09:24:07,545 INFO L146 ILogger]: Without dead ends: 356 [2019-05-23 09:24:07,546 INFO L146 ILogger]: 0 DeclaredPredicates, 419 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 09:24:07,547 INFO L146 ILogger]: Start minimizeSevpa. Operand 356 states. [2019-05-23 09:24:07,549 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 356 to 341. [2019-05-23 09:24:07,549 INFO L146 ILogger]: Start removeUnreachable. Operand 341 states. [2019-05-23 09:24:07,550 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2019-05-23 09:24:07,550 INFO L146 ILogger]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 330 [2019-05-23 09:24:07,550 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:07,550 INFO L146 ILogger]: Abstraction has 341 states and 342 transitions. [2019-05-23 09:24:07,550 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:24:07,551 INFO L146 ILogger]: Start isEmpty. Operand 341 states and 342 transitions. [2019-05-23 09:24:07,552 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 338 [2019-05-23 09:24:07,552 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:07,552 INFO L146 ILogger]: trace histogram [46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:07,553 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:07,553 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:07,553 INFO L146 ILogger]: Analyzing trace with hash -1644011880, now seen corresponding path program 46 times [2019-05-23 09:24:07,554 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:07,580 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:07,585 INFO L146 ILogger]: Trace formula consists of 483 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:24:07,589 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:10,889 INFO L146 ILogger]: Checked inductivity of 7291 backedges. 0 proven. 7291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:10,889 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:10,889 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:24:10,890 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:24:10,890 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:24:10,891 INFO L146 ILogger]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:10,891 INFO L146 ILogger]: Start difference. First operand 341 states and 342 transitions. Second operand 95 states. [2019-05-23 09:24:15,767 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:15,767 INFO L146 ILogger]: Finished difference Result 363 states and 364 transitions. [2019-05-23 09:24:15,768 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 09:24:15,768 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 337 [2019-05-23 09:24:15,768 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:15,769 INFO L146 ILogger]: With dead ends: 363 [2019-05-23 09:24:15,770 INFO L146 ILogger]: Without dead ends: 363 [2019-05-23 09:24:15,771 INFO L146 ILogger]: 0 DeclaredPredicates, 428 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2019-05-23 09:24:15,771 INFO L146 ILogger]: Start minimizeSevpa. Operand 363 states. [2019-05-23 09:24:15,774 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 363 to 348. [2019-05-23 09:24:15,775 INFO L146 ILogger]: Start removeUnreachable. Operand 348 states. [2019-05-23 09:24:15,775 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2019-05-23 09:24:15,776 INFO L146 ILogger]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 337 [2019-05-23 09:24:15,776 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:15,776 INFO L146 ILogger]: Abstraction has 348 states and 349 transitions. [2019-05-23 09:24:15,776 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:24:15,776 INFO L146 ILogger]: Start isEmpty. Operand 348 states and 349 transitions. [2019-05-23 09:24:15,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 345 [2019-05-23 09:24:15,778 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:15,778 INFO L146 ILogger]: trace histogram [47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:15,778 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:15,779 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:15,779 INFO L146 ILogger]: Analyzing trace with hash -87907258, now seen corresponding path program 47 times [2019-05-23 09:24:15,779 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:15,805 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:15,810 INFO L146 ILogger]: Trace formula consists of 493 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:24:15,814 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:18,475 INFO L146 ILogger]: Checked inductivity of 7614 backedges. 0 proven. 7614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:18,475 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:18,475 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:24:18,476 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:24:18,476 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:24:18,477 INFO L146 ILogger]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:18,477 INFO L146 ILogger]: Start difference. First operand 348 states and 349 transitions. Second operand 97 states. [2019-05-23 09:24:23,228 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:23,228 INFO L146 ILogger]: Finished difference Result 370 states and 371 transitions. [2019-05-23 09:24:23,228 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 09:24:23,229 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 344 [2019-05-23 09:24:23,229 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:23,230 INFO L146 ILogger]: With dead ends: 370 [2019-05-23 09:24:23,230 INFO L146 ILogger]: Without dead ends: 370 [2019-05-23 09:24:23,231 INFO L146 ILogger]: 0 DeclaredPredicates, 437 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 09:24:23,232 INFO L146 ILogger]: Start minimizeSevpa. Operand 370 states. [2019-05-23 09:24:23,234 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 370 to 355. [2019-05-23 09:24:23,235 INFO L146 ILogger]: Start removeUnreachable. Operand 355 states. [2019-05-23 09:24:23,235 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2019-05-23 09:24:23,235 INFO L146 ILogger]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 344 [2019-05-23 09:24:23,236 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:23,236 INFO L146 ILogger]: Abstraction has 355 states and 356 transitions. [2019-05-23 09:24:23,236 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:24:23,236 INFO L146 ILogger]: Start isEmpty. Operand 355 states and 356 transitions. [2019-05-23 09:24:23,238 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 352 [2019-05-23 09:24:23,238 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:23,238 INFO L146 ILogger]: trace histogram [48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:23,238 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:23,238 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:23,239 INFO L146 ILogger]: Analyzing trace with hash 304561880, now seen corresponding path program 48 times [2019-05-23 09:24:23,239 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:23,267 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:23,272 INFO L146 ILogger]: Trace formula consists of 503 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:24:23,277 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:26,451 INFO L146 ILogger]: Checked inductivity of 7944 backedges. 0 proven. 7944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:26,451 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:26,451 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:24:26,452 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:24:26,452 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:24:26,452 INFO L146 ILogger]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:26,453 INFO L146 ILogger]: Start difference. First operand 355 states and 356 transitions. Second operand 99 states. [2019-05-23 09:24:31,163 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:31,163 INFO L146 ILogger]: Finished difference Result 377 states and 378 transitions. [2019-05-23 09:24:31,164 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 09:24:31,164 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 351 [2019-05-23 09:24:31,164 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:31,166 INFO L146 ILogger]: With dead ends: 377 [2019-05-23 09:24:31,166 INFO L146 ILogger]: Without dead ends: 377 [2019-05-23 09:24:31,167 INFO L146 ILogger]: 0 DeclaredPredicates, 446 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2019-05-23 09:24:31,168 INFO L146 ILogger]: Start minimizeSevpa. Operand 377 states. [2019-05-23 09:24:31,170 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 377 to 362. [2019-05-23 09:24:31,171 INFO L146 ILogger]: Start removeUnreachable. Operand 362 states. [2019-05-23 09:24:31,171 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2019-05-23 09:24:31,171 INFO L146 ILogger]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 351 [2019-05-23 09:24:31,171 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:31,172 INFO L146 ILogger]: Abstraction has 362 states and 363 transitions. [2019-05-23 09:24:31,172 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:24:31,172 INFO L146 ILogger]: Start isEmpty. Operand 362 states and 363 transitions. [2019-05-23 09:24:31,173 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 359 [2019-05-23 09:24:31,173 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:31,174 INFO L146 ILogger]: trace histogram [49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:31,174 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:31,174 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:31,174 INFO L146 ILogger]: Analyzing trace with hash 1437400070, now seen corresponding path program 49 times [2019-05-23 09:24:31,175 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:31,203 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:31,208 INFO L146 ILogger]: Trace formula consists of 513 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:24:31,212 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:34,903 INFO L146 ILogger]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:34,903 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:34,904 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:24:34,904 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:24:34,904 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:24:34,905 INFO L146 ILogger]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:24:34,905 INFO L146 ILogger]: Start difference. First operand 362 states and 363 transitions. Second operand 101 states. [2019-05-23 09:24:39,696 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:39,696 INFO L146 ILogger]: Finished difference Result 384 states and 385 transitions. [2019-05-23 09:24:39,696 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 09:24:39,697 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 358 [2019-05-23 09:24:39,697 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:39,699 INFO L146 ILogger]: With dead ends: 384 [2019-05-23 09:24:39,699 INFO L146 ILogger]: Without dead ends: 384 [2019-05-23 09:24:39,700 INFO L146 ILogger]: 0 DeclaredPredicates, 455 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2019-05-23 09:24:39,701 INFO L146 ILogger]: Start minimizeSevpa. Operand 384 states. [2019-05-23 09:24:39,703 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 384 to 369. [2019-05-23 09:24:39,703 INFO L146 ILogger]: Start removeUnreachable. Operand 369 states. [2019-05-23 09:24:39,704 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2019-05-23 09:24:39,704 INFO L146 ILogger]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 358 [2019-05-23 09:24:39,704 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:39,704 INFO L146 ILogger]: Abstraction has 369 states and 370 transitions. [2019-05-23 09:24:39,704 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:24:39,705 INFO L146 ILogger]: Start isEmpty. Operand 369 states and 370 transitions. [2019-05-23 09:24:39,706 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 366 [2019-05-23 09:24:39,706 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:39,707 INFO L146 ILogger]: trace histogram [50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:39,707 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:39,707 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:39,707 INFO L146 ILogger]: Analyzing trace with hash -350310632, now seen corresponding path program 50 times [2019-05-23 09:24:39,708 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:39,737 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:39,743 INFO L146 ILogger]: Trace formula consists of 523 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:24:39,748 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:42,747 INFO L146 ILogger]: Checked inductivity of 8625 backedges. 0 proven. 8625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:42,748 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:42,748 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:24:42,748 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:24:42,749 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:24:42,750 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:24:42,750 INFO L146 ILogger]: Start difference. First operand 369 states and 370 transitions. Second operand 103 states. [2019-05-23 09:24:47,855 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:47,856 INFO L146 ILogger]: Finished difference Result 391 states and 392 transitions. [2019-05-23 09:24:47,856 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 09:24:47,856 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 365 [2019-05-23 09:24:47,857 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:47,859 INFO L146 ILogger]: With dead ends: 391 [2019-05-23 09:24:47,859 INFO L146 ILogger]: Without dead ends: 391 [2019-05-23 09:24:47,860 INFO L146 ILogger]: 0 DeclaredPredicates, 464 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2019-05-23 09:24:47,861 INFO L146 ILogger]: Start minimizeSevpa. Operand 391 states. [2019-05-23 09:24:47,863 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 391 to 376. [2019-05-23 09:24:47,863 INFO L146 ILogger]: Start removeUnreachable. Operand 376 states. [2019-05-23 09:24:47,863 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-05-23 09:24:47,864 INFO L146 ILogger]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 365 [2019-05-23 09:24:47,864 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:47,864 INFO L146 ILogger]: Abstraction has 376 states and 377 transitions. [2019-05-23 09:24:47,864 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:24:47,864 INFO L146 ILogger]: Start isEmpty. Operand 376 states and 377 transitions. [2019-05-23 09:24:47,866 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 373 [2019-05-23 09:24:47,866 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:47,866 INFO L146 ILogger]: trace histogram [51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:47,866 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:47,866 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:47,866 INFO L146 ILogger]: Analyzing trace with hash 1153614790, now seen corresponding path program 51 times [2019-05-23 09:24:47,867 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:47,897 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:47,925 INFO L146 ILogger]: Trace formula consists of 533 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:24:47,929 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:51,077 INFO L146 ILogger]: Checked inductivity of 8976 backedges. 0 proven. 8976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:51,078 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:51,078 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:24:51,078 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:24:51,079 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:24:51,079 INFO L146 ILogger]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:24:51,079 INFO L146 ILogger]: Start difference. First operand 376 states and 377 transitions. Second operand 105 states. [2019-05-23 09:24:56,332 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:56,332 INFO L146 ILogger]: Finished difference Result 398 states and 399 transitions. [2019-05-23 09:24:56,333 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 09:24:56,333 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 372 [2019-05-23 09:24:56,333 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:56,335 INFO L146 ILogger]: With dead ends: 398 [2019-05-23 09:24:56,335 INFO L146 ILogger]: Without dead ends: 398 [2019-05-23 09:24:56,337 INFO L146 ILogger]: 0 DeclaredPredicates, 473 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2019-05-23 09:24:56,337 INFO L146 ILogger]: Start minimizeSevpa. Operand 398 states. [2019-05-23 09:24:56,339 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 398 to 383. [2019-05-23 09:24:56,339 INFO L146 ILogger]: Start removeUnreachable. Operand 383 states. [2019-05-23 09:24:56,340 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-05-23 09:24:56,340 INFO L146 ILogger]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 372 [2019-05-23 09:24:56,340 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:56,340 INFO L146 ILogger]: Abstraction has 383 states and 384 transitions. [2019-05-23 09:24:56,340 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:24:56,341 INFO L146 ILogger]: Start isEmpty. Operand 383 states and 384 transitions. [2019-05-23 09:24:56,342 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 380 [2019-05-23 09:24:56,342 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:56,342 INFO L146 ILogger]: trace histogram [52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:56,342 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:56,343 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:56,343 INFO L146 ILogger]: Analyzing trace with hash -1121145000, now seen corresponding path program 52 times [2019-05-23 09:24:56,343 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:56,371 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:56,376 INFO L146 ILogger]: Trace formula consists of 543 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:24:56,381 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:59,539 INFO L146 ILogger]: Checked inductivity of 9334 backedges. 0 proven. 9334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:59,539 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:59,540 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:24:59,540 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 09:24:59,541 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 09:24:59,541 INFO L146 ILogger]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:24:59,542 INFO L146 ILogger]: Start difference. First operand 383 states and 384 transitions. Second operand 107 states. [2019-05-23 09:25:05,368 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:05,368 INFO L146 ILogger]: Finished difference Result 405 states and 406 transitions. [2019-05-23 09:25:05,368 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 09:25:05,368 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 379 [2019-05-23 09:25:05,369 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:05,370 INFO L146 ILogger]: With dead ends: 405 [2019-05-23 09:25:05,370 INFO L146 ILogger]: Without dead ends: 405 [2019-05-23 09:25:05,371 INFO L146 ILogger]: 0 DeclaredPredicates, 482 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2019-05-23 09:25:05,372 INFO L146 ILogger]: Start minimizeSevpa. Operand 405 states. [2019-05-23 09:25:05,374 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 405 to 390. [2019-05-23 09:25:05,374 INFO L146 ILogger]: Start removeUnreachable. Operand 390 states. [2019-05-23 09:25:05,374 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2019-05-23 09:25:05,374 INFO L146 ILogger]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 379 [2019-05-23 09:25:05,375 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:05,375 INFO L146 ILogger]: Abstraction has 390 states and 391 transitions. [2019-05-23 09:25:05,375 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 09:25:05,375 INFO L146 ILogger]: Start isEmpty. Operand 390 states and 391 transitions. [2019-05-23 09:25:05,376 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 387 [2019-05-23 09:25:05,376 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:05,377 INFO L146 ILogger]: trace histogram [53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:05,377 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:05,377 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:05,377 INFO L146 ILogger]: Analyzing trace with hash -1623196794, now seen corresponding path program 53 times [2019-05-23 09:25:05,378 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:05,406 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:05,412 INFO L146 ILogger]: Trace formula consists of 553 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:25:05,416 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:08,665 INFO L146 ILogger]: Checked inductivity of 9699 backedges. 0 proven. 9699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:08,665 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:08,665 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:25:08,666 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 09:25:08,666 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 09:25:08,667 INFO L146 ILogger]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:25:08,667 INFO L146 ILogger]: Start difference. First operand 390 states and 391 transitions. Second operand 109 states. [2019-05-23 09:25:14,460 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:14,460 INFO L146 ILogger]: Finished difference Result 412 states and 413 transitions. [2019-05-23 09:25:14,460 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 09:25:14,461 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 386 [2019-05-23 09:25:14,461 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:14,463 INFO L146 ILogger]: With dead ends: 412 [2019-05-23 09:25:14,463 INFO L146 ILogger]: Without dead ends: 412 [2019-05-23 09:25:14,465 INFO L146 ILogger]: 0 DeclaredPredicates, 491 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2019-05-23 09:25:14,465 INFO L146 ILogger]: Start minimizeSevpa. Operand 412 states. [2019-05-23 09:25:14,467 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 412 to 397. [2019-05-23 09:25:14,467 INFO L146 ILogger]: Start removeUnreachable. Operand 397 states. [2019-05-23 09:25:14,468 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2019-05-23 09:25:14,468 INFO L146 ILogger]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 386 [2019-05-23 09:25:14,468 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:14,468 INFO L146 ILogger]: Abstraction has 397 states and 398 transitions. [2019-05-23 09:25:14,468 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 09:25:14,468 INFO L146 ILogger]: Start isEmpty. Operand 397 states and 398 transitions. [2019-05-23 09:25:14,469 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 394 [2019-05-23 09:25:14,470 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:14,470 INFO L146 ILogger]: trace histogram [54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:14,470 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:14,470 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:14,470 INFO L146 ILogger]: Analyzing trace with hash 1435844504, now seen corresponding path program 54 times [2019-05-23 09:25:14,471 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:14,497 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:14,503 INFO L146 ILogger]: Trace formula consists of 563 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:25:14,507 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:18,160 INFO L146 ILogger]: Checked inductivity of 10071 backedges. 0 proven. 10071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:18,160 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:18,160 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:25:18,160 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 09:25:18,161 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 09:25:18,161 INFO L146 ILogger]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:25:18,161 INFO L146 ILogger]: Start difference. First operand 397 states and 398 transitions. Second operand 111 states. [2019-05-23 09:25:24,138 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:24,139 INFO L146 ILogger]: Finished difference Result 419 states and 420 transitions. [2019-05-23 09:25:24,139 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 09:25:24,139 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 393 [2019-05-23 09:25:24,140 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:24,141 INFO L146 ILogger]: With dead ends: 419 [2019-05-23 09:25:24,141 INFO L146 ILogger]: Without dead ends: 419 [2019-05-23 09:25:24,143 INFO L146 ILogger]: 0 DeclaredPredicates, 500 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2019-05-23 09:25:24,143 INFO L146 ILogger]: Start minimizeSevpa. Operand 419 states. [2019-05-23 09:25:24,145 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 419 to 404. [2019-05-23 09:25:24,145 INFO L146 ILogger]: Start removeUnreachable. Operand 404 states. [2019-05-23 09:25:24,146 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 404 states to 404 states and 405 transitions. [2019-05-23 09:25:24,146 INFO L146 ILogger]: Start accepts. Automaton has 404 states and 405 transitions. Word has length 393 [2019-05-23 09:25:24,146 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:24,146 INFO L146 ILogger]: Abstraction has 404 states and 405 transitions. [2019-05-23 09:25:24,146 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 09:25:24,146 INFO L146 ILogger]: Start isEmpty. Operand 404 states and 405 transitions. [2019-05-23 09:25:24,148 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 401 [2019-05-23 09:25:24,148 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:24,148 INFO L146 ILogger]: trace histogram [55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:24,148 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:24,148 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:24,148 INFO L146 ILogger]: Analyzing trace with hash -480206010, now seen corresponding path program 55 times [2019-05-23 09:25:24,149 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:24,175 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:24,180 INFO L146 ILogger]: Trace formula consists of 573 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:25:24,184 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:27,818 INFO L146 ILogger]: Checked inductivity of 10450 backedges. 0 proven. 10450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:27,818 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:27,818 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:25:27,819 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 09:25:27,819 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 09:25:27,820 INFO L146 ILogger]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:25:27,820 INFO L146 ILogger]: Start difference. First operand 404 states and 405 transitions. Second operand 113 states. [2019-05-23 09:25:33,930 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:33,930 INFO L146 ILogger]: Finished difference Result 426 states and 427 transitions. [2019-05-23 09:25:33,931 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 09:25:33,931 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 400 [2019-05-23 09:25:33,931 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:33,933 INFO L146 ILogger]: With dead ends: 426 [2019-05-23 09:25:33,933 INFO L146 ILogger]: Without dead ends: 426 [2019-05-23 09:25:33,935 INFO L146 ILogger]: 0 DeclaredPredicates, 509 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2019-05-23 09:25:33,935 INFO L146 ILogger]: Start minimizeSevpa. Operand 426 states. [2019-05-23 09:25:33,937 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 426 to 411. [2019-05-23 09:25:33,938 INFO L146 ILogger]: Start removeUnreachable. Operand 411 states. [2019-05-23 09:25:33,938 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2019-05-23 09:25:33,938 INFO L146 ILogger]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 400 [2019-05-23 09:25:33,938 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:33,938 INFO L146 ILogger]: Abstraction has 411 states and 412 transitions. [2019-05-23 09:25:33,938 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 09:25:33,939 INFO L146 ILogger]: Start isEmpty. Operand 411 states and 412 transitions. [2019-05-23 09:25:33,940 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 408 [2019-05-23 09:25:33,940 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:33,940 INFO L146 ILogger]: trace histogram [56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:33,940 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:33,940 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:33,941 INFO L146 ILogger]: Analyzing trace with hash -90415144, now seen corresponding path program 56 times [2019-05-23 09:25:33,941 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:33,969 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:33,975 INFO L146 ILogger]: Trace formula consists of 583 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:25:33,980 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:38,112 INFO L146 ILogger]: Checked inductivity of 10836 backedges. 0 proven. 10836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:38,113 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:38,113 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:25:38,113 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 09:25:38,114 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 09:25:38,114 INFO L146 ILogger]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:25:38,114 INFO L146 ILogger]: Start difference. First operand 411 states and 412 transitions. Second operand 115 states. [2019-05-23 09:25:44,580 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:44,580 INFO L146 ILogger]: Finished difference Result 433 states and 434 transitions. [2019-05-23 09:25:44,580 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 09:25:44,581 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 407 [2019-05-23 09:25:44,581 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:44,583 INFO L146 ILogger]: With dead ends: 433 [2019-05-23 09:25:44,583 INFO L146 ILogger]: Without dead ends: 433 [2019-05-23 09:25:44,586 INFO L146 ILogger]: 0 DeclaredPredicates, 518 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2019-05-23 09:25:44,586 INFO L146 ILogger]: Start minimizeSevpa. Operand 433 states. [2019-05-23 09:25:44,588 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 433 to 418. [2019-05-23 09:25:44,588 INFO L146 ILogger]: Start removeUnreachable. Operand 418 states. [2019-05-23 09:25:44,589 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 418 states to 418 states and 419 transitions. [2019-05-23 09:25:44,589 INFO L146 ILogger]: Start accepts. Automaton has 418 states and 419 transitions. Word has length 407 [2019-05-23 09:25:44,589 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:44,589 INFO L146 ILogger]: Abstraction has 418 states and 419 transitions. [2019-05-23 09:25:44,589 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 09:25:44,589 INFO L146 ILogger]: Start isEmpty. Operand 418 states and 419 transitions. [2019-05-23 09:25:44,591 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 415 [2019-05-23 09:25:44,591 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:44,591 INFO L146 ILogger]: trace histogram [57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:44,591 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:44,591 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:44,591 INFO L146 ILogger]: Analyzing trace with hash -161432826, now seen corresponding path program 57 times [2019-05-23 09:25:44,592 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:44,619 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:44,625 INFO L146 ILogger]: Trace formula consists of 593 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:25:44,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:48,696 INFO L146 ILogger]: Checked inductivity of 11229 backedges. 0 proven. 11229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:48,696 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:48,696 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:25:48,697 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 09:25:48,697 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 09:25:48,698 INFO L146 ILogger]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:25:48,698 INFO L146 ILogger]: Start difference. First operand 418 states and 419 transitions. Second operand 117 states. [2019-05-23 09:25:55,163 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:55,163 INFO L146 ILogger]: Finished difference Result 440 states and 441 transitions. [2019-05-23 09:25:55,163 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 09:25:55,164 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 414 [2019-05-23 09:25:55,164 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:55,165 INFO L146 ILogger]: With dead ends: 440 [2019-05-23 09:25:55,165 INFO L146 ILogger]: Without dead ends: 440 [2019-05-23 09:25:55,167 INFO L146 ILogger]: 0 DeclaredPredicates, 527 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2019-05-23 09:25:55,168 INFO L146 ILogger]: Start minimizeSevpa. Operand 440 states. [2019-05-23 09:25:55,170 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 440 to 425. [2019-05-23 09:25:55,170 INFO L146 ILogger]: Start removeUnreachable. Operand 425 states. [2019-05-23 09:25:55,171 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2019-05-23 09:25:55,171 INFO L146 ILogger]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 414 [2019-05-23 09:25:55,171 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:55,171 INFO L146 ILogger]: Abstraction has 425 states and 426 transitions. [2019-05-23 09:25:55,171 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 09:25:55,171 INFO L146 ILogger]: Start isEmpty. Operand 425 states and 426 transitions. [2019-05-23 09:25:55,172 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 422 [2019-05-23 09:25:55,173 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:55,173 INFO L146 ILogger]: trace histogram [58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:55,173 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:55,173 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:55,173 INFO L146 ILogger]: Analyzing trace with hash -1417277416, now seen corresponding path program 58 times [2019-05-23 09:25:55,174 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:55,202 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:55,208 INFO L146 ILogger]: Trace formula consists of 603 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:25:55,212 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:59,242 INFO L146 ILogger]: Checked inductivity of 11629 backedges. 0 proven. 11629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:59,242 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:59,243 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:25:59,243 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 09:25:59,244 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 09:25:59,244 INFO L146 ILogger]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:25:59,244 INFO L146 ILogger]: Start difference. First operand 425 states and 426 transitions. Second operand 119 states. [2019-05-23 09:26:05,956 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:05,956 INFO L146 ILogger]: Finished difference Result 447 states and 448 transitions. [2019-05-23 09:26:05,956 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-05-23 09:26:05,957 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 421 [2019-05-23 09:26:05,957 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:05,959 INFO L146 ILogger]: With dead ends: 447 [2019-05-23 09:26:05,960 INFO L146 ILogger]: Without dead ends: 447 [2019-05-23 09:26:05,963 INFO L146 ILogger]: 0 DeclaredPredicates, 536 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2019-05-23 09:26:05,963 INFO L146 ILogger]: Start minimizeSevpa. Operand 447 states. [2019-05-23 09:26:05,965 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 447 to 432. [2019-05-23 09:26:05,965 INFO L146 ILogger]: Start removeUnreachable. Operand 432 states. [2019-05-23 09:26:05,966 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-05-23 09:26:05,966 INFO L146 ILogger]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 421 [2019-05-23 09:26:05,966 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:05,966 INFO L146 ILogger]: Abstraction has 432 states and 433 transitions. [2019-05-23 09:26:05,966 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 09:26:05,966 INFO L146 ILogger]: Start isEmpty. Operand 432 states and 433 transitions. [2019-05-23 09:26:05,968 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 429 [2019-05-23 09:26:05,968 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:05,968 INFO L146 ILogger]: trace histogram [59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:05,968 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:05,968 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:05,969 INFO L146 ILogger]: Analyzing trace with hash -461618490, now seen corresponding path program 59 times [2019-05-23 09:26:05,969 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:05,996 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:06,003 INFO L146 ILogger]: Trace formula consists of 613 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:26:06,009 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:10,237 INFO L146 ILogger]: Checked inductivity of 12036 backedges. 0 proven. 12036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:10,238 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:10,238 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:26:10,238 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 09:26:10,239 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 09:26:10,239 INFO L146 ILogger]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:26:10,239 INFO L146 ILogger]: Start difference. First operand 432 states and 433 transitions. Second operand 121 states. [2019-05-23 09:26:17,430 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:17,431 INFO L146 ILogger]: Finished difference Result 454 states and 455 transitions. [2019-05-23 09:26:17,431 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-05-23 09:26:17,431 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 428 [2019-05-23 09:26:17,432 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:17,433 INFO L146 ILogger]: With dead ends: 454 [2019-05-23 09:26:17,433 INFO L146 ILogger]: Without dead ends: 454 [2019-05-23 09:26:17,435 INFO L146 ILogger]: 0 DeclaredPredicates, 545 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2019-05-23 09:26:17,435 INFO L146 ILogger]: Start minimizeSevpa. Operand 454 states. [2019-05-23 09:26:17,437 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 454 to 439. [2019-05-23 09:26:17,437 INFO L146 ILogger]: Start removeUnreachable. Operand 439 states. [2019-05-23 09:26:17,438 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-05-23 09:26:17,438 INFO L146 ILogger]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 428 [2019-05-23 09:26:17,438 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:17,438 INFO L146 ILogger]: Abstraction has 439 states and 440 transitions. [2019-05-23 09:26:17,438 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 09:26:17,438 INFO L146 ILogger]: Start isEmpty. Operand 439 states and 440 transitions. [2019-05-23 09:26:17,440 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 436 [2019-05-23 09:26:17,440 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:17,440 INFO L146 ILogger]: trace histogram [60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:17,440 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:17,440 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:17,441 INFO L146 ILogger]: Analyzing trace with hash 1620463704, now seen corresponding path program 60 times [2019-05-23 09:26:17,441 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:17,471 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:17,477 INFO L146 ILogger]: Trace formula consists of 623 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:26:17,481 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:21,536 INFO L146 ILogger]: Checked inductivity of 12450 backedges. 0 proven. 12450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:21,536 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:21,536 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 09:26:21,537 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 09:26:21,537 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 09:26:21,538 INFO L146 ILogger]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:26:21,538 INFO L146 ILogger]: Start difference. First operand 439 states and 440 transitions. Second operand 123 states. [2019-05-23 09:26:28,899 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:28,900 INFO L146 ILogger]: Finished difference Result 461 states and 462 transitions. [2019-05-23 09:26:28,900 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-05-23 09:26:28,900 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 435 [2019-05-23 09:26:28,901 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:28,902 INFO L146 ILogger]: With dead ends: 461 [2019-05-23 09:26:28,902 INFO L146 ILogger]: Without dead ends: 461 [2019-05-23 09:26:28,904 INFO L146 ILogger]: 0 DeclaredPredicates, 554 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2019-05-23 09:26:28,904 INFO L146 ILogger]: Start minimizeSevpa. Operand 461 states. [2019-05-23 09:26:28,907 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 461 to 446. [2019-05-23 09:26:28,907 INFO L146 ILogger]: Start removeUnreachable. Operand 446 states. [2019-05-23 09:26:28,907 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2019-05-23 09:26:28,907 INFO L146 ILogger]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 435 [2019-05-23 09:26:28,908 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:28,908 INFO L146 ILogger]: Abstraction has 446 states and 447 transitions. [2019-05-23 09:26:28,908 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 09:26:28,908 INFO L146 ILogger]: Start isEmpty. Operand 446 states and 447 transitions. [2019-05-23 09:26:28,909 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 443 [2019-05-23 09:26:28,909 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:28,910 INFO L146 ILogger]: trace histogram [61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:28,910 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:28,910 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:28,910 INFO L146 ILogger]: Analyzing trace with hash -1594934650, now seen corresponding path program 61 times [2019-05-23 09:26:28,911 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:28,937 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:28,943 INFO L146 ILogger]: Trace formula consists of 633 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 09:26:28,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:33,275 INFO L146 ILogger]: Checked inductivity of 12871 backedges. 0 proven. 12871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:33,275 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:33,276 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 09:26:33,276 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 09:26:33,277 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 09:26:33,277 INFO L146 ILogger]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:26:33,277 INFO L146 ILogger]: Start difference. First operand 446 states and 447 transitions. Second operand 125 states. [2019-05-23 09:26:40,326 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:40,326 INFO L146 ILogger]: Finished difference Result 468 states and 469 transitions. [2019-05-23 09:26:40,327 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-05-23 09:26:40,327 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 442 [2019-05-23 09:26:40,327 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:40,328 INFO L146 ILogger]: With dead ends: 468 [2019-05-23 09:26:40,329 INFO L146 ILogger]: Without dead ends: 468 [2019-05-23 09:26:40,331 INFO L146 ILogger]: 0 DeclaredPredicates, 563 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2019-05-23 09:26:40,332 INFO L146 ILogger]: Start minimizeSevpa. Operand 468 states. [2019-05-23 09:26:40,334 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 468 to 453. [2019-05-23 09:26:40,334 INFO L146 ILogger]: Start removeUnreachable. Operand 453 states. [2019-05-23 09:26:40,335 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 453 states to 453 states and 454 transitions. [2019-05-23 09:26:40,335 INFO L146 ILogger]: Start accepts. Automaton has 453 states and 454 transitions. Word has length 442 [2019-05-23 09:26:40,335 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:40,335 INFO L146 ILogger]: Abstraction has 453 states and 454 transitions. [2019-05-23 09:26:40,335 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 09:26:40,335 INFO L146 ILogger]: Start isEmpty. Operand 453 states and 454 transitions. [2019-05-23 09:26:40,337 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 450 [2019-05-23 09:26:40,337 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:40,337 INFO L146 ILogger]: trace histogram [62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:40,337 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:40,337 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:40,337 INFO L146 ILogger]: Analyzing trace with hash 1259413656, now seen corresponding path program 62 times [2019-05-23 09:26:40,338 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:40,359 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:40,363 INFO L146 ILogger]: Trace formula consists of 643 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:26:40,366 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:44,795 INFO L146 ILogger]: Checked inductivity of 13299 backedges. 0 proven. 13299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:44,795 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:44,795 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 09:26:44,796 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 09:26:44,797 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 09:26:44,797 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:26:44,797 INFO L146 ILogger]: Start difference. First operand 453 states and 454 transitions. Second operand 127 states. [2019-05-23 09:26:52,602 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:52,603 INFO L146 ILogger]: Finished difference Result 475 states and 476 transitions. [2019-05-23 09:26:52,603 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-05-23 09:26:52,603 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 449 [2019-05-23 09:26:52,603 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:52,605 INFO L146 ILogger]: With dead ends: 475 [2019-05-23 09:26:52,605 INFO L146 ILogger]: Without dead ends: 475 [2019-05-23 09:26:52,607 INFO L146 ILogger]: 0 DeclaredPredicates, 572 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2019-05-23 09:26:52,607 INFO L146 ILogger]: Start minimizeSevpa. Operand 475 states. [2019-05-23 09:26:52,610 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 475 to 460. [2019-05-23 09:26:52,611 INFO L146 ILogger]: Start removeUnreachable. Operand 460 states. [2019-05-23 09:26:52,611 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2019-05-23 09:26:52,611 INFO L146 ILogger]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 449 [2019-05-23 09:26:52,612 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:52,612 INFO L146 ILogger]: Abstraction has 460 states and 461 transitions. [2019-05-23 09:26:52,612 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 09:26:52,612 INFO L146 ILogger]: Start isEmpty. Operand 460 states and 461 transitions. [2019-05-23 09:26:52,614 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 457 [2019-05-23 09:26:52,614 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:52,614 INFO L146 ILogger]: trace histogram [63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:52,614 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:52,614 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:52,615 INFO L146 ILogger]: Analyzing trace with hash -973757882, now seen corresponding path program 63 times [2019-05-23 09:26:52,615 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:52,646 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:52,652 INFO L146 ILogger]: Trace formula consists of 653 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 09:26:52,657 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:57,136 INFO L146 ILogger]: Checked inductivity of 13734 backedges. 0 proven. 13734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:57,136 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:57,136 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 09:26:57,137 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 09:26:57,138 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 09:26:57,138 INFO L146 ILogger]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:26:57,138 INFO L146 ILogger]: Start difference. First operand 460 states and 461 transitions. Second operand 129 states. [2019-05-23 09:27:04,997 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:04,998 INFO L146 ILogger]: Finished difference Result 482 states and 483 transitions. [2019-05-23 09:27:04,998 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-05-23 09:27:04,998 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 456 [2019-05-23 09:27:04,999 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:05,001 INFO L146 ILogger]: With dead ends: 482 [2019-05-23 09:27:05,001 INFO L146 ILogger]: Without dead ends: 482 [2019-05-23 09:27:05,003 INFO L146 ILogger]: 0 DeclaredPredicates, 581 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2019-05-23 09:27:05,004 INFO L146 ILogger]: Start minimizeSevpa. Operand 482 states. [2019-05-23 09:27:05,006 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 482 to 467. [2019-05-23 09:27:05,007 INFO L146 ILogger]: Start removeUnreachable. Operand 467 states. [2019-05-23 09:27:05,007 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2019-05-23 09:27:05,007 INFO L146 ILogger]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 456 [2019-05-23 09:27:05,008 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:05,008 INFO L146 ILogger]: Abstraction has 467 states and 468 transitions. [2019-05-23 09:27:05,008 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 09:27:05,008 INFO L146 ILogger]: Start isEmpty. Operand 467 states and 468 transitions. [2019-05-23 09:27:05,010 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 464 [2019-05-23 09:27:05,010 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:05,010 INFO L146 ILogger]: trace histogram [64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:05,010 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:05,011 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:05,011 INFO L146 ILogger]: Analyzing trace with hash 356155608, now seen corresponding path program 64 times [2019-05-23 09:27:05,011 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:05,038 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:05,045 INFO L146 ILogger]: Trace formula consists of 663 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:27:05,049 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:09,774 INFO L146 ILogger]: Checked inductivity of 14176 backedges. 0 proven. 14176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:09,774 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:09,774 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 09:27:09,775 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 09:27:09,775 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 09:27:09,776 INFO L146 ILogger]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:27:09,776 INFO L146 ILogger]: Start difference. First operand 467 states and 468 transitions. Second operand 131 states. [2019-05-23 09:27:17,617 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:17,617 INFO L146 ILogger]: Finished difference Result 489 states and 490 transitions. [2019-05-23 09:27:17,618 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-05-23 09:27:17,618 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 463 [2019-05-23 09:27:17,618 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:17,620 INFO L146 ILogger]: With dead ends: 489 [2019-05-23 09:27:17,620 INFO L146 ILogger]: Without dead ends: 489 [2019-05-23 09:27:17,622 INFO L146 ILogger]: 0 DeclaredPredicates, 590 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2019-05-23 09:27:17,622 INFO L146 ILogger]: Start minimizeSevpa. Operand 489 states. [2019-05-23 09:27:17,625 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 489 to 474. [2019-05-23 09:27:17,625 INFO L146 ILogger]: Start removeUnreachable. Operand 474 states. [2019-05-23 09:27:17,625 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2019-05-23 09:27:17,626 INFO L146 ILogger]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 463 [2019-05-23 09:27:17,626 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:17,626 INFO L146 ILogger]: Abstraction has 474 states and 475 transitions. [2019-05-23 09:27:17,626 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 09:27:17,626 INFO L146 ILogger]: Start isEmpty. Operand 474 states and 475 transitions. [2019-05-23 09:27:17,628 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 471 [2019-05-23 09:27:17,628 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:17,628 INFO L146 ILogger]: trace histogram [65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:17,628 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:17,628 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:17,628 INFO L146 ILogger]: Analyzing trace with hash 1422621190, now seen corresponding path program 65 times [2019-05-23 09:27:17,629 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:17,660 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:17,668 INFO L146 ILogger]: Trace formula consists of 673 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:27:17,674 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:22,729 INFO L146 ILogger]: Checked inductivity of 14625 backedges. 0 proven. 14625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:22,730 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:22,730 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 09:27:22,730 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 09:27:22,731 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 09:27:22,731 INFO L146 ILogger]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:27:22,731 INFO L146 ILogger]: Start difference. First operand 474 states and 475 transitions. Second operand 133 states. [2019-05-23 09:27:31,100 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:31,100 INFO L146 ILogger]: Finished difference Result 496 states and 497 transitions. [2019-05-23 09:27:31,101 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2019-05-23 09:27:31,101 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 470 [2019-05-23 09:27:31,101 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:31,103 INFO L146 ILogger]: With dead ends: 496 [2019-05-23 09:27:31,103 INFO L146 ILogger]: Without dead ends: 496 [2019-05-23 09:27:31,105 INFO L146 ILogger]: 0 DeclaredPredicates, 599 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2019-05-23 09:27:31,106 INFO L146 ILogger]: Start minimizeSevpa. Operand 496 states. [2019-05-23 09:27:31,108 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 496 to 481. [2019-05-23 09:27:31,108 INFO L146 ILogger]: Start removeUnreachable. Operand 481 states. [2019-05-23 09:27:31,109 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2019-05-23 09:27:31,109 INFO L146 ILogger]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 470 [2019-05-23 09:27:31,109 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:31,109 INFO L146 ILogger]: Abstraction has 481 states and 482 transitions. [2019-05-23 09:27:31,109 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 09:27:31,110 INFO L146 ILogger]: Start isEmpty. Operand 481 states and 482 transitions. [2019-05-23 09:27:31,111 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 478 [2019-05-23 09:27:31,111 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:31,111 INFO L146 ILogger]: trace histogram [66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:31,112 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:31,112 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:31,112 INFO L146 ILogger]: Analyzing trace with hash 576090392, now seen corresponding path program 66 times [2019-05-23 09:27:31,112 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:31,141 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:31,148 INFO L146 ILogger]: Trace formula consists of 683 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:27:31,153 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:36,141 INFO L146 ILogger]: Checked inductivity of 15081 backedges. 0 proven. 15081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:36,142 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:36,142 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 09:27:36,142 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 09:27:36,143 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 09:27:36,144 INFO L146 ILogger]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:27:36,144 INFO L146 ILogger]: Start difference. First operand 481 states and 482 transitions. Second operand 135 states. [2019-05-23 09:27:44,553 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:44,553 INFO L146 ILogger]: Finished difference Result 503 states and 504 transitions. [2019-05-23 09:27:44,553 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-05-23 09:27:44,554 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 477 [2019-05-23 09:27:44,554 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:44,556 INFO L146 ILogger]: With dead ends: 503 [2019-05-23 09:27:44,556 INFO L146 ILogger]: Without dead ends: 503 [2019-05-23 09:27:44,560 INFO L146 ILogger]: 0 DeclaredPredicates, 608 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2019-05-23 09:27:44,560 INFO L146 ILogger]: Start minimizeSevpa. Operand 503 states. [2019-05-23 09:27:44,563 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 503 to 488. [2019-05-23 09:27:44,563 INFO L146 ILogger]: Start removeUnreachable. Operand 488 states. [2019-05-23 09:27:44,563 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-05-23 09:27:44,563 INFO L146 ILogger]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 477 [2019-05-23 09:27:44,564 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:44,564 INFO L146 ILogger]: Abstraction has 488 states and 489 transitions. [2019-05-23 09:27:44,564 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 09:27:44,564 INFO L146 ILogger]: Start isEmpty. Operand 488 states and 489 transitions. [2019-05-23 09:27:44,566 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 485 [2019-05-23 09:27:44,566 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:44,566 INFO L146 ILogger]: trace histogram [67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:44,566 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:44,566 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:44,566 INFO L146 ILogger]: Analyzing trace with hash 1974256070, now seen corresponding path program 67 times [2019-05-23 09:27:44,567 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:44,589 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:44,594 INFO L146 ILogger]: Trace formula consists of 693 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 09:27:44,598 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:49,737 INFO L146 ILogger]: Checked inductivity of 15544 backedges. 0 proven. 15544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:49,737 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:49,737 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 09:27:49,738 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 09:27:49,738 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 09:27:49,739 INFO L146 ILogger]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:27:49,739 INFO L146 ILogger]: Start difference. First operand 488 states and 489 transitions. Second operand 137 states. [2019-05-23 09:27:58,494 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:58,494 INFO L146 ILogger]: Finished difference Result 510 states and 511 transitions. [2019-05-23 09:27:58,495 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-05-23 09:27:58,495 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 484 [2019-05-23 09:27:58,495 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:58,497 INFO L146 ILogger]: With dead ends: 510 [2019-05-23 09:27:58,497 INFO L146 ILogger]: Without dead ends: 510 [2019-05-23 09:27:58,498 INFO L146 ILogger]: 0 DeclaredPredicates, 617 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2019-05-23 09:27:58,498 INFO L146 ILogger]: Start minimizeSevpa. Operand 510 states. [2019-05-23 09:27:58,501 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 510 to 495. [2019-05-23 09:27:58,501 INFO L146 ILogger]: Start removeUnreachable. Operand 495 states. [2019-05-23 09:27:58,502 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-05-23 09:27:58,502 INFO L146 ILogger]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 484 [2019-05-23 09:27:58,502 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:58,502 INFO L146 ILogger]: Abstraction has 495 states and 496 transitions. [2019-05-23 09:27:58,502 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 09:27:58,502 INFO L146 ILogger]: Start isEmpty. Operand 495 states and 496 transitions. [2019-05-23 09:27:58,504 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 492 [2019-05-23 09:27:58,504 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:58,504 INFO L146 ILogger]: trace histogram [68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:58,504 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:58,504 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:58,505 INFO L146 ILogger]: Analyzing trace with hash -827788968, now seen corresponding path program 68 times [2019-05-23 09:27:58,505 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:58,534 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:58,540 INFO L146 ILogger]: Trace formula consists of 703 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:27:58,543 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:03,650 INFO L146 ILogger]: Checked inductivity of 16014 backedges. 0 proven. 16014 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:03,650 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:03,650 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 09:28:03,651 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 09:28:03,651 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 09:28:03,652 INFO L146 ILogger]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:28:03,652 INFO L146 ILogger]: Start difference. First operand 495 states and 496 transitions. Second operand 139 states. [2019-05-23 09:28:12,710 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:12,710 INFO L146 ILogger]: Finished difference Result 517 states and 518 transitions. [2019-05-23 09:28:12,710 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2019-05-23 09:28:12,711 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 491 [2019-05-23 09:28:12,711 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:12,712 INFO L146 ILogger]: With dead ends: 517 [2019-05-23 09:28:12,712 INFO L146 ILogger]: Without dead ends: 517 [2019-05-23 09:28:12,714 INFO L146 ILogger]: 0 DeclaredPredicates, 626 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2019-05-23 09:28:12,714 INFO L146 ILogger]: Start minimizeSevpa. Operand 517 states. [2019-05-23 09:28:12,717 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 517 to 502. [2019-05-23 09:28:12,717 INFO L146 ILogger]: Start removeUnreachable. Operand 502 states. [2019-05-23 09:28:12,718 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2019-05-23 09:28:12,718 INFO L146 ILogger]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 491 [2019-05-23 09:28:12,718 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:12,718 INFO L146 ILogger]: Abstraction has 502 states and 503 transitions. [2019-05-23 09:28:12,718 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 09:28:12,718 INFO L146 ILogger]: Start isEmpty. Operand 502 states and 503 transitions. [2019-05-23 09:28:12,720 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 499 [2019-05-23 09:28:12,720 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:12,720 INFO L146 ILogger]: trace histogram [69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:12,720 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:12,721 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:12,721 INFO L146 ILogger]: Analyzing trace with hash 936737158, now seen corresponding path program 69 times [2019-05-23 09:28:12,721 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:12,743 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:12,748 INFO L146 ILogger]: Trace formula consists of 713 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 09:28:12,751 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:18,186 INFO L146 ILogger]: Checked inductivity of 16491 backedges. 0 proven. 16491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:18,186 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:18,186 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 09:28:18,187 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 09:28:18,187 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 09:28:18,188 INFO L146 ILogger]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:28:18,188 INFO L146 ILogger]: Start difference. First operand 502 states and 503 transitions. Second operand 141 states. [2019-05-23 09:28:27,553 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:27,553 INFO L146 ILogger]: Finished difference Result 524 states and 525 transitions. [2019-05-23 09:28:27,554 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-05-23 09:28:27,554 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 498 [2019-05-23 09:28:27,554 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:27,557 INFO L146 ILogger]: With dead ends: 524 [2019-05-23 09:28:27,557 INFO L146 ILogger]: Without dead ends: 524 [2019-05-23 09:28:27,559 INFO L146 ILogger]: 0 DeclaredPredicates, 635 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2019-05-23 09:28:27,560 INFO L146 ILogger]: Start minimizeSevpa. Operand 524 states. [2019-05-23 09:28:27,562 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 524 to 509. [2019-05-23 09:28:27,562 INFO L146 ILogger]: Start removeUnreachable. Operand 509 states. [2019-05-23 09:28:27,563 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 509 states to 509 states and 510 transitions. [2019-05-23 09:28:27,563 INFO L146 ILogger]: Start accepts. Automaton has 509 states and 510 transitions. Word has length 498 [2019-05-23 09:28:27,563 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:27,563 INFO L146 ILogger]: Abstraction has 509 states and 510 transitions. [2019-05-23 09:28:27,563 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 09:28:27,563 INFO L146 ILogger]: Start isEmpty. Operand 509 states and 510 transitions. [2019-05-23 09:28:27,565 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 506 [2019-05-23 09:28:27,565 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:27,566 INFO L146 ILogger]: trace histogram [70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:27,566 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:27,566 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:27,566 INFO L146 ILogger]: Analyzing trace with hash -1351220840, now seen corresponding path program 70 times [2019-05-23 09:28:27,566 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:27,597 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:27,605 INFO L146 ILogger]: Trace formula consists of 723 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:28:27,609 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:33,063 INFO L146 ILogger]: Checked inductivity of 16975 backedges. 0 proven. 16975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:33,064 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:33,064 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 09:28:33,064 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 09:28:33,065 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 09:28:33,065 INFO L146 ILogger]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:28:33,066 INFO L146 ILogger]: Start difference. First operand 509 states and 510 transitions. Second operand 143 states. [2019-05-23 09:28:42,608 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:42,608 INFO L146 ILogger]: Finished difference Result 531 states and 532 transitions. [2019-05-23 09:28:42,608 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-05-23 09:28:42,609 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 505 [2019-05-23 09:28:42,609 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:42,611 INFO L146 ILogger]: With dead ends: 531 [2019-05-23 09:28:42,611 INFO L146 ILogger]: Without dead ends: 531 [2019-05-23 09:28:42,614 INFO L146 ILogger]: 0 DeclaredPredicates, 644 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2019-05-23 09:28:42,614 INFO L146 ILogger]: Start minimizeSevpa. Operand 531 states. [2019-05-23 09:28:42,617 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 531 to 516. [2019-05-23 09:28:42,617 INFO L146 ILogger]: Start removeUnreachable. Operand 516 states. [2019-05-23 09:28:42,617 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 516 states to 516 states and 517 transitions. [2019-05-23 09:28:42,618 INFO L146 ILogger]: Start accepts. Automaton has 516 states and 517 transitions. Word has length 505 [2019-05-23 09:28:42,618 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:42,618 INFO L146 ILogger]: Abstraction has 516 states and 517 transitions. [2019-05-23 09:28:42,618 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 09:28:42,618 INFO L146 ILogger]: Start isEmpty. Operand 516 states and 517 transitions. [2019-05-23 09:28:42,620 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 513 [2019-05-23 09:28:42,620 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:42,620 INFO L146 ILogger]: trace histogram [71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:42,620 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:42,620 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:42,621 INFO L146 ILogger]: Analyzing trace with hash 1367449926, now seen corresponding path program 71 times [2019-05-23 09:28:42,621 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:42,656 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:42,663 INFO L146 ILogger]: Trace formula consists of 733 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:28:42,667 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:48,452 INFO L146 ILogger]: Checked inductivity of 17466 backedges. 0 proven. 17466 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:48,453 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:48,453 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 09:28:48,453 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 09:28:48,454 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 09:28:48,455 INFO L146 ILogger]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:28:48,455 INFO L146 ILogger]: Start difference. First operand 516 states and 517 transitions. Second operand 145 states. [2019-05-23 09:28:58,233 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:58,233 INFO L146 ILogger]: Finished difference Result 538 states and 539 transitions. [2019-05-23 09:28:58,234 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-05-23 09:28:58,234 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 512 [2019-05-23 09:28:58,234 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:58,236 INFO L146 ILogger]: With dead ends: 538 [2019-05-23 09:28:58,236 INFO L146 ILogger]: Without dead ends: 538 [2019-05-23 09:28:58,238 INFO L146 ILogger]: 0 DeclaredPredicates, 653 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2019-05-23 09:28:58,239 INFO L146 ILogger]: Start minimizeSevpa. Operand 538 states. [2019-05-23 09:28:58,241 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 538 to 523. [2019-05-23 09:28:58,241 INFO L146 ILogger]: Start removeUnreachable. Operand 523 states. [2019-05-23 09:28:58,242 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 523 states to 523 states and 524 transitions. [2019-05-23 09:28:58,242 INFO L146 ILogger]: Start accepts. Automaton has 523 states and 524 transitions. Word has length 512 [2019-05-23 09:28:58,242 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:58,242 INFO L146 ILogger]: Abstraction has 523 states and 524 transitions. [2019-05-23 09:28:58,242 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 09:28:58,243 INFO L146 ILogger]: Start isEmpty. Operand 523 states and 524 transitions. [2019-05-23 09:28:58,244 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 520 [2019-05-23 09:28:58,244 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:58,245 INFO L146 ILogger]: trace histogram [72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:58,245 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:58,245 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:58,245 INFO L146 ILogger]: Analyzing trace with hash -754867752, now seen corresponding path program 72 times [2019-05-23 09:28:58,246 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:58,282 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:58,290 INFO L146 ILogger]: Trace formula consists of 743 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:28:58,295 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:04,273 INFO L146 ILogger]: Checked inductivity of 17964 backedges. 0 proven. 17964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:04,273 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:04,273 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 09:29:04,274 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 09:29:04,275 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 09:29:04,276 INFO L146 ILogger]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:29:04,276 INFO L146 ILogger]: Start difference. First operand 523 states and 524 transitions. Second operand 147 states. [2019-05-23 09:29:14,273 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:14,274 INFO L146 ILogger]: Finished difference Result 545 states and 546 transitions. [2019-05-23 09:29:14,274 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-05-23 09:29:14,274 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 519 [2019-05-23 09:29:14,275 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:14,276 INFO L146 ILogger]: With dead ends: 545 [2019-05-23 09:29:14,276 INFO L146 ILogger]: Without dead ends: 545 [2019-05-23 09:29:14,278 INFO L146 ILogger]: 0 DeclaredPredicates, 662 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2019-05-23 09:29:14,279 INFO L146 ILogger]: Start minimizeSevpa. Operand 545 states. [2019-05-23 09:29:14,281 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 545 to 530. [2019-05-23 09:29:14,282 INFO L146 ILogger]: Start removeUnreachable. Operand 530 states. [2019-05-23 09:29:14,282 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 530 states to 530 states and 531 transitions. [2019-05-23 09:29:14,282 INFO L146 ILogger]: Start accepts. Automaton has 530 states and 531 transitions. Word has length 519 [2019-05-23 09:29:14,282 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:14,283 INFO L146 ILogger]: Abstraction has 530 states and 531 transitions. [2019-05-23 09:29:14,283 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 09:29:14,283 INFO L146 ILogger]: Start isEmpty. Operand 530 states and 531 transitions. [2019-05-23 09:29:14,285 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 527 [2019-05-23 09:29:14,285 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:14,285 INFO L146 ILogger]: trace histogram [73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:14,285 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:14,285 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:14,285 INFO L146 ILogger]: Analyzing trace with hash -538101498, now seen corresponding path program 73 times [2019-05-23 09:29:14,286 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:14,319 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:14,327 INFO L146 ILogger]: Trace formula consists of 753 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 09:29:14,332 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:20,469 INFO L146 ILogger]: Checked inductivity of 18469 backedges. 0 proven. 18469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:20,470 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:20,470 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 09:29:20,470 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 09:29:20,471 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 09:29:20,471 INFO L146 ILogger]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:29:20,472 INFO L146 ILogger]: Start difference. First operand 530 states and 531 transitions. Second operand 149 states. [2019-05-23 09:29:30,887 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:30,888 INFO L146 ILogger]: Finished difference Result 552 states and 553 transitions. [2019-05-23 09:29:30,888 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2019-05-23 09:29:30,888 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 526 [2019-05-23 09:29:30,889 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:30,890 INFO L146 ILogger]: With dead ends: 552 [2019-05-23 09:29:30,890 INFO L146 ILogger]: Without dead ends: 552 [2019-05-23 09:29:30,893 INFO L146 ILogger]: 0 DeclaredPredicates, 671 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2019-05-23 09:29:30,893 INFO L146 ILogger]: Start minimizeSevpa. Operand 552 states. [2019-05-23 09:29:30,896 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 552 to 537. [2019-05-23 09:29:30,896 INFO L146 ILogger]: Start removeUnreachable. Operand 537 states. [2019-05-23 09:29:30,896 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2019-05-23 09:29:30,896 INFO L146 ILogger]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 526 [2019-05-23 09:29:30,897 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:30,897 INFO L146 ILogger]: Abstraction has 537 states and 538 transitions. [2019-05-23 09:29:30,897 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 09:29:30,897 INFO L146 ILogger]: Start isEmpty. Operand 537 states and 538 transitions. [2019-05-23 09:29:30,899 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 534 [2019-05-23 09:29:30,899 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:30,899 INFO L146 ILogger]: trace histogram [74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:30,899 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:30,900 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:30,900 INFO L146 ILogger]: Analyzing trace with hash 9425432, now seen corresponding path program 74 times [2019-05-23 09:29:30,900 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:30,929 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:30,937 INFO L146 ILogger]: Trace formula consists of 763 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:29:30,940 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:37,327 INFO L146 ILogger]: Checked inductivity of 18981 backedges. 0 proven. 18981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:37,327 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:37,327 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 09:29:37,328 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 09:29:37,328 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 09:29:37,329 INFO L146 ILogger]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:29:37,329 INFO L146 ILogger]: Start difference. First operand 537 states and 538 transitions. Second operand 151 states. [2019-05-23 09:29:47,932 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:47,932 INFO L146 ILogger]: Finished difference Result 559 states and 560 transitions. [2019-05-23 09:29:47,933 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2019-05-23 09:29:47,933 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 533 [2019-05-23 09:29:47,933 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:47,935 INFO L146 ILogger]: With dead ends: 559 [2019-05-23 09:29:47,935 INFO L146 ILogger]: Without dead ends: 559 [2019-05-23 09:29:47,938 INFO L146 ILogger]: 0 DeclaredPredicates, 680 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16280 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=28123, Invalid=60979, Unknown=0, NotChecked=0, Total=89102 [2019-05-23 09:29:47,938 INFO L146 ILogger]: Start minimizeSevpa. Operand 559 states. [2019-05-23 09:29:47,941 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 559 to 544. [2019-05-23 09:29:47,941 INFO L146 ILogger]: Start removeUnreachable. Operand 544 states. [2019-05-23 09:29:47,942 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2019-05-23 09:29:47,942 INFO L146 ILogger]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 533 [2019-05-23 09:29:47,942 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:47,942 INFO L146 ILogger]: Abstraction has 544 states and 545 transitions. [2019-05-23 09:29:47,942 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 09:29:47,942 INFO L146 ILogger]: Start isEmpty. Operand 544 states and 545 transitions. [2019-05-23 09:29:47,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 541 [2019-05-23 09:29:47,944 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:47,945 INFO L146 ILogger]: trace histogram [75, 75, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:47,945 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:47,945 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:47,945 INFO L146 ILogger]: Analyzing trace with hash 659833030, now seen corresponding path program 75 times [2019-05-23 09:29:47,946 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:47,981 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:47,986 INFO L146 ILogger]: Trace formula consists of 773 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 09:29:47,991 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:54,226 INFO L146 ILogger]: Checked inductivity of 19500 backedges. 0 proven. 19500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:54,227 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:54,227 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 09:29:54,227 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 09:29:54,228 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 09:29:54,229 INFO L146 ILogger]: CoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:29:54,229 INFO L146 ILogger]: Start difference. First operand 544 states and 545 transitions. Second operand 153 states. [2019-05-23 09:30:04,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:04,765 INFO L146 ILogger]: Finished difference Result 566 states and 567 transitions. [2019-05-23 09:30:04,765 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-05-23 09:30:04,765 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 540 [2019-05-23 09:30:04,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:04,768 INFO L146 ILogger]: With dead ends: 566 [2019-05-23 09:30:04,768 INFO L146 ILogger]: Without dead ends: 566 [2019-05-23 09:30:04,771 INFO L146 ILogger]: 0 DeclaredPredicates, 689 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16725 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=28878, Invalid=62628, Unknown=0, NotChecked=0, Total=91506 [2019-05-23 09:30:04,772 INFO L146 ILogger]: Start minimizeSevpa. Operand 566 states. [2019-05-23 09:30:04,775 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 566 to 551. [2019-05-23 09:30:04,775 INFO L146 ILogger]: Start removeUnreachable. Operand 551 states. [2019-05-23 09:30:04,775 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2019-05-23 09:30:04,775 INFO L146 ILogger]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 540 [2019-05-23 09:30:04,776 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:04,776 INFO L146 ILogger]: Abstraction has 551 states and 552 transitions. [2019-05-23 09:30:04,776 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 09:30:04,776 INFO L146 ILogger]: Start isEmpty. Operand 551 states and 552 transitions. [2019-05-23 09:30:04,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 548 [2019-05-23 09:30:04,778 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:04,778 INFO L146 ILogger]: trace histogram [76, 76, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:04,778 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:04,779 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:04,779 INFO L146 ILogger]: Analyzing trace with hash -127626664, now seen corresponding path program 76 times [2019-05-23 09:30:04,779 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:04,804 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:04,811 INFO L146 ILogger]: Trace formula consists of 783 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:30:04,814 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:11,100 INFO L146 ILogger]: Checked inductivity of 20026 backedges. 0 proven. 20026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:11,100 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:11,100 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 09:30:11,101 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 09:30:11,101 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 09:30:11,102 INFO L146 ILogger]: CoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:30:11,102 INFO L146 ILogger]: Start difference. First operand 551 states and 552 transitions. Second operand 155 states. [2019-05-23 09:30:21,982 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:21,983 INFO L146 ILogger]: Finished difference Result 573 states and 574 transitions. [2019-05-23 09:30:21,983 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-05-23 09:30:21,983 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 547 [2019-05-23 09:30:21,984 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:21,985 INFO L146 ILogger]: With dead ends: 573 [2019-05-23 09:30:21,985 INFO L146 ILogger]: Without dead ends: 573 [2019-05-23 09:30:21,988 INFO L146 ILogger]: 0 DeclaredPredicates, 698 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17176 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=29643, Invalid=64299, Unknown=0, NotChecked=0, Total=93942 [2019-05-23 09:30:21,988 INFO L146 ILogger]: Start minimizeSevpa. Operand 573 states. [2019-05-23 09:30:21,991 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 573 to 558. [2019-05-23 09:30:21,991 INFO L146 ILogger]: Start removeUnreachable. Operand 558 states. [2019-05-23 09:30:21,992 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 558 states to 558 states and 559 transitions. [2019-05-23 09:30:21,992 INFO L146 ILogger]: Start accepts. Automaton has 558 states and 559 transitions. Word has length 547 [2019-05-23 09:30:21,992 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:21,992 INFO L146 ILogger]: Abstraction has 558 states and 559 transitions. [2019-05-23 09:30:21,992 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 09:30:21,992 INFO L146 ILogger]: Start isEmpty. Operand 558 states and 559 transitions. [2019-05-23 09:30:21,994 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 555 [2019-05-23 09:30:21,994 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:21,994 INFO L146 ILogger]: trace histogram [77, 77, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:21,995 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:21,995 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:21,995 INFO L146 ILogger]: Analyzing trace with hash 1391638662, now seen corresponding path program 77 times [2019-05-23 09:30:21,995 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:22,021 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:22,028 INFO L146 ILogger]: Trace formula consists of 793 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:30:22,031 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:28,549 INFO L146 ILogger]: Checked inductivity of 20559 backedges. 0 proven. 20559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:28,549 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:28,550 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 09:30:28,550 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 09:30:28,551 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 09:30:28,551 INFO L146 ILogger]: CoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:30:28,551 INFO L146 ILogger]: Start difference. First operand 558 states and 559 transitions. Second operand 157 states. [2019-05-23 09:30:39,837 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:39,837 INFO L146 ILogger]: Finished difference Result 580 states and 581 transitions. [2019-05-23 09:30:39,838 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-05-23 09:30:39,838 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 554 [2019-05-23 09:30:39,838 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:39,840 INFO L146 ILogger]: With dead ends: 580 [2019-05-23 09:30:39,840 INFO L146 ILogger]: Without dead ends: 580 [2019-05-23 09:30:39,843 INFO L146 ILogger]: 0 DeclaredPredicates, 707 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17633 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=30418, Invalid=65992, Unknown=0, NotChecked=0, Total=96410 [2019-05-23 09:30:39,843 INFO L146 ILogger]: Start minimizeSevpa. Operand 580 states. [2019-05-23 09:30:39,846 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 580 to 565. [2019-05-23 09:30:39,846 INFO L146 ILogger]: Start removeUnreachable. Operand 565 states. [2019-05-23 09:30:39,846 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2019-05-23 09:30:39,847 INFO L146 ILogger]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 554 [2019-05-23 09:30:39,847 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:39,847 INFO L146 ILogger]: Abstraction has 565 states and 566 transitions. [2019-05-23 09:30:39,847 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 09:30:39,847 INFO L146 ILogger]: Start isEmpty. Operand 565 states and 566 transitions. [2019-05-23 09:30:39,849 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 562 [2019-05-23 09:30:39,849 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:39,850 INFO L146 ILogger]: trace histogram [78, 78, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:39,850 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:39,850 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:39,850 INFO L146 ILogger]: Analyzing trace with hash -1279008104, now seen corresponding path program 78 times [2019-05-23 09:30:39,851 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:39,876 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:39,885 INFO L146 ILogger]: Trace formula consists of 803 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:30:39,888 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:46,593 INFO L146 ILogger]: Checked inductivity of 21099 backedges. 0 proven. 21099 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:46,593 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:46,593 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 09:30:46,594 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 09:30:46,594 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 09:30:46,595 INFO L146 ILogger]: CoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:30:46,595 INFO L146 ILogger]: Start difference. First operand 565 states and 566 transitions. Second operand 159 states. [2019-05-23 09:30:58,046 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:58,046 INFO L146 ILogger]: Finished difference Result 587 states and 588 transitions. [2019-05-23 09:30:58,046 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2019-05-23 09:30:58,046 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 561 [2019-05-23 09:30:58,047 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:58,048 INFO L146 ILogger]: With dead ends: 587 [2019-05-23 09:30:58,048 INFO L146 ILogger]: Without dead ends: 587 [2019-05-23 09:30:58,051 INFO L146 ILogger]: 0 DeclaredPredicates, 716 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=31203, Invalid=67707, Unknown=0, NotChecked=0, Total=98910 [2019-05-23 09:30:58,051 INFO L146 ILogger]: Start minimizeSevpa. Operand 587 states. [2019-05-23 09:30:58,054 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 587 to 572. [2019-05-23 09:30:58,054 INFO L146 ILogger]: Start removeUnreachable. Operand 572 states. [2019-05-23 09:30:58,055 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 572 states to 572 states and 573 transitions. [2019-05-23 09:30:58,055 INFO L146 ILogger]: Start accepts. Automaton has 572 states and 573 transitions. Word has length 561 [2019-05-23 09:30:58,055 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:58,055 INFO L146 ILogger]: Abstraction has 572 states and 573 transitions. [2019-05-23 09:30:58,055 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 09:30:58,055 INFO L146 ILogger]: Start isEmpty. Operand 572 states and 573 transitions. [2019-05-23 09:30:58,057 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 569 [2019-05-23 09:30:58,057 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:58,057 INFO L146 ILogger]: trace histogram [79, 79, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:58,057 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:58,058 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:58,058 INFO L146 ILogger]: Analyzing trace with hash 889495622, now seen corresponding path program 79 times [2019-05-23 09:30:58,058 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:58,098 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:58,108 INFO L146 ILogger]: Trace formula consists of 813 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 09:30:58,113 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:05,079 INFO L146 ILogger]: Checked inductivity of 21646 backedges. 0 proven. 21646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:05,080 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:05,080 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 09:31:05,080 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 09:31:05,081 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 09:31:05,082 INFO L146 ILogger]: CoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:31:05,082 INFO L146 ILogger]: Start difference. First operand 572 states and 573 transitions. Second operand 161 states. [2019-05-23 09:31:16,799 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:16,799 INFO L146 ILogger]: Finished difference Result 594 states and 595 transitions. [2019-05-23 09:31:16,800 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-05-23 09:31:16,800 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 568 [2019-05-23 09:31:16,800 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:16,802 INFO L146 ILogger]: With dead ends: 594 [2019-05-23 09:31:16,802 INFO L146 ILogger]: Without dead ends: 594 [2019-05-23 09:31:16,804 INFO L146 ILogger]: 0 DeclaredPredicates, 725 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18565 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=31998, Invalid=69444, Unknown=0, NotChecked=0, Total=101442 [2019-05-23 09:31:16,805 INFO L146 ILogger]: Start minimizeSevpa. Operand 594 states. [2019-05-23 09:31:16,808 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 594 to 579. [2019-05-23 09:31:16,808 INFO L146 ILogger]: Start removeUnreachable. Operand 579 states. [2019-05-23 09:31:16,808 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 579 states to 579 states and 580 transitions. [2019-05-23 09:31:16,808 INFO L146 ILogger]: Start accepts. Automaton has 579 states and 580 transitions. Word has length 568 [2019-05-23 09:31:16,809 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:16,809 INFO L146 ILogger]: Abstraction has 579 states and 580 transitions. [2019-05-23 09:31:16,809 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 09:31:16,809 INFO L146 ILogger]: Start isEmpty. Operand 579 states and 580 transitions. [2019-05-23 09:31:16,811 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 576 [2019-05-23 09:31:16,811 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:16,811 INFO L146 ILogger]: trace histogram [80, 80, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:16,811 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:16,812 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:16,812 INFO L146 ILogger]: Analyzing trace with hash -1527659816, now seen corresponding path program 80 times [2019-05-23 09:31:16,812 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:16,844 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:16,853 INFO L146 ILogger]: Trace formula consists of 823 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:31:16,858 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:23,984 INFO L146 ILogger]: Checked inductivity of 22200 backedges. 0 proven. 22200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:23,985 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:23,985 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 09:31:23,985 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 09:31:23,986 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 09:31:23,986 INFO L146 ILogger]: CoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:31:23,986 INFO L146 ILogger]: Start difference. First operand 579 states and 580 transitions. Second operand 163 states. [2019-05-23 09:31:36,056 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:36,056 INFO L146 ILogger]: Finished difference Result 601 states and 602 transitions. [2019-05-23 09:31:36,056 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-05-23 09:31:36,057 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 575 [2019-05-23 09:31:36,057 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:36,060 INFO L146 ILogger]: With dead ends: 601 [2019-05-23 09:31:36,060 INFO L146 ILogger]: Without dead ends: 601 [2019-05-23 09:31:36,062 INFO L146 ILogger]: 0 DeclaredPredicates, 734 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19040 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=32803, Invalid=71203, Unknown=0, NotChecked=0, Total=104006 [2019-05-23 09:31:36,062 INFO L146 ILogger]: Start minimizeSevpa. Operand 601 states. [2019-05-23 09:31:36,065 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 601 to 586. [2019-05-23 09:31:36,066 INFO L146 ILogger]: Start removeUnreachable. Operand 586 states. [2019-05-23 09:31:36,066 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 586 states to 586 states and 587 transitions. [2019-05-23 09:31:36,066 INFO L146 ILogger]: Start accepts. Automaton has 586 states and 587 transitions. Word has length 575 [2019-05-23 09:31:36,066 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:36,066 INFO L146 ILogger]: Abstraction has 586 states and 587 transitions. [2019-05-23 09:31:36,066 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 09:31:36,067 INFO L146 ILogger]: Start isEmpty. Operand 586 states and 587 transitions. [2019-05-23 09:31:36,069 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 583 [2019-05-23 09:31:36,069 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:36,069 INFO L146 ILogger]: trace histogram [81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:36,069 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:36,069 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:36,070 INFO L146 ILogger]: Analyzing trace with hash 113637382, now seen corresponding path program 81 times [2019-05-23 09:31:36,070 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:36,098 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:36,105 INFO L146 ILogger]: Trace formula consists of 833 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 09:31:36,109 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:43,359 INFO L146 ILogger]: Checked inductivity of 22761 backedges. 0 proven. 22761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:43,360 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:43,360 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 09:31:43,360 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 09:31:43,361 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 09:31:43,362 INFO L146 ILogger]: CoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:31:43,362 INFO L146 ILogger]: Start difference. First operand 586 states and 587 transitions. Second operand 165 states. [2019-05-23 09:31:55,644 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:55,645 INFO L146 ILogger]: Finished difference Result 608 states and 609 transitions. [2019-05-23 09:31:55,645 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2019-05-23 09:31:55,645 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 582 [2019-05-23 09:31:55,646 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:55,648 INFO L146 ILogger]: With dead ends: 608 [2019-05-23 09:31:55,648 INFO L146 ILogger]: Without dead ends: 608 [2019-05-23 09:31:55,651 INFO L146 ILogger]: 0 DeclaredPredicates, 743 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19521 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=33618, Invalid=72984, Unknown=0, NotChecked=0, Total=106602 [2019-05-23 09:31:55,652 INFO L146 ILogger]: Start minimizeSevpa. Operand 608 states. [2019-05-23 09:31:55,655 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 608 to 593. [2019-05-23 09:31:55,655 INFO L146 ILogger]: Start removeUnreachable. Operand 593 states. [2019-05-23 09:31:55,655 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2019-05-23 09:31:55,655 INFO L146 ILogger]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 582 [2019-05-23 09:31:55,656 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:55,656 INFO L146 ILogger]: Abstraction has 593 states and 594 transitions. [2019-05-23 09:31:55,656 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 09:31:55,656 INFO L146 ILogger]: Start isEmpty. Operand 593 states and 594 transitions. [2019-05-23 09:31:55,658 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 590 [2019-05-23 09:31:55,658 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:55,658 INFO L146 ILogger]: trace histogram [82, 82, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:55,658 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:55,659 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:55,659 INFO L146 ILogger]: Analyzing trace with hash -147705064, now seen corresponding path program 82 times [2019-05-23 09:31:55,659 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:55,686 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:55,693 INFO L146 ILogger]: Trace formula consists of 843 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:31:55,697 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:03,085 INFO L146 ILogger]: Checked inductivity of 23329 backedges. 0 proven. 23329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:03,085 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:03,086 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 09:32:03,086 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 09:32:03,087 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 09:32:03,088 INFO L146 ILogger]: CoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:32:03,088 INFO L146 ILogger]: Start difference. First operand 593 states and 594 transitions. Second operand 167 states. [2019-05-23 09:32:15,916 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:15,916 INFO L146 ILogger]: Finished difference Result 615 states and 616 transitions. [2019-05-23 09:32:15,917 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2019-05-23 09:32:15,917 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 589 [2019-05-23 09:32:15,917 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:15,919 INFO L146 ILogger]: With dead ends: 615 [2019-05-23 09:32:15,919 INFO L146 ILogger]: Without dead ends: 615 [2019-05-23 09:32:15,921 INFO L146 ILogger]: 0 DeclaredPredicates, 752 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20008 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=34443, Invalid=74787, Unknown=0, NotChecked=0, Total=109230 [2019-05-23 09:32:15,921 INFO L146 ILogger]: Start minimizeSevpa. Operand 615 states. [2019-05-23 09:32:15,924 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 615 to 600. [2019-05-23 09:32:15,925 INFO L146 ILogger]: Start removeUnreachable. Operand 600 states. [2019-05-23 09:32:15,925 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2019-05-23 09:32:15,925 INFO L146 ILogger]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 589 [2019-05-23 09:32:15,926 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:15,926 INFO L146 ILogger]: Abstraction has 600 states and 601 transitions. [2019-05-23 09:32:15,926 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 09:32:15,926 INFO L146 ILogger]: Start isEmpty. Operand 600 states and 601 transitions. [2019-05-23 09:32:15,928 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 597 [2019-05-23 09:32:15,928 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:15,929 INFO L146 ILogger]: trace histogram [83, 83, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:15,929 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:15,929 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:15,929 INFO L146 ILogger]: Analyzing trace with hash 678608838, now seen corresponding path program 83 times [2019-05-23 09:32:15,930 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:15,957 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:15,963 INFO L146 ILogger]: Trace formula consists of 853 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:32:15,967 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:23,495 INFO L146 ILogger]: Checked inductivity of 23904 backedges. 0 proven. 23904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:23,495 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:23,495 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 09:32:23,496 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 09:32:23,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 09:32:23,498 INFO L146 ILogger]: CoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:32:23,498 INFO L146 ILogger]: Start difference. First operand 600 states and 601 transitions. Second operand 169 states. [2019-05-23 09:32:36,425 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:36,425 INFO L146 ILogger]: Finished difference Result 622 states and 623 transitions. [2019-05-23 09:32:36,425 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2019-05-23 09:32:36,425 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 596 [2019-05-23 09:32:36,426 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:36,428 INFO L146 ILogger]: With dead ends: 622 [2019-05-23 09:32:36,428 INFO L146 ILogger]: Without dead ends: 622 [2019-05-23 09:32:36,430 INFO L146 ILogger]: 0 DeclaredPredicates, 761 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20501 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=35278, Invalid=76612, Unknown=0, NotChecked=0, Total=111890 [2019-05-23 09:32:36,430 INFO L146 ILogger]: Start minimizeSevpa. Operand 622 states. [2019-05-23 09:32:36,433 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 622 to 607. [2019-05-23 09:32:36,433 INFO L146 ILogger]: Start removeUnreachable. Operand 607 states. [2019-05-23 09:32:36,434 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2019-05-23 09:32:36,434 INFO L146 ILogger]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 596 [2019-05-23 09:32:36,434 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:36,434 INFO L146 ILogger]: Abstraction has 607 states and 608 transitions. [2019-05-23 09:32:36,434 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 09:32:36,434 INFO L146 ILogger]: Start isEmpty. Operand 607 states and 608 transitions. [2019-05-23 09:32:36,437 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 604 [2019-05-23 09:32:36,437 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:36,437 INFO L146 ILogger]: trace histogram [84, 84, 84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:36,437 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:36,437 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:36,438 INFO L146 ILogger]: Analyzing trace with hash -825674920, now seen corresponding path program 84 times [2019-05-23 09:32:36,438 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:36,468 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:36,473 INFO L146 ILogger]: Trace formula consists of 863 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:32:36,477 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:44,168 INFO L146 ILogger]: Checked inductivity of 24486 backedges. 0 proven. 24486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:44,169 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:44,169 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 09:32:44,169 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 09:32:44,170 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 09:32:44,172 INFO L146 ILogger]: CoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:32:44,172 INFO L146 ILogger]: Start difference. First operand 607 states and 608 transitions. Second operand 171 states. [2019-05-23 09:32:57,431 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:57,431 INFO L146 ILogger]: Finished difference Result 629 states and 630 transitions. [2019-05-23 09:32:57,431 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2019-05-23 09:32:57,432 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 603 [2019-05-23 09:32:57,432 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:57,434 INFO L146 ILogger]: With dead ends: 629 [2019-05-23 09:32:57,434 INFO L146 ILogger]: Without dead ends: 629 [2019-05-23 09:32:57,436 INFO L146 ILogger]: 0 DeclaredPredicates, 770 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21000 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=36123, Invalid=78459, Unknown=0, NotChecked=0, Total=114582 [2019-05-23 09:32:57,437 INFO L146 ILogger]: Start minimizeSevpa. Operand 629 states. [2019-05-23 09:32:57,440 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 629 to 614. [2019-05-23 09:32:57,440 INFO L146 ILogger]: Start removeUnreachable. Operand 614 states. [2019-05-23 09:32:57,442 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 614 states to 614 states and 615 transitions. [2019-05-23 09:32:57,442 INFO L146 ILogger]: Start accepts. Automaton has 614 states and 615 transitions. Word has length 603 [2019-05-23 09:32:57,442 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:57,442 INFO L146 ILogger]: Abstraction has 614 states and 615 transitions. [2019-05-23 09:32:57,442 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 09:32:57,443 INFO L146 ILogger]: Start isEmpty. Operand 614 states and 615 transitions. [2019-05-23 09:32:57,445 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 611 [2019-05-23 09:32:57,445 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:57,446 INFO L146 ILogger]: trace histogram [85, 85, 85, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:57,446 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:57,446 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:57,446 INFO L146 ILogger]: Analyzing trace with hash -515442810, now seen corresponding path program 85 times [2019-05-23 09:32:57,447 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:57,479 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:57,485 INFO L146 ILogger]: Trace formula consists of 873 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 09:32:57,489 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:05,443 INFO L146 ILogger]: Checked inductivity of 25075 backedges. 0 proven. 25075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:05,444 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:05,444 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2019-05-23 09:33:05,445 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 09:33:05,446 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 09:33:05,447 INFO L146 ILogger]: CoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:33:05,447 INFO L146 ILogger]: Start difference. First operand 614 states and 615 transitions. Second operand 173 states. [2019-05-23 09:33:19,087 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:19,088 INFO L146 ILogger]: Finished difference Result 636 states and 637 transitions. [2019-05-23 09:33:19,088 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-05-23 09:33:19,088 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 610 [2019-05-23 09:33:19,089 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:19,090 INFO L146 ILogger]: With dead ends: 636 [2019-05-23 09:33:19,090 INFO L146 ILogger]: Without dead ends: 636 [2019-05-23 09:33:19,093 INFO L146 ILogger]: 0 DeclaredPredicates, 779 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21505 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=36978, Invalid=80328, Unknown=0, NotChecked=0, Total=117306 [2019-05-23 09:33:19,094 INFO L146 ILogger]: Start minimizeSevpa. Operand 636 states. [2019-05-23 09:33:19,097 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 636 to 621. [2019-05-23 09:33:19,097 INFO L146 ILogger]: Start removeUnreachable. Operand 621 states. [2019-05-23 09:33:19,098 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 621 states to 621 states and 622 transitions. [2019-05-23 09:33:19,098 INFO L146 ILogger]: Start accepts. Automaton has 621 states and 622 transitions. Word has length 610 [2019-05-23 09:33:19,098 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:19,099 INFO L146 ILogger]: Abstraction has 621 states and 622 transitions. [2019-05-23 09:33:19,099 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 09:33:19,099 INFO L146 ILogger]: Start isEmpty. Operand 621 states and 622 transitions. [2019-05-23 09:33:19,102 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 618 [2019-05-23 09:33:19,102 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:19,102 INFO L146 ILogger]: trace histogram [86, 86, 86, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:19,102 INFO L146 ILogger]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:19,102 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:19,103 INFO L146 ILogger]: Analyzing trace with hash -1996831848, now seen corresponding path program 86 times [2019-05-23 09:33:19,103 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:19,133 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:19,143 INFO L146 ILogger]: Trace formula consists of 883 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:33:19,148 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:27,428 INFO L146 ILogger]: Checked inductivity of 25671 backedges. 0 proven. 25671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:27,429 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:27,429 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2019-05-23 09:33:27,429 INFO L146 ILogger]: Interpolant automaton has 175 states [2019-05-23 09:33:27,431 INFO L146 ILogger]: Constructing interpolant automaton starting with 175 interpolants. [2019-05-23 09:33:27,431 INFO L146 ILogger]: CoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:33:27,431 INFO L146 ILogger]: Start difference. First operand 621 states and 622 transitions. Second operand 175 states. [2019-05-23 09:33:41,095 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:41,096 INFO L146 ILogger]: Finished difference Result 643 states and 644 transitions. [2019-05-23 09:33:41,096 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-05-23 09:33:41,096 INFO L146 ILogger]: Start accepts. Automaton has 175 states. Word has length 617 [2019-05-23 09:33:41,096 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:41,098 INFO L146 ILogger]: With dead ends: 643 [2019-05-23 09:33:41,098 INFO L146 ILogger]: Without dead ends: 643 [2019-05-23 09:33:41,101 INFO L146 ILogger]: 0 DeclaredPredicates, 788 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22016 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=37843, Invalid=82219, Unknown=0, NotChecked=0, Total=120062 [2019-05-23 09:33:41,101 INFO L146 ILogger]: Start minimizeSevpa. Operand 643 states. [2019-05-23 09:33:41,104 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 643 to 628. [2019-05-23 09:33:41,104 INFO L146 ILogger]: Start removeUnreachable. Operand 628 states. [2019-05-23 09:33:41,105 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 628 states to 628 states and 629 transitions. [2019-05-23 09:33:41,105 INFO L146 ILogger]: Start accepts. Automaton has 628 states and 629 transitions. Word has length 617 [2019-05-23 09:33:41,105 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:41,105 INFO L146 ILogger]: Abstraction has 628 states and 629 transitions. [2019-05-23 09:33:41,105 INFO L146 ILogger]: Interpolant automaton has 175 states. [2019-05-23 09:33:41,105 INFO L146 ILogger]: Start isEmpty. Operand 628 states and 629 transitions. [2019-05-23 09:33:41,108 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 625 [2019-05-23 09:33:41,108 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:41,108 INFO L146 ILogger]: trace histogram [87, 87, 87, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:41,108 INFO L146 ILogger]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:41,108 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:41,108 INFO L146 ILogger]: Analyzing trace with hash 528392006, now seen corresponding path program 87 times [2019-05-23 09:33:41,109 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:41,150 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:41,161 INFO L146 ILogger]: Trace formula consists of 893 conjuncts, 176 conjunts are in the unsatisfiable core [2019-05-23 09:33:41,166 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:49,616 INFO L146 ILogger]: Checked inductivity of 26274 backedges. 0 proven. 26274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:49,616 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:49,617 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2019-05-23 09:33:49,617 INFO L146 ILogger]: Interpolant automaton has 177 states [2019-05-23 09:33:49,618 INFO L146 ILogger]: Constructing interpolant automaton starting with 177 interpolants. [2019-05-23 09:33:49,619 INFO L146 ILogger]: CoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 09:33:49,619 INFO L146 ILogger]: Start difference. First operand 628 states and 629 transitions. Second operand 177 states. [2019-05-23 09:34:03,721 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:03,721 INFO L146 ILogger]: Finished difference Result 650 states and 651 transitions. [2019-05-23 09:34:03,721 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-05-23 09:34:03,721 INFO L146 ILogger]: Start accepts. Automaton has 177 states. Word has length 624 [2019-05-23 09:34:03,722 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:03,725 INFO L146 ILogger]: With dead ends: 650 [2019-05-23 09:34:03,725 INFO L146 ILogger]: Without dead ends: 650 [2019-05-23 09:34:03,730 INFO L146 ILogger]: 0 DeclaredPredicates, 797 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22533 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=38718, Invalid=84132, Unknown=0, NotChecked=0, Total=122850 [2019-05-23 09:34:03,730 INFO L146 ILogger]: Start minimizeSevpa. Operand 650 states. [2019-05-23 09:34:03,733 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 650 to 635. [2019-05-23 09:34:03,734 INFO L146 ILogger]: Start removeUnreachable. Operand 635 states. [2019-05-23 09:34:03,734 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 635 states to 635 states and 636 transitions. [2019-05-23 09:34:03,734 INFO L146 ILogger]: Start accepts. Automaton has 635 states and 636 transitions. Word has length 624 [2019-05-23 09:34:03,734 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:03,735 INFO L146 ILogger]: Abstraction has 635 states and 636 transitions. [2019-05-23 09:34:03,735 INFO L146 ILogger]: Interpolant automaton has 177 states. [2019-05-23 09:34:03,735 INFO L146 ILogger]: Start isEmpty. Operand 635 states and 636 transitions. [2019-05-23 09:34:03,737 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 632 [2019-05-23 09:34:03,737 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:03,738 INFO L146 ILogger]: trace histogram [88, 88, 88, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:03,738 INFO L146 ILogger]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:03,738 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:03,738 INFO L146 ILogger]: Analyzing trace with hash -66395176, now seen corresponding path program 88 times [2019-05-23 09:34:03,739 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:03,769 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:03,775 INFO L146 ILogger]: Trace formula consists of 903 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 09:34:03,779 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:12,104 INFO L146 ILogger]: Checked inductivity of 26884 backedges. 0 proven. 26884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:12,105 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:12,105 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2019-05-23 09:34:12,105 INFO L146 ILogger]: Interpolant automaton has 179 states [2019-05-23 09:34:12,106 INFO L146 ILogger]: Constructing interpolant automaton starting with 179 interpolants. [2019-05-23 09:34:12,107 INFO L146 ILogger]: CoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:34:12,107 INFO L146 ILogger]: Start difference. First operand 635 states and 636 transitions. Second operand 179 states. [2019-05-23 09:34:26,673 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:26,673 INFO L146 ILogger]: Finished difference Result 657 states and 658 transitions. [2019-05-23 09:34:26,673 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2019-05-23 09:34:26,673 INFO L146 ILogger]: Start accepts. Automaton has 179 states. Word has length 631 [2019-05-23 09:34:26,674 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:26,676 INFO L146 ILogger]: With dead ends: 657 [2019-05-23 09:34:26,676 INFO L146 ILogger]: Without dead ends: 657 [2019-05-23 09:34:26,682 INFO L146 ILogger]: 0 DeclaredPredicates, 806 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23056 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=39603, Invalid=86067, Unknown=0, NotChecked=0, Total=125670 [2019-05-23 09:34:26,682 INFO L146 ILogger]: Start minimizeSevpa. Operand 657 states. [2019-05-23 09:34:26,687 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 657 to 642. [2019-05-23 09:34:26,687 INFO L146 ILogger]: Start removeUnreachable. Operand 642 states. [2019-05-23 09:34:26,688 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 642 states to 642 states and 643 transitions. [2019-05-23 09:34:26,688 INFO L146 ILogger]: Start accepts. Automaton has 642 states and 643 transitions. Word has length 631 [2019-05-23 09:34:26,688 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:26,688 INFO L146 ILogger]: Abstraction has 642 states and 643 transitions. [2019-05-23 09:34:26,689 INFO L146 ILogger]: Interpolant automaton has 179 states. [2019-05-23 09:34:26,689 INFO L146 ILogger]: Start isEmpty. Operand 642 states and 643 transitions. [2019-05-23 09:34:26,692 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 639 [2019-05-23 09:34:26,692 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:26,692 INFO L146 ILogger]: trace histogram [89, 89, 89, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:26,692 INFO L146 ILogger]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:26,692 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:26,692 INFO L146 ILogger]: Analyzing trace with hash 945141510, now seen corresponding path program 89 times [2019-05-23 09:34:26,693 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:26,726 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:26,733 INFO L146 ILogger]: Trace formula consists of 913 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 09:34:26,737 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:35,504 INFO L146 ILogger]: Checked inductivity of 27501 backedges. 0 proven. 27501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:35,504 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:35,504 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2019-05-23 09:34:35,505 INFO L146 ILogger]: Interpolant automaton has 181 states [2019-05-23 09:34:35,506 INFO L146 ILogger]: Constructing interpolant automaton starting with 181 interpolants. [2019-05-23 09:34:35,507 INFO L146 ILogger]: CoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 09:34:35,507 INFO L146 ILogger]: Start difference. First operand 642 states and 643 transitions. Second operand 181 states.