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/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,133 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,135 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,146 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,147 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,148 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,149 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,151 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,153 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,154 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,155 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,155 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,156 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,157 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,158 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,159 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,160 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,162 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,165 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,167 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,168 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,169 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,172 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,172 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,172 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,173 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,174 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,175 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,175 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,176 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,177 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,178 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,179 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,179 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,180 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,180 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,181 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,183 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,184 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,234 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,250 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,256 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,258 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,259 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,259 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-05-23 09:21:57,260 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-05-23 09:21:57,311 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,312 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,313 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,314 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,314 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,331 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,343 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,351 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,352 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,352 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,353 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,364 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,364 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,365 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,366 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,369 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,371 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,372 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,374 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,374 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,375 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,375 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,376 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.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,450 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:21:57,450 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:21:57,805 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:21:57,806 INFO L146 ILogger]: Removed 2 assume(true) statements. [2019-05-23 09:21:57,808 INFO L146 ILogger]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57 BoogieIcfgContainer [2019-05-23 09:21:57,808 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:57,811 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:57,811 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:57,814 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:57,814 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:57,816 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d100a7 and model type array3.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,817 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.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,819 INFO L146 ILogger]: Analyzing ICFG array3.i_4.bpl [2019-05-23 09:21:57,832 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:57,841 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:57,862 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:57,892 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:57,892 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:57,893 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:57,896 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:57,896 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:57,896 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:57,896 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:57,897 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:57,897 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:57,934 INFO L146 ILogger]: Start isEmpty. Operand 26 states. [2019-05-23 09:21:57,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 09:21:57,945 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:57,946 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:57,954 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:57,961 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:57,962 INFO L146 ILogger]: Analyzing trace with hash 400123870, now seen corresponding path program 1 times [2019-05-23 09:21:58,012 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,048 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,050 INFO L146 ILogger]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,055 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,098 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,101 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,102 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:21:58,106 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:21:58,118 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:21:58,119 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,121 INFO L146 ILogger]: Start difference. First operand 26 states. Second operand 3 states. [2019-05-23 09:21:58,269 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,269 INFO L146 ILogger]: Finished difference Result 40 states and 41 transitions. [2019-05-23 09:21:58,270 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:21:58,272 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 14 [2019-05-23 09:21:58,272 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,284 INFO L146 ILogger]: With dead ends: 40 [2019-05-23 09:21:58,284 INFO L146 ILogger]: Without dead ends: 40 [2019-05-23 09:21:58,286 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 12 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,301 INFO L146 ILogger]: Start minimizeSevpa. Operand 40 states. [2019-05-23 09:21:58,315 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-05-23 09:21:58,317 INFO L146 ILogger]: Start removeUnreachable. Operand 25 states. [2019-05-23 09:21:58,318 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-05-23 09:21:58,319 INFO L146 ILogger]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2019-05-23 09:21:58,319 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,320 INFO L146 ILogger]: Abstraction has 25 states and 26 transitions. [2019-05-23 09:21:58,320 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:21:58,320 INFO L146 ILogger]: Start isEmpty. Operand 25 states and 26 transitions. [2019-05-23 09:21:58,321 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 09:21:58,321 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,321 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] [2019-05-23 09:21:58,322 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,322 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,323 INFO L146 ILogger]: Analyzing trace with hash -866476175, now seen corresponding path program 1 times [2019-05-23 09:21:58,324 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,349 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,352 INFO L146 ILogger]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,355 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,433 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,434 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,434 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:21:58,436 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:21:58,436 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:21:58,438 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:21:58,438 INFO L146 ILogger]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2019-05-23 09:21:58,805 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,806 INFO L146 ILogger]: Finished difference Result 47 states and 48 transitions. [2019-05-23 09:21:58,806 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:21:58,806 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 21 [2019-05-23 09:21:58,807 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,808 INFO L146 ILogger]: With dead ends: 47 [2019-05-23 09:21:58,808 INFO L146 ILogger]: Without dead ends: 47 [2019-05-23 09:21:58,809 INFO L146 ILogger]: 0 DeclaredPredicates, 22 GetRequests, 17 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,810 INFO L146 ILogger]: Start minimizeSevpa. Operand 47 states. [2019-05-23 09:21:58,814 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 47 to 32. [2019-05-23 09:21:58,814 INFO L146 ILogger]: Start removeUnreachable. Operand 32 states. [2019-05-23 09:21:58,815 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-05-23 09:21:58,815 INFO L146 ILogger]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2019-05-23 09:21:58,816 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,816 INFO L146 ILogger]: Abstraction has 32 states and 33 transitions. [2019-05-23 09:21:58,816 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:21:58,816 INFO L146 ILogger]: Start isEmpty. Operand 32 states and 33 transitions. [2019-05-23 09:21:58,836 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 29 [2019-05-23 09:21:58,837 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,837 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] [2019-05-23 09:21:58,837 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,838 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,838 INFO L146 ILogger]: Analyzing trace with hash 1001016446, now seen corresponding path program 2 times [2019-05-23 09:21:58,839 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,855 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,857 INFO L146 ILogger]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,859 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,976 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,977 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,977 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:58,978 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:58,978 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:58,978 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,979 INFO L146 ILogger]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2019-05-23 09:21:59,281 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,281 INFO L146 ILogger]: Finished difference Result 54 states and 55 transitions. [2019-05-23 09:21:59,282 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:21:59,282 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 28 [2019-05-23 09:21:59,282 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,283 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 09:21:59,284 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 09:21:59,284 INFO L146 ILogger]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:59,285 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 09:21:59,289 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-05-23 09:21:59,289 INFO L146 ILogger]: Start removeUnreachable. Operand 39 states. [2019-05-23 09:21:59,290 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-05-23 09:21:59,291 INFO L146 ILogger]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 28 [2019-05-23 09:21:59,291 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,291 INFO L146 ILogger]: Abstraction has 39 states and 40 transitions. [2019-05-23 09:21:59,291 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:59,292 INFO L146 ILogger]: Start isEmpty. Operand 39 states and 40 transitions. [2019-05-23 09:21:59,293 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 36 [2019-05-23 09:21:59,293 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,293 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] [2019-05-23 09:21:59,295 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,295 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,295 INFO L146 ILogger]: Analyzing trace with hash 926762705, now seen corresponding path program 3 times [2019-05-23 09:21:59,297 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,331 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,335 INFO L146 ILogger]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,337 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,450 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,450 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,450 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:21:59,451 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:21:59,451 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:21:59,452 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:21:59,452 INFO L146 ILogger]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2019-05-23 09:21:59,963 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,964 INFO L146 ILogger]: Finished difference Result 61 states and 62 transitions. [2019-05-23 09:21:59,964 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:21:59,965 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 35 [2019-05-23 09:21:59,965 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,967 INFO L146 ILogger]: With dead ends: 61 [2019-05-23 09:21:59,968 INFO L146 ILogger]: Without dead ends: 61 [2019-05-23 09:21:59,969 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 27 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,970 INFO L146 ILogger]: Start minimizeSevpa. Operand 61 states. [2019-05-23 09:21:59,973 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 61 to 46. [2019-05-23 09:21:59,973 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 09:21:59,974 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-05-23 09:21:59,974 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 35 [2019-05-23 09:21:59,975 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,975 INFO L146 ILogger]: Abstraction has 46 states and 47 transitions. [2019-05-23 09:21:59,975 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:21:59,975 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 47 transitions. [2019-05-23 09:21:59,976 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 09:21:59,976 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,977 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] [2019-05-23 09:21:59,977 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,977 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,977 INFO L146 ILogger]: Analyzing trace with hash 121542942, now seen corresponding path program 4 times [2019-05-23 09:21:59,978 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,022 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,024 INFO L146 ILogger]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,029 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,189 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,189 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,189 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:00,190 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:00,190 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:00,191 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:00,191 INFO L146 ILogger]: Start difference. First operand 46 states and 47 transitions. Second operand 11 states. [2019-05-23 09:22:00,514 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,514 INFO L146 ILogger]: Finished difference Result 68 states and 69 transitions. [2019-05-23 09:22:00,516 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:00,516 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 42 [2019-05-23 09:22:00,517 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,518 INFO L146 ILogger]: With dead ends: 68 [2019-05-23 09:22:00,518 INFO L146 ILogger]: Without dead ends: 68 [2019-05-23 09:22:00,519 INFO L146 ILogger]: 0 DeclaredPredicates, 49 GetRequests, 32 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,521 INFO L146 ILogger]: Start minimizeSevpa. Operand 68 states. [2019-05-23 09:22:00,528 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 68 to 53. [2019-05-23 09:22:00,528 INFO L146 ILogger]: Start removeUnreachable. Operand 53 states. [2019-05-23 09:22:00,529 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-05-23 09:22:00,529 INFO L146 ILogger]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 42 [2019-05-23 09:22:00,530 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,530 INFO L146 ILogger]: Abstraction has 53 states and 54 transitions. [2019-05-23 09:22:00,530 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:00,530 INFO L146 ILogger]: Start isEmpty. Operand 53 states and 54 transitions. [2019-05-23 09:22:00,531 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:22:00,531 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,532 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] [2019-05-23 09:22:00,532 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,532 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,532 INFO L146 ILogger]: Analyzing trace with hash -1019771343, now seen corresponding path program 5 times [2019-05-23 09:22:00,533 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,555 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,557 INFO L146 ILogger]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,559 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,832 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,833 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,833 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:00,835 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:00,836 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:00,836 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:00,836 INFO L146 ILogger]: Start difference. First operand 53 states and 54 transitions. Second operand 13 states. [2019-05-23 09:22:01,623 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,624 INFO L146 ILogger]: Finished difference Result 75 states and 76 transitions. [2019-05-23 09:22:01,624 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:01,625 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 49 [2019-05-23 09:22:01,625 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,628 INFO L146 ILogger]: With dead ends: 75 [2019-05-23 09:22:01,630 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:22:01,631 INFO L146 ILogger]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:01,632 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:22:01,638 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 60. [2019-05-23 09:22:01,638 INFO L146 ILogger]: Start removeUnreachable. Operand 60 states. [2019-05-23 09:22:01,639 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-05-23 09:22:01,640 INFO L146 ILogger]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 49 [2019-05-23 09:22:01,640 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,640 INFO L146 ILogger]: Abstraction has 60 states and 61 transitions. [2019-05-23 09:22:01,641 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:01,641 INFO L146 ILogger]: Start isEmpty. Operand 60 states and 61 transitions. [2019-05-23 09:22:01,646 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 57 [2019-05-23 09:22:01,646 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,647 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] [2019-05-23 09:22:01,647 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,647 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,647 INFO L146 ILogger]: Analyzing trace with hash 1283476926, now seen corresponding path program 6 times [2019-05-23 09:22:01,648 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,691 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,696 INFO L146 ILogger]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,699 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,927 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,928 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,928 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:01,928 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:01,928 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:01,929 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:01,929 INFO L146 ILogger]: Start difference. First operand 60 states and 61 transitions. Second operand 15 states. [2019-05-23 09:22:02,227 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,228 INFO L146 ILogger]: Finished difference Result 82 states and 83 transitions. [2019-05-23 09:22:02,228 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:02,228 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 56 [2019-05-23 09:22:02,229 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,230 INFO L146 ILogger]: With dead ends: 82 [2019-05-23 09:22:02,230 INFO L146 ILogger]: Without dead ends: 82 [2019-05-23 09:22:02,232 INFO L146 ILogger]: 0 DeclaredPredicates, 67 GetRequests, 42 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,232 INFO L146 ILogger]: Start minimizeSevpa. Operand 82 states. [2019-05-23 09:22:02,236 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 82 to 67. [2019-05-23 09:22:02,236 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 09:22:02,237 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-05-23 09:22:02,237 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2019-05-23 09:22:02,238 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,238 INFO L146 ILogger]: Abstraction has 67 states and 68 transitions. [2019-05-23 09:22:02,238 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:02,238 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 68 transitions. [2019-05-23 09:22:02,239 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 64 [2019-05-23 09:22:02,239 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,239 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] [2019-05-23 09:22:02,240 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,240 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,240 INFO L146 ILogger]: Analyzing trace with hash -2095096431, now seen corresponding path program 7 times [2019-05-23 09:22:02,241 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,261 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,263 INFO L146 ILogger]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,266 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,533 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,534 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,535 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:02,536 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:02,536 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:02,536 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:02,536 INFO L146 ILogger]: Start difference. First operand 67 states and 68 transitions. Second operand 17 states. [2019-05-23 09:22:02,837 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,838 INFO L146 ILogger]: Finished difference Result 89 states and 90 transitions. [2019-05-23 09:22:02,838 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:02,838 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 63 [2019-05-23 09:22:02,839 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,840 INFO L146 ILogger]: With dead ends: 89 [2019-05-23 09:22:02,841 INFO L146 ILogger]: Without dead ends: 89 [2019-05-23 09:22:02,842 INFO L146 ILogger]: 0 DeclaredPredicates, 76 GetRequests, 47 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,842 INFO L146 ILogger]: Start minimizeSevpa. Operand 89 states. [2019-05-23 09:22:02,846 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 89 to 74. [2019-05-23 09:22:02,846 INFO L146 ILogger]: Start removeUnreachable. Operand 74 states. [2019-05-23 09:22:02,847 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-05-23 09:22:02,847 INFO L146 ILogger]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 63 [2019-05-23 09:22:02,847 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,847 INFO L146 ILogger]: Abstraction has 74 states and 75 transitions. [2019-05-23 09:22:02,847 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:02,848 INFO L146 ILogger]: Start isEmpty. Operand 74 states and 75 transitions. [2019-05-23 09:22:02,849 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 71 [2019-05-23 09:22:02,849 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,849 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] [2019-05-23 09:22:02,849 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,850 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,850 INFO L146 ILogger]: Analyzing trace with hash 1004104286, now seen corresponding path program 8 times [2019-05-23 09:22:02,851 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,871 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,873 INFO L146 ILogger]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,876 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:03,087 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,088 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,088 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:03,089 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:03,089 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:03,089 INFO L146 ILogger]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:03,090 INFO L146 ILogger]: Start difference. First operand 74 states and 75 transitions. Second operand 19 states. [2019-05-23 09:22:03,927 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:03,928 INFO L146 ILogger]: Finished difference Result 96 states and 97 transitions. [2019-05-23 09:22:03,935 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:03,935 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 70 [2019-05-23 09:22:03,936 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:03,936 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 09:22:03,937 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 09:22:03,938 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 52 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,939 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 09:22:03,943 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 81. [2019-05-23 09:22:03,943 INFO L146 ILogger]: Start removeUnreachable. Operand 81 states. [2019-05-23 09:22:03,944 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-05-23 09:22:03,944 INFO L146 ILogger]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 70 [2019-05-23 09:22:03,944 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:03,944 INFO L146 ILogger]: Abstraction has 81 states and 82 transitions. [2019-05-23 09:22:03,945 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:03,945 INFO L146 ILogger]: Start isEmpty. Operand 81 states and 82 transitions. [2019-05-23 09:22:03,946 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 09:22:03,946 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:03,946 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] [2019-05-23 09:22:03,946 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:03,947 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:03,947 INFO L146 ILogger]: Analyzing trace with hash -615854863, now seen corresponding path program 9 times [2019-05-23 09:22:03,948 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 111 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,195 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,195 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,196 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:04,196 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:04,196 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:04,197 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:04,197 INFO L146 ILogger]: Start difference. First operand 81 states and 82 transitions. Second operand 21 states. [2019-05-23 09:22:04,699 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,699 INFO L146 ILogger]: Finished difference Result 103 states and 104 transitions. [2019-05-23 09:22:04,700 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:04,700 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 77 [2019-05-23 09:22:04,700 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,701 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 09:22:04,701 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 09:22:04,702 INFO L146 ILogger]: 0 DeclaredPredicates, 94 GetRequests, 57 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,702 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 09:22:04,706 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 88. [2019-05-23 09:22:04,707 INFO L146 ILogger]: Start removeUnreachable. Operand 88 states. [2019-05-23 09:22:04,707 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-05-23 09:22:04,708 INFO L146 ILogger]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2019-05-23 09:22:04,708 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:04,708 INFO L146 ILogger]: Abstraction has 88 states and 89 transitions. [2019-05-23 09:22:04,708 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:04,708 INFO L146 ILogger]: Start isEmpty. Operand 88 states and 89 transitions. [2019-05-23 09:22:04,709 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 85 [2019-05-23 09:22:04,710 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,710 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] [2019-05-23 09:22:04,710 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,710 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,711 INFO L146 ILogger]: Analyzing trace with hash 70512382, now seen corresponding path program 10 times [2019-05-23 09:22:04,711 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,731 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,734 INFO L146 ILogger]: Trace formula consists of 121 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,738 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,983 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,983 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,983 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:04,984 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:04,984 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:04,984 INFO L146 ILogger]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:04,984 INFO L146 ILogger]: Start difference. First operand 88 states and 89 transitions. Second operand 23 states. [2019-05-23 09:22:05,438 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,438 INFO L146 ILogger]: Finished difference Result 110 states and 111 transitions. [2019-05-23 09:22:05,438 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:05,439 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 84 [2019-05-23 09:22:05,439 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,440 INFO L146 ILogger]: With dead ends: 110 [2019-05-23 09:22:05,440 INFO L146 ILogger]: Without dead ends: 110 [2019-05-23 09:22:05,442 INFO L146 ILogger]: 0 DeclaredPredicates, 103 GetRequests, 62 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,442 INFO L146 ILogger]: Start minimizeSevpa. Operand 110 states. [2019-05-23 09:22:05,446 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 110 to 95. [2019-05-23 09:22:05,446 INFO L146 ILogger]: Start removeUnreachable. Operand 95 states. [2019-05-23 09:22:05,447 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-05-23 09:22:05,447 INFO L146 ILogger]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 84 [2019-05-23 09:22:05,448 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,448 INFO L146 ILogger]: Abstraction has 95 states and 96 transitions. [2019-05-23 09:22:05,448 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:05,448 INFO L146 ILogger]: Start isEmpty. Operand 95 states and 96 transitions. [2019-05-23 09:22:05,449 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 92 [2019-05-23 09:22:05,449 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,449 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] [2019-05-23 09:22:05,450 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,450 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,450 INFO L146 ILogger]: Analyzing trace with hash -510667695, now seen corresponding path program 11 times [2019-05-23 09:22:05,451 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,471 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,474 INFO L146 ILogger]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,478 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,123 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:06,124 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,124 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:06,124 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:06,124 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:06,125 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:06,125 INFO L146 ILogger]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2019-05-23 09:22:06,592 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,593 INFO L146 ILogger]: Finished difference Result 117 states and 118 transitions. [2019-05-23 09:22:06,593 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:06,594 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 91 [2019-05-23 09:22:06,594 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,595 INFO L146 ILogger]: With dead ends: 117 [2019-05-23 09:22:06,596 INFO L146 ILogger]: Without dead ends: 117 [2019-05-23 09:22:06,598 INFO L146 ILogger]: 0 DeclaredPredicates, 112 GetRequests, 67 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,598 INFO L146 ILogger]: Start minimizeSevpa. Operand 117 states. [2019-05-23 09:22:06,602 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 117 to 102. [2019-05-23 09:22:06,602 INFO L146 ILogger]: Start removeUnreachable. Operand 102 states. [2019-05-23 09:22:06,603 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-05-23 09:22:06,603 INFO L146 ILogger]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 91 [2019-05-23 09:22:06,603 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,603 INFO L146 ILogger]: Abstraction has 102 states and 103 transitions. [2019-05-23 09:22:06,604 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:06,604 INFO L146 ILogger]: Start isEmpty. Operand 102 states and 103 transitions. [2019-05-23 09:22:06,605 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 09:22:06,605 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,605 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] [2019-05-23 09:22:06,605 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,605 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,606 INFO L146 ILogger]: Analyzing trace with hash 1928977310, now seen corresponding path program 12 times [2019-05-23 09:22:06,606 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,637 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,642 INFO L146 ILogger]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,652 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,981 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,982 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,982 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:06,982 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:06,982 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:06,983 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:06,983 INFO L146 ILogger]: Start difference. First operand 102 states and 103 transitions. Second operand 27 states. [2019-05-23 09:22:07,453 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,453 INFO L146 ILogger]: Finished difference Result 124 states and 125 transitions. [2019-05-23 09:22:07,461 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:07,461 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 98 [2019-05-23 09:22:07,461 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,462 INFO L146 ILogger]: With dead ends: 124 [2019-05-23 09:22:07,462 INFO L146 ILogger]: Without dead ends: 124 [2019-05-23 09:22:07,463 INFO L146 ILogger]: 0 DeclaredPredicates, 121 GetRequests, 72 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,464 INFO L146 ILogger]: Start minimizeSevpa. Operand 124 states. [2019-05-23 09:22:07,469 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 124 to 109. [2019-05-23 09:22:07,470 INFO L146 ILogger]: Start removeUnreachable. Operand 109 states. [2019-05-23 09:22:07,470 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-05-23 09:22:07,470 INFO L146 ILogger]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 98 [2019-05-23 09:22:07,476 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,476 INFO L146 ILogger]: Abstraction has 109 states and 110 transitions. [2019-05-23 09:22:07,476 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:07,477 INFO L146 ILogger]: Start isEmpty. Operand 109 states and 110 transitions. [2019-05-23 09:22:07,478 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 106 [2019-05-23 09:22:07,478 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,478 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] [2019-05-23 09:22:07,479 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,479 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,479 INFO L146 ILogger]: Analyzing trace with hash -1119587407, now seen corresponding path program 13 times [2019-05-23 09:22:07,481 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,522 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,530 INFO L146 ILogger]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,535 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,102 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,102 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,102 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:08,102 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:08,103 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:08,103 INFO L146 ILogger]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:08,103 INFO L146 ILogger]: Start difference. First operand 109 states and 110 transitions. Second operand 29 states. [2019-05-23 09:22:08,915 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,916 INFO L146 ILogger]: Finished difference Result 131 states and 132 transitions. [2019-05-23 09:22:08,916 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:08,916 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 105 [2019-05-23 09:22:08,917 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,918 INFO L146 ILogger]: With dead ends: 131 [2019-05-23 09:22:08,918 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:22:08,920 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:08,921 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:22:08,923 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 116. [2019-05-23 09:22:08,923 INFO L146 ILogger]: Start removeUnreachable. Operand 116 states. [2019-05-23 09:22:08,924 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-05-23 09:22:08,924 INFO L146 ILogger]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 105 [2019-05-23 09:22:08,924 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,925 INFO L146 ILogger]: Abstraction has 116 states and 117 transitions. [2019-05-23 09:22:08,925 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:08,925 INFO L146 ILogger]: Start isEmpty. Operand 116 states and 117 transitions. [2019-05-23 09:22:08,925 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 113 [2019-05-23 09:22:08,926 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,926 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] [2019-05-23 09:22:08,926 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,926 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,926 INFO L146 ILogger]: Analyzing trace with hash -1810550722, now seen corresponding path program 14 times [2019-05-23 09:22:08,927 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,946 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,948 INFO L146 ILogger]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,951 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,313 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,313 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,313 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:09,314 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:09,314 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:09,314 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:09,315 INFO L146 ILogger]: Start difference. First operand 116 states and 117 transitions. Second operand 31 states. [2019-05-23 09:22:09,943 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,943 INFO L146 ILogger]: Finished difference Result 138 states and 139 transitions. [2019-05-23 09:22:09,943 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:22:09,944 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 112 [2019-05-23 09:22:09,944 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,945 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 09:22:09,945 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 09:22:09,947 INFO L146 ILogger]: 0 DeclaredPredicates, 139 GetRequests, 82 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:09,947 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 09:22:09,949 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 123. [2019-05-23 09:22:09,950 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 09:22:09,950 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-05-23 09:22:09,950 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 112 [2019-05-23 09:22:09,951 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,951 INFO L146 ILogger]: Abstraction has 123 states and 124 transitions. [2019-05-23 09:22:09,951 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:09,951 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 124 transitions. [2019-05-23 09:22:09,952 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 120 [2019-05-23 09:22:09,952 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,952 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] [2019-05-23 09:22:09,952 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,952 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,952 INFO L146 ILogger]: Analyzing trace with hash 121547537, now seen corresponding path program 15 times [2019-05-23 09:22:09,953 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,972 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,975 INFO L146 ILogger]: Trace formula consists of 171 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,977 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,421 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:10,421 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,421 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:10,422 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:10,422 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:10,423 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:10,423 INFO L146 ILogger]: Start difference. First operand 123 states and 124 transitions. Second operand 33 states. [2019-05-23 09:22:11,524 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,525 INFO L146 ILogger]: Finished difference Result 145 states and 146 transitions. [2019-05-23 09:22:11,525 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:22:11,525 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 119 [2019-05-23 09:22:11,526 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,526 INFO L146 ILogger]: With dead ends: 145 [2019-05-23 09:22:11,527 INFO L146 ILogger]: Without dead ends: 145 [2019-05-23 09:22:11,529 INFO L146 ILogger]: 0 DeclaredPredicates, 148 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:11,529 INFO L146 ILogger]: Start minimizeSevpa. Operand 145 states. [2019-05-23 09:22:11,530 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 145 to 130. [2019-05-23 09:22:11,530 INFO L146 ILogger]: Start removeUnreachable. Operand 130 states. [2019-05-23 09:22:11,531 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-05-23 09:22:11,531 INFO L146 ILogger]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 119 [2019-05-23 09:22:11,531 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,532 INFO L146 ILogger]: Abstraction has 130 states and 131 transitions. [2019-05-23 09:22:11,532 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:11,532 INFO L146 ILogger]: Start isEmpty. Operand 130 states and 131 transitions. [2019-05-23 09:22:11,532 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 127 [2019-05-23 09:22:11,533 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,533 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] [2019-05-23 09:22:11,533 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,533 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,534 INFO L146 ILogger]: Analyzing trace with hash 1374678238, now seen corresponding path program 16 times [2019-05-23 09:22:11,534 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,552 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,554 INFO L146 ILogger]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,557 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,222 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,222 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,222 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:12,223 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:12,223 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:12,224 INFO L146 ILogger]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:12,224 INFO L146 ILogger]: Start difference. First operand 130 states and 131 transitions. Second operand 35 states. [2019-05-23 09:22:12,965 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,965 INFO L146 ILogger]: Finished difference Result 152 states and 153 transitions. [2019-05-23 09:22:12,965 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:22:12,965 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 126 [2019-05-23 09:22:12,966 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,967 INFO L146 ILogger]: With dead ends: 152 [2019-05-23 09:22:12,967 INFO L146 ILogger]: Without dead ends: 152 [2019-05-23 09:22:12,969 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:12,970 INFO L146 ILogger]: Start minimizeSevpa. Operand 152 states. [2019-05-23 09:22:12,971 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 152 to 137. [2019-05-23 09:22:12,972 INFO L146 ILogger]: Start removeUnreachable. Operand 137 states. [2019-05-23 09:22:12,972 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-05-23 09:22:12,972 INFO L146 ILogger]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2019-05-23 09:22:12,973 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,973 INFO L146 ILogger]: Abstraction has 137 states and 138 transitions. [2019-05-23 09:22:12,973 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:12,973 INFO L146 ILogger]: Start isEmpty. Operand 137 states and 138 transitions. [2019-05-23 09:22:12,974 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:22:12,974 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,974 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] [2019-05-23 09:22:12,974 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,974 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,974 INFO L146 ILogger]: Analyzing trace with hash 701790833, now seen corresponding path program 17 times [2019-05-23 09:22:12,975 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,993 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,995 INFO L146 ILogger]: Trace formula consists of 191 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,998 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,478 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,478 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,478 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:13,479 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:13,479 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:13,480 INFO L146 ILogger]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:13,480 INFO L146 ILogger]: Start difference. First operand 137 states and 138 transitions. Second operand 37 states. [2019-05-23 09:22:14,399 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,399 INFO L146 ILogger]: Finished difference Result 159 states and 160 transitions. [2019-05-23 09:22:14,400 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:22:14,400 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 133 [2019-05-23 09:22:14,400 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,402 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 09:22:14,402 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:22:14,404 INFO L146 ILogger]: 0 DeclaredPredicates, 166 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:22:14,404 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:22:14,406 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 144. [2019-05-23 09:22:14,406 INFO L146 ILogger]: Start removeUnreachable. Operand 144 states. [2019-05-23 09:22:14,407 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-05-23 09:22:14,407 INFO L146 ILogger]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 133 [2019-05-23 09:22:14,407 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,407 INFO L146 ILogger]: Abstraction has 144 states and 145 transitions. [2019-05-23 09:22:14,408 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:14,408 INFO L146 ILogger]: Start isEmpty. Operand 144 states and 145 transitions. [2019-05-23 09:22:14,408 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 141 [2019-05-23 09:22:14,408 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,409 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] [2019-05-23 09:22:14,409 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,409 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,409 INFO L146 ILogger]: Analyzing trace with hash 359928190, now seen corresponding path program 18 times [2019-05-23 09:22:14,410 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,427 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,429 INFO L146 ILogger]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,431 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,901 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,901 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,901 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:14,902 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:14,902 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:14,903 INFO L146 ILogger]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:14,903 INFO L146 ILogger]: Start difference. First operand 144 states and 145 transitions. Second operand 39 states. [2019-05-23 09:22:15,764 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:15,765 INFO L146 ILogger]: Finished difference Result 166 states and 167 transitions. [2019-05-23 09:22:15,765 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:22:15,765 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 140 [2019-05-23 09:22:15,765 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:15,766 INFO L146 ILogger]: With dead ends: 166 [2019-05-23 09:22:15,766 INFO L146 ILogger]: Without dead ends: 166 [2019-05-23 09:22:15,768 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:22:15,769 INFO L146 ILogger]: Start minimizeSevpa. Operand 166 states. [2019-05-23 09:22:15,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 166 to 151. [2019-05-23 09:22:15,771 INFO L146 ILogger]: Start removeUnreachable. Operand 151 states. [2019-05-23 09:22:15,772 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-05-23 09:22:15,772 INFO L146 ILogger]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 140 [2019-05-23 09:22:15,773 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:15,773 INFO L146 ILogger]: Abstraction has 151 states and 152 transitions. [2019-05-23 09:22:15,773 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:15,773 INFO L146 ILogger]: Start isEmpty. Operand 151 states and 152 transitions. [2019-05-23 09:22:15,774 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 148 [2019-05-23 09:22:15,774 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:15,774 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] [2019-05-23 09:22:15,774 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:15,774 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:15,774 INFO L146 ILogger]: Analyzing trace with hash -1059331631, now seen corresponding path program 19 times [2019-05-23 09:22:15,775 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:15,792 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:15,794 INFO L146 ILogger]: Trace formula consists of 211 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:22:15,796 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,590 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,590 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,590 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:16,591 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:16,591 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:16,592 INFO L146 ILogger]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:16,592 INFO L146 ILogger]: Start difference. First operand 151 states and 152 transitions. Second operand 41 states. [2019-05-23 09:22:17,866 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,866 INFO L146 ILogger]: Finished difference Result 173 states and 174 transitions. [2019-05-23 09:22:17,866 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:22:17,867 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 147 [2019-05-23 09:22:17,867 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,868 INFO L146 ILogger]: With dead ends: 173 [2019-05-23 09:22:17,868 INFO L146 ILogger]: Without dead ends: 173 [2019-05-23 09:22:17,871 INFO L146 ILogger]: 0 DeclaredPredicates, 184 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:22:17,871 INFO L146 ILogger]: Start minimizeSevpa. Operand 173 states. [2019-05-23 09:22:17,873 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-05-23 09:22:17,873 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:22:17,873 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-05-23 09:22:17,874 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 147 [2019-05-23 09:22:17,874 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,874 INFO L146 ILogger]: Abstraction has 158 states and 159 transitions. [2019-05-23 09:22:17,874 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:17,874 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 159 transitions. [2019-05-23 09:22:17,875 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 09:22:17,875 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,875 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] [2019-05-23 09:22:17,875 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,876 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,876 INFO L146 ILogger]: Analyzing trace with hash 1712037406, now seen corresponding path program 20 times [2019-05-23 09:22:17,877 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,893 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,895 INFO L146 ILogger]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,898 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,539 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,550 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,550 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:22:18,551 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:18,551 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:18,552 INFO L146 ILogger]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:18,552 INFO L146 ILogger]: Start difference. First operand 158 states and 159 transitions. Second operand 43 states. [2019-05-23 09:22:19,562 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,563 INFO L146 ILogger]: Finished difference Result 180 states and 181 transitions. [2019-05-23 09:22:19,563 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:22:19,563 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 154 [2019-05-23 09:22:19,564 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,565 INFO L146 ILogger]: With dead ends: 180 [2019-05-23 09:22:19,565 INFO L146 ILogger]: Without dead ends: 180 [2019-05-23 09:22:19,568 INFO L146 ILogger]: 0 DeclaredPredicates, 193 GetRequests, 112 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,568 INFO L146 ILogger]: Start minimizeSevpa. Operand 180 states. [2019-05-23 09:22:19,570 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 180 to 165. [2019-05-23 09:22:19,570 INFO L146 ILogger]: Start removeUnreachable. Operand 165 states. [2019-05-23 09:22:19,571 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-05-23 09:22:19,571 INFO L146 ILogger]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 154 [2019-05-23 09:22:19,571 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,572 INFO L146 ILogger]: Abstraction has 165 states and 166 transitions. [2019-05-23 09:22:19,572 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:19,572 INFO L146 ILogger]: Start isEmpty. Operand 165 states and 166 transitions. [2019-05-23 09:22:19,572 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 162 [2019-05-23 09:22:19,573 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,573 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] [2019-05-23 09:22:19,573 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,573 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,573 INFO L146 ILogger]: Analyzing trace with hash -106241743, now seen corresponding path program 21 times [2019-05-23 09:22:19,574 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,590 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,592 INFO L146 ILogger]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,594 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,383 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,383 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,383 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:22:20,384 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:22:20,384 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:22:20,384 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:20,384 INFO L146 ILogger]: Start difference. First operand 165 states and 166 transitions. Second operand 45 states. [2019-05-23 09:22:21,794 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,794 INFO L146 ILogger]: Finished difference Result 187 states and 188 transitions. [2019-05-23 09:22:21,797 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:22:21,797 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 161 [2019-05-23 09:22:21,798 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,798 INFO L146 ILogger]: With dead ends: 187 [2019-05-23 09:22:21,799 INFO L146 ILogger]: Without dead ends: 187 [2019-05-23 09:22:21,799 INFO L146 ILogger]: 0 DeclaredPredicates, 202 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:22:21,800 INFO L146 ILogger]: Start minimizeSevpa. Operand 187 states. [2019-05-23 09:22:21,801 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-05-23 09:22:21,802 INFO L146 ILogger]: Start removeUnreachable. Operand 172 states. [2019-05-23 09:22:21,802 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2019-05-23 09:22:21,802 INFO L146 ILogger]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 161 [2019-05-23 09:22:21,803 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,803 INFO L146 ILogger]: Abstraction has 172 states and 173 transitions. [2019-05-23 09:22:21,803 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:22:21,803 INFO L146 ILogger]: Start isEmpty. Operand 172 states and 173 transitions. [2019-05-23 09:22:21,804 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 169 [2019-05-23 09:22:21,804 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,804 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] [2019-05-23 09:22:21,804 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,804 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,805 INFO L146 ILogger]: Analyzing trace with hash -1985965378, now seen corresponding path program 22 times [2019-05-23 09:22:21,805 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,823 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,825 INFO L146 ILogger]: Trace formula consists of 241 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,828 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:22,465 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,465 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,465 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:22:22,466 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:22:22,466 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:22:22,466 INFO L146 ILogger]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:22,466 INFO L146 ILogger]: Start difference. First operand 172 states and 173 transitions. Second operand 47 states. [2019-05-23 09:22:23,777 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:23,777 INFO L146 ILogger]: Finished difference Result 194 states and 195 transitions. [2019-05-23 09:22:23,778 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:22:23,778 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 168 [2019-05-23 09:22:23,778 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:23,779 INFO L146 ILogger]: With dead ends: 194 [2019-05-23 09:22:23,780 INFO L146 ILogger]: Without dead ends: 194 [2019-05-23 09:22:23,781 INFO L146 ILogger]: 0 DeclaredPredicates, 211 GetRequests, 122 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,781 INFO L146 ILogger]: Start minimizeSevpa. Operand 194 states. [2019-05-23 09:22:23,783 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 194 to 179. [2019-05-23 09:22:23,784 INFO L146 ILogger]: Start removeUnreachable. Operand 179 states. [2019-05-23 09:22:23,784 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-05-23 09:22:23,785 INFO L146 ILogger]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 168 [2019-05-23 09:22:23,785 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:23,785 INFO L146 ILogger]: Abstraction has 179 states and 180 transitions. [2019-05-23 09:22:23,785 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:22:23,785 INFO L146 ILogger]: Start isEmpty. Operand 179 states and 180 transitions. [2019-05-23 09:22:23,786 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 176 [2019-05-23 09:22:23,786 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:23,786 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] [2019-05-23 09:22:23,787 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:23,787 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,787 INFO L146 ILogger]: Analyzing trace with hash -216565615, now seen corresponding path program 23 times [2019-05-23 09:22:23,788 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,804 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:23,806 INFO L146 ILogger]: Trace formula consists of 251 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:23,809 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:24,555 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,555 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:24,555 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:22:24,555 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:22:24,556 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:22:24,556 INFO L146 ILogger]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:24,556 INFO L146 ILogger]: Start difference. First operand 179 states and 180 transitions. Second operand 49 states. [2019-05-23 09:22:25,815 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,815 INFO L146 ILogger]: Finished difference Result 201 states and 202 transitions. [2019-05-23 09:22:25,815 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:22:25,816 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 175 [2019-05-23 09:22:25,816 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,817 INFO L146 ILogger]: With dead ends: 201 [2019-05-23 09:22:25,817 INFO L146 ILogger]: Without dead ends: 201 [2019-05-23 09:22:25,818 INFO L146 ILogger]: 0 DeclaredPredicates, 220 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:22:25,819 INFO L146 ILogger]: Start minimizeSevpa. Operand 201 states. [2019-05-23 09:22:25,821 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 201 to 186. [2019-05-23 09:22:25,822 INFO L146 ILogger]: Start removeUnreachable. Operand 186 states. [2019-05-23 09:22:25,822 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-05-23 09:22:25,822 INFO L146 ILogger]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 175 [2019-05-23 09:22:25,823 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,823 INFO L146 ILogger]: Abstraction has 186 states and 187 transitions. [2019-05-23 09:22:25,823 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:22:25,823 INFO L146 ILogger]: Start isEmpty. Operand 186 states and 187 transitions. [2019-05-23 09:22:25,824 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 09:22:25,824 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,824 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] [2019-05-23 09:22:25,824 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,824 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,825 INFO L146 ILogger]: Analyzing trace with hash 614264670, now seen corresponding path program 24 times [2019-05-23 09:22:25,825 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,842 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,845 INFO L146 ILogger]: Trace formula consists of 261 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,847 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:26,857 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:26,858 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:26,858 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:22:26,858 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:22:26,858 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:22:26,859 INFO L146 ILogger]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:26,859 INFO L146 ILogger]: Start difference. First operand 186 states and 187 transitions. Second operand 51 states. [2019-05-23 09:22:28,209 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:28,209 INFO L146 ILogger]: Finished difference Result 208 states and 209 transitions. [2019-05-23 09:22:28,219 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:22:28,219 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 182 [2019-05-23 09:22:28,220 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:28,220 INFO L146 ILogger]: With dead ends: 208 [2019-05-23 09:22:28,221 INFO L146 ILogger]: Without dead ends: 208 [2019-05-23 09:22:28,222 INFO L146 ILogger]: 0 DeclaredPredicates, 229 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:22:28,223 INFO L146 ILogger]: Start minimizeSevpa. Operand 208 states. [2019-05-23 09:22:28,225 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 208 to 193. [2019-05-23 09:22:28,225 INFO L146 ILogger]: Start removeUnreachable. Operand 193 states. [2019-05-23 09:22:28,226 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-05-23 09:22:28,226 INFO L146 ILogger]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 182 [2019-05-23 09:22:28,226 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:28,226 INFO L146 ILogger]: Abstraction has 193 states and 194 transitions. [2019-05-23 09:22:28,226 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:22:28,226 INFO L146 ILogger]: Start isEmpty. Operand 193 states and 194 transitions. [2019-05-23 09:22:28,227 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 190 [2019-05-23 09:22:28,227 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:28,228 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] [2019-05-23 09:22:28,228 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:28,228 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:28,228 INFO L146 ILogger]: Analyzing trace with hash 494381041, now seen corresponding path program 25 times [2019-05-23 09:22:28,229 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:28,248 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:28,250 INFO L146 ILogger]: Trace formula consists of 271 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:22:28,253 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,101 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,102 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:29,102 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:22:29,102 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:22:29,103 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:22:29,103 INFO L146 ILogger]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:29,103 INFO L146 ILogger]: Start difference. First operand 193 states and 194 transitions. Second operand 53 states. [2019-05-23 09:22:30,854 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:30,854 INFO L146 ILogger]: Finished difference Result 215 states and 216 transitions. [2019-05-23 09:22:30,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:22:30,854 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 189 [2019-05-23 09:22:30,855 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:30,855 INFO L146 ILogger]: With dead ends: 215 [2019-05-23 09:22:30,855 INFO L146 ILogger]: Without dead ends: 215 [2019-05-23 09:22:30,859 INFO L146 ILogger]: 0 DeclaredPredicates, 238 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:22:30,859 INFO L146 ILogger]: Start minimizeSevpa. Operand 215 states. [2019-05-23 09:22:30,862 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 215 to 200. [2019-05-23 09:22:30,862 INFO L146 ILogger]: Start removeUnreachable. Operand 200 states. [2019-05-23 09:22:30,863 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-05-23 09:22:30,863 INFO L146 ILogger]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 189 [2019-05-23 09:22:30,863 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:30,864 INFO L146 ILogger]: Abstraction has 200 states and 201 transitions. [2019-05-23 09:22:30,864 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:22:30,864 INFO L146 ILogger]: Start isEmpty. Operand 200 states and 201 transitions. [2019-05-23 09:22:30,865 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 197 [2019-05-23 09:22:30,865 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:30,865 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] [2019-05-23 09:22:30,865 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:30,865 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:30,866 INFO L146 ILogger]: Analyzing trace with hash -638929922, now seen corresponding path program 26 times [2019-05-23 09:22:30,866 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:30,885 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:30,889 INFO L146 ILogger]: Trace formula consists of 281 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:30,892 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,065 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:33,065 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,065 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:22:33,065 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:22:33,066 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:22:33,066 INFO L146 ILogger]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:33,066 INFO L146 ILogger]: Start difference. First operand 200 states and 201 transitions. Second operand 55 states. [2019-05-23 09:22:34,807 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:34,808 INFO L146 ILogger]: Finished difference Result 222 states and 223 transitions. [2019-05-23 09:22:34,808 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:22:34,808 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 196 [2019-05-23 09:22:34,809 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:34,810 INFO L146 ILogger]: With dead ends: 222 [2019-05-23 09:22:34,810 INFO L146 ILogger]: Without dead ends: 222 [2019-05-23 09:22:34,811 INFO L146 ILogger]: 0 DeclaredPredicates, 247 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:22:34,811 INFO L146 ILogger]: Start minimizeSevpa. Operand 222 states. [2019-05-23 09:22:34,814 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 222 to 207. [2019-05-23 09:22:34,814 INFO L146 ILogger]: Start removeUnreachable. Operand 207 states. [2019-05-23 09:22:34,815 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-05-23 09:22:34,815 INFO L146 ILogger]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 196 [2019-05-23 09:22:34,815 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:34,816 INFO L146 ILogger]: Abstraction has 207 states and 208 transitions. [2019-05-23 09:22:34,816 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:22:34,816 INFO L146 ILogger]: Start isEmpty. Operand 207 states and 208 transitions. [2019-05-23 09:22:34,817 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 204 [2019-05-23 09:22:34,817 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:34,817 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] [2019-05-23 09:22:34,817 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:34,817 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:34,818 INFO L146 ILogger]: Analyzing trace with hash -1700696239, now seen corresponding path program 27 times [2019-05-23 09:22:34,818 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:34,838 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:34,841 INFO L146 ILogger]: Trace formula consists of 291 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:22:34,844 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,649 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:36,650 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:36,650 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:22:36,650 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:22:36,651 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:22:36,651 INFO L146 ILogger]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:36,651 INFO L146 ILogger]: Start difference. First operand 207 states and 208 transitions. Second operand 57 states. [2019-05-23 09:22:38,318 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:38,318 INFO L146 ILogger]: Finished difference Result 229 states and 230 transitions. [2019-05-23 09:22:38,319 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:22:38,319 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 203 [2019-05-23 09:22:38,320 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:38,321 INFO L146 ILogger]: With dead ends: 229 [2019-05-23 09:22:38,322 INFO L146 ILogger]: Without dead ends: 229 [2019-05-23 09:22:38,323 INFO L146 ILogger]: 0 DeclaredPredicates, 256 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:22:38,323 INFO L146 ILogger]: Start minimizeSevpa. Operand 229 states. [2019-05-23 09:22:38,326 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 229 to 214. [2019-05-23 09:22:38,326 INFO L146 ILogger]: Start removeUnreachable. Operand 214 states. [2019-05-23 09:22:38,327 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2019-05-23 09:22:38,327 INFO L146 ILogger]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 203 [2019-05-23 09:22:38,327 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:38,328 INFO L146 ILogger]: Abstraction has 214 states and 215 transitions. [2019-05-23 09:22:38,328 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:22:38,328 INFO L146 ILogger]: Start isEmpty. Operand 214 states and 215 transitions. [2019-05-23 09:22:38,329 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 211 [2019-05-23 09:22:38,329 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:38,329 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] [2019-05-23 09:22:38,329 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:38,329 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:38,330 INFO L146 ILogger]: Analyzing trace with hash -353116002, now seen corresponding path program 28 times [2019-05-23 09:22:38,330 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:38,349 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:38,352 INFO L146 ILogger]: Trace formula consists of 301 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:38,355 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:39,495 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:39,496 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:39,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:22:39,497 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:22:39,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:22:39,497 INFO L146 ILogger]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:39,500 INFO L146 ILogger]: Start difference. First operand 214 states and 215 transitions. Second operand 59 states. [2019-05-23 09:22:41,352 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:41,352 INFO L146 ILogger]: Finished difference Result 236 states and 237 transitions. [2019-05-23 09:22:41,353 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:22:41,353 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 210 [2019-05-23 09:22:41,353 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:41,354 INFO L146 ILogger]: With dead ends: 236 [2019-05-23 09:22:41,354 INFO L146 ILogger]: Without dead ends: 236 [2019-05-23 09:22:41,355 INFO L146 ILogger]: 0 DeclaredPredicates, 265 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:22:41,356 INFO L146 ILogger]: Start minimizeSevpa. Operand 236 states. [2019-05-23 09:22:41,359 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 236 to 221. [2019-05-23 09:22:41,359 INFO L146 ILogger]: Start removeUnreachable. Operand 221 states. [2019-05-23 09:22:41,360 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2019-05-23 09:22:41,360 INFO L146 ILogger]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 210 [2019-05-23 09:22:41,360 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:41,360 INFO L146 ILogger]: Abstraction has 221 states and 222 transitions. [2019-05-23 09:22:41,361 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:22:41,361 INFO L146 ILogger]: Start isEmpty. Operand 221 states and 222 transitions. [2019-05-23 09:22:41,362 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 218 [2019-05-23 09:22:41,362 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:41,362 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] [2019-05-23 09:22:41,362 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:41,362 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:41,363 INFO L146 ILogger]: Analyzing trace with hash -1645556047, now seen corresponding path program 29 times [2019-05-23 09:22:41,363 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:41,380 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:41,383 INFO L146 ILogger]: Trace formula consists of 311 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:41,386 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,581 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,581 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,581 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:22:42,582 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:22:42,582 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:22:42,582 INFO L146 ILogger]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:42,582 INFO L146 ILogger]: Start difference. First operand 221 states and 222 transitions. Second operand 61 states. [2019-05-23 09:22:45,642 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:45,643 INFO L146 ILogger]: Finished difference Result 243 states and 244 transitions. [2019-05-23 09:22:45,643 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:22:45,643 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 217 [2019-05-23 09:22:45,644 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:45,645 INFO L146 ILogger]: With dead ends: 243 [2019-05-23 09:22:45,646 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 09:22:45,647 INFO L146 ILogger]: 0 DeclaredPredicates, 274 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:22:45,647 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 09:22:45,650 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 228. [2019-05-23 09:22:45,650 INFO L146 ILogger]: Start removeUnreachable. Operand 228 states. [2019-05-23 09:22:45,650 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2019-05-23 09:22:45,651 INFO L146 ILogger]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 217 [2019-05-23 09:22:45,651 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:45,651 INFO L146 ILogger]: Abstraction has 228 states and 229 transitions. [2019-05-23 09:22:45,651 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:22:45,651 INFO L146 ILogger]: Start isEmpty. Operand 228 states and 229 transitions. [2019-05-23 09:22:45,652 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 225 [2019-05-23 09:22:45,652 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:45,652 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] [2019-05-23 09:22:45,653 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:45,653 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:45,653 INFO L146 ILogger]: Analyzing trace with hash -677219010, now seen corresponding path program 30 times [2019-05-23 09:22:45,654 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:45,671 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:45,674 INFO L146 ILogger]: Trace formula consists of 321 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:22:45,677 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:46,996 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,996 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:46,996 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:22:46,996 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:22:46,997 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:22:46,997 INFO L146 ILogger]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:46,997 INFO L146 ILogger]: Start difference. First operand 228 states and 229 transitions. Second operand 63 states. [2019-05-23 09:22:48,960 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:48,960 INFO L146 ILogger]: Finished difference Result 250 states and 251 transitions. [2019-05-23 09:22:48,960 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:22:48,961 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 224 [2019-05-23 09:22:48,961 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:48,963 INFO L146 ILogger]: With dead ends: 250 [2019-05-23 09:22:48,963 INFO L146 ILogger]: Without dead ends: 250 [2019-05-23 09:22:48,964 INFO L146 ILogger]: 0 DeclaredPredicates, 283 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:22:48,965 INFO L146 ILogger]: Start minimizeSevpa. Operand 250 states. [2019-05-23 09:22:48,967 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 250 to 235. [2019-05-23 09:22:48,967 INFO L146 ILogger]: Start removeUnreachable. Operand 235 states. [2019-05-23 09:22:48,968 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2019-05-23 09:22:48,968 INFO L146 ILogger]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 224 [2019-05-23 09:22:48,968 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:48,968 INFO L146 ILogger]: Abstraction has 235 states and 236 transitions. [2019-05-23 09:22:48,968 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:22:48,968 INFO L146 ILogger]: Start isEmpty. Operand 235 states and 236 transitions. [2019-05-23 09:22:48,969 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 232 [2019-05-23 09:22:48,970 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:48,970 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] [2019-05-23 09:22:48,970 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:48,970 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:48,970 INFO L146 ILogger]: Analyzing trace with hash -869677551, now seen corresponding path program 31 times [2019-05-23 09:22:48,971 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:48,990 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:48,993 INFO L146 ILogger]: Trace formula consists of 331 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:22:48,996 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:51,436 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:51,437 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:51,437 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:22:51,437 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:22:51,438 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:22:51,438 INFO L146 ILogger]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:22:51,438 INFO L146 ILogger]: Start difference. First operand 235 states and 236 transitions. Second operand 65 states. [2019-05-23 09:22:53,671 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:53,671 INFO L146 ILogger]: Finished difference Result 257 states and 258 transitions. [2019-05-23 09:22:53,671 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:22:53,672 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 231 [2019-05-23 09:22:53,672 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:53,673 INFO L146 ILogger]: With dead ends: 257 [2019-05-23 09:22:53,674 INFO L146 ILogger]: Without dead ends: 257 [2019-05-23 09:22:53,675 INFO L146 ILogger]: 0 DeclaredPredicates, 292 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:22:53,675 INFO L146 ILogger]: Start minimizeSevpa. Operand 257 states. [2019-05-23 09:22:53,678 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 257 to 242. [2019-05-23 09:22:53,678 INFO L146 ILogger]: Start removeUnreachable. Operand 242 states. [2019-05-23 09:22:53,678 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-05-23 09:22:53,678 INFO L146 ILogger]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 231 [2019-05-23 09:22:53,679 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:53,679 INFO L146 ILogger]: Abstraction has 242 states and 243 transitions. [2019-05-23 09:22:53,679 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:22:53,679 INFO L146 ILogger]: Start isEmpty. Operand 242 states and 243 transitions. [2019-05-23 09:22:53,680 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 239 [2019-05-23 09:22:53,680 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:53,680 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] [2019-05-23 09:22:53,681 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:53,681 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:53,681 INFO L146 ILogger]: Analyzing trace with hash -27233826, now seen corresponding path program 32 times [2019-05-23 09:22:53,682 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:53,701 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:53,703 INFO L146 ILogger]: Trace formula consists of 341 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:53,707 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,917 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,917 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,917 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:22:54,918 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:22:54,918 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:22:54,919 INFO L146 ILogger]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:54,919 INFO L146 ILogger]: Start difference. First operand 242 states and 243 transitions. Second operand 67 states. [2019-05-23 09:22:57,525 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:57,525 INFO L146 ILogger]: Finished difference Result 264 states and 265 transitions. [2019-05-23 09:22:57,526 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:22:57,526 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 238 [2019-05-23 09:22:57,526 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:57,527 INFO L146 ILogger]: With dead ends: 264 [2019-05-23 09:22:57,528 INFO L146 ILogger]: Without dead ends: 264 [2019-05-23 09:22:57,530 INFO L146 ILogger]: 0 DeclaredPredicates, 301 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:22:57,530 INFO L146 ILogger]: Start minimizeSevpa. Operand 264 states. [2019-05-23 09:22:57,532 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 264 to 249. [2019-05-23 09:22:57,532 INFO L146 ILogger]: Start removeUnreachable. Operand 249 states. [2019-05-23 09:22:57,533 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2019-05-23 09:22:57,533 INFO L146 ILogger]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 238 [2019-05-23 09:22:57,533 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:57,533 INFO L146 ILogger]: Abstraction has 249 states and 250 transitions. [2019-05-23 09:22:57,534 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:22:57,534 INFO L146 ILogger]: Start isEmpty. Operand 249 states and 250 transitions. [2019-05-23 09:22:57,535 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 246 [2019-05-23 09:22:57,535 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:57,535 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] [2019-05-23 09:22:57,535 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:57,535 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:57,536 INFO L146 ILogger]: Analyzing trace with hash -1682680463, now seen corresponding path program 33 times [2019-05-23 09:22:57,536 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:57,556 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:57,559 INFO L146 ILogger]: Trace formula consists of 351 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:22:57,562 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:59,832 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:59,833 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:59,833 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:22:59,833 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:22:59,834 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:22:59,834 INFO L146 ILogger]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:22:59,834 INFO L146 ILogger]: Start difference. First operand 249 states and 250 transitions. Second operand 69 states. [2019-05-23 09:23:02,430 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:02,430 INFO L146 ILogger]: Finished difference Result 271 states and 272 transitions. [2019-05-23 09:23:02,430 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:23:02,431 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 245 [2019-05-23 09:23:02,431 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:02,432 INFO L146 ILogger]: With dead ends: 271 [2019-05-23 09:23:02,432 INFO L146 ILogger]: Without dead ends: 271 [2019-05-23 09:23:02,433 INFO L146 ILogger]: 0 DeclaredPredicates, 310 GetRequests, 177 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:02,433 INFO L146 ILogger]: Start minimizeSevpa. Operand 271 states. [2019-05-23 09:23:02,436 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 271 to 256. [2019-05-23 09:23:02,436 INFO L146 ILogger]: Start removeUnreachable. Operand 256 states. [2019-05-23 09:23:02,436 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-05-23 09:23:02,436 INFO L146 ILogger]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 245 [2019-05-23 09:23:02,437 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:02,437 INFO L146 ILogger]: Abstraction has 256 states and 257 transitions. [2019-05-23 09:23:02,437 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:23:02,437 INFO L146 ILogger]: Start isEmpty. Operand 256 states and 257 transitions. [2019-05-23 09:23:02,438 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 253 [2019-05-23 09:23:02,438 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:02,438 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] [2019-05-23 09:23:02,438 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:02,438 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:02,438 INFO L146 ILogger]: Analyzing trace with hash 1008195198, now seen corresponding path program 34 times [2019-05-23 09:23:02,439 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:02,459 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:02,462 INFO L146 ILogger]: Trace formula consists of 361 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:23:02,465 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:03,912 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,912 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:03,913 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:23:03,913 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:23:03,913 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:23:03,914 INFO L146 ILogger]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:03,914 INFO L146 ILogger]: Start difference. First operand 256 states and 257 transitions. Second operand 71 states. [2019-05-23 09:23:06,407 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:06,407 INFO L146 ILogger]: Finished difference Result 278 states and 279 transitions. [2019-05-23 09:23:06,407 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:23:06,408 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 252 [2019-05-23 09:23:06,408 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:06,410 INFO L146 ILogger]: With dead ends: 278 [2019-05-23 09:23:06,410 INFO L146 ILogger]: Without dead ends: 278 [2019-05-23 09:23:06,411 INFO L146 ILogger]: 0 DeclaredPredicates, 319 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:23:06,411 INFO L146 ILogger]: Start minimizeSevpa. Operand 278 states. [2019-05-23 09:23:06,413 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 278 to 263. [2019-05-23 09:23:06,414 INFO L146 ILogger]: Start removeUnreachable. Operand 263 states. [2019-05-23 09:23:06,414 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-05-23 09:23:06,414 INFO L146 ILogger]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 252 [2019-05-23 09:23:06,415 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:06,415 INFO L146 ILogger]: Abstraction has 263 states and 264 transitions. [2019-05-23 09:23:06,415 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:23:06,415 INFO L146 ILogger]: Start isEmpty. Operand 263 states and 264 transitions. [2019-05-23 09:23:06,416 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 260 [2019-05-23 09:23:06,416 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:06,417 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] [2019-05-23 09:23:06,417 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:06,417 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:06,417 INFO L146 ILogger]: Analyzing trace with hash -1268745007, now seen corresponding path program 35 times [2019-05-23 09:23:06,418 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:06,440 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:06,443 INFO L146 ILogger]: Trace formula consists of 371 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:23:06,447 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:08,238 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:08,239 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:08,239 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:23:08,239 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:23:08,240 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:23:08,240 INFO L146 ILogger]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:08,240 INFO L146 ILogger]: Start difference. First operand 263 states and 264 transitions. Second operand 73 states. [2019-05-23 09:23:10,842 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:10,843 INFO L146 ILogger]: Finished difference Result 285 states and 286 transitions. [2019-05-23 09:23:10,843 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:23:10,843 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 259 [2019-05-23 09:23:10,844 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:10,844 INFO L146 ILogger]: With dead ends: 285 [2019-05-23 09:23:10,845 INFO L146 ILogger]: Without dead ends: 285 [2019-05-23 09:23:10,846 INFO L146 ILogger]: 0 DeclaredPredicates, 328 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:23:10,846 INFO L146 ILogger]: Start minimizeSevpa. Operand 285 states. [2019-05-23 09:23:10,848 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 285 to 270. [2019-05-23 09:23:10,849 INFO L146 ILogger]: Start removeUnreachable. Operand 270 states. [2019-05-23 09:23:10,849 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2019-05-23 09:23:10,849 INFO L146 ILogger]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 259 [2019-05-23 09:23:10,849 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:10,850 INFO L146 ILogger]: Abstraction has 270 states and 271 transitions. [2019-05-23 09:23:10,850 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:23:10,850 INFO L146 ILogger]: Start isEmpty. Operand 270 states and 271 transitions. [2019-05-23 09:23:10,851 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 267 [2019-05-23 09:23:10,851 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:10,851 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] [2019-05-23 09:23:10,852 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:10,852 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:10,852 INFO L146 ILogger]: Analyzing trace with hash -1942838498, now seen corresponding path program 36 times [2019-05-23 09:23:10,853 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:10,873 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:10,877 INFO L146 ILogger]: Trace formula consists of 381 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:23:10,881 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:12,545 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:12,545 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:12,545 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:23:12,546 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:23:12,546 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:23:12,547 INFO L146 ILogger]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:12,547 INFO L146 ILogger]: Start difference. First operand 270 states and 271 transitions. Second operand 75 states. [2019-05-23 09:23:15,325 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:15,325 INFO L146 ILogger]: Finished difference Result 292 states and 293 transitions. [2019-05-23 09:23:15,326 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 09:23:15,326 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 266 [2019-05-23 09:23:15,326 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:15,327 INFO L146 ILogger]: With dead ends: 292 [2019-05-23 09:23:15,327 INFO L146 ILogger]: Without dead ends: 292 [2019-05-23 09:23:15,328 INFO L146 ILogger]: 0 DeclaredPredicates, 337 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:23:15,329 INFO L146 ILogger]: Start minimizeSevpa. Operand 292 states. [2019-05-23 09:23:15,332 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 292 to 277. [2019-05-23 09:23:15,332 INFO L146 ILogger]: Start removeUnreachable. Operand 277 states. [2019-05-23 09:23:15,333 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2019-05-23 09:23:15,333 INFO L146 ILogger]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 266 [2019-05-23 09:23:15,333 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:15,333 INFO L146 ILogger]: Abstraction has 277 states and 278 transitions. [2019-05-23 09:23:15,334 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:23:15,334 INFO L146 ILogger]: Start isEmpty. Operand 277 states and 278 transitions. [2019-05-23 09:23:15,335 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 274 [2019-05-23 09:23:15,335 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:15,335 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] [2019-05-23 09:23:15,335 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:15,336 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:15,336 INFO L146 ILogger]: Analyzing trace with hash 1334066225, now seen corresponding path program 37 times [2019-05-23 09:23:15,336 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:15,357 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:15,361 INFO L146 ILogger]: Trace formula consists of 391 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:23:15,365 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:17,544 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:17,545 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:17,545 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:23:17,545 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:23:17,545 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:23:17,546 INFO L146 ILogger]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:17,546 INFO L146 ILogger]: Start difference. First operand 277 states and 278 transitions. Second operand 77 states. [2019-05-23 09:23:20,420 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:20,420 INFO L146 ILogger]: Finished difference Result 299 states and 300 transitions. [2019-05-23 09:23:20,420 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:23:20,421 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 273 [2019-05-23 09:23:20,421 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:20,422 INFO L146 ILogger]: With dead ends: 299 [2019-05-23 09:23:20,423 INFO L146 ILogger]: Without dead ends: 299 [2019-05-23 09:23:20,424 INFO L146 ILogger]: 0 DeclaredPredicates, 346 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:23:20,424 INFO L146 ILogger]: Start minimizeSevpa. Operand 299 states. [2019-05-23 09:23:20,427 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 299 to 284. [2019-05-23 09:23:20,427 INFO L146 ILogger]: Start removeUnreachable. Operand 284 states. [2019-05-23 09:23:20,428 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2019-05-23 09:23:20,428 INFO L146 ILogger]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 273 [2019-05-23 09:23:20,428 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:20,428 INFO L146 ILogger]: Abstraction has 284 states and 285 transitions. [2019-05-23 09:23:20,428 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:23:20,428 INFO L146 ILogger]: Start isEmpty. Operand 284 states and 285 transitions. [2019-05-23 09:23:20,430 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 281 [2019-05-23 09:23:20,430 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:20,430 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] [2019-05-23 09:23:20,430 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:20,430 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:20,430 INFO L146 ILogger]: Analyzing trace with hash -1466247234, now seen corresponding path program 38 times [2019-05-23 09:23:20,431 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:20,453 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:20,456 INFO L146 ILogger]: Trace formula consists of 401 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:23:20,461 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:22,260 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:22,260 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:22,261 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:23:22,261 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:23:22,262 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:23:22,262 INFO L146 ILogger]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:22,262 INFO L146 ILogger]: Start difference. First operand 284 states and 285 transitions. Second operand 79 states. [2019-05-23 09:23:25,426 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:25,426 INFO L146 ILogger]: Finished difference Result 306 states and 307 transitions. [2019-05-23 09:23:25,427 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 09:23:25,427 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 280 [2019-05-23 09:23:25,427 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:25,429 INFO L146 ILogger]: With dead ends: 306 [2019-05-23 09:23:25,429 INFO L146 ILogger]: Without dead ends: 306 [2019-05-23 09:23:25,431 INFO L146 ILogger]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:23:25,431 INFO L146 ILogger]: Start minimizeSevpa. Operand 306 states. [2019-05-23 09:23:25,433 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 306 to 291. [2019-05-23 09:23:25,433 INFO L146 ILogger]: Start removeUnreachable. Operand 291 states. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 280 [2019-05-23 09:23:25,434 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:25,435 INFO L146 ILogger]: Abstraction has 291 states and 292 transitions. [2019-05-23 09:23:25,435 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:23:25,435 INFO L146 ILogger]: Start isEmpty. Operand 291 states and 292 transitions. [2019-05-23 09:23:25,436 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 288 [2019-05-23 09:23:25,436 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:25,436 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] [2019-05-23 09:23:25,437 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:25,437 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:25,437 INFO L146 ILogger]: Analyzing trace with hash -1745513583, now seen corresponding path program 39 times [2019-05-23 09:23:25,438 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:25,460 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:25,464 INFO L146 ILogger]: Trace formula consists of 411 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:23:25,468 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:27,237 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:27,237 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:27,238 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:23:27,238 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:23:27,238 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:23:27,239 INFO L146 ILogger]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:27,239 INFO L146 ILogger]: Start difference. First operand 291 states and 292 transitions. Second operand 81 states. [2019-05-23 09:23:30,630 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:30,631 INFO L146 ILogger]: Finished difference Result 313 states and 314 transitions. [2019-05-23 09:23:30,631 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:23:30,631 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 287 [2019-05-23 09:23:30,632 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:30,633 INFO L146 ILogger]: With dead ends: 313 [2019-05-23 09:23:30,633 INFO L146 ILogger]: Without dead ends: 313 [2019-05-23 09:23:30,634 INFO L146 ILogger]: 0 DeclaredPredicates, 364 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:23:30,635 INFO L146 ILogger]: Start minimizeSevpa. Operand 313 states. [2019-05-23 09:23:30,637 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 313 to 298. [2019-05-23 09:23:30,637 INFO L146 ILogger]: Start removeUnreachable. Operand 298 states. [2019-05-23 09:23:30,638 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2019-05-23 09:23:30,638 INFO L146 ILogger]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 287 [2019-05-23 09:23:30,638 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:30,638 INFO L146 ILogger]: Abstraction has 298 states and 299 transitions. [2019-05-23 09:23:30,638 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:23:30,638 INFO L146 ILogger]: Start isEmpty. Operand 298 states and 299 transitions. [2019-05-23 09:23:30,640 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 295 [2019-05-23 09:23:30,640 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:30,640 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] [2019-05-23 09:23:30,640 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:30,641 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:30,641 INFO L146 ILogger]: Analyzing trace with hash -1447398306, now seen corresponding path program 40 times [2019-05-23 09:23:30,641 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:30,663 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:30,667 INFO L146 ILogger]: Trace formula consists of 421 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:23:30,672 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:33,149 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:33,150 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:33,150 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:23:33,150 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:23:33,151 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:23:33,151 INFO L146 ILogger]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:33,151 INFO L146 ILogger]: Start difference. First operand 298 states and 299 transitions. Second operand 83 states. [2019-05-23 09:23:36,465 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:36,465 INFO L146 ILogger]: Finished difference Result 320 states and 321 transitions. [2019-05-23 09:23:36,466 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 09:23:36,466 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 294 [2019-05-23 09:23:36,466 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:36,468 INFO L146 ILogger]: With dead ends: 320 [2019-05-23 09:23:36,468 INFO L146 ILogger]: Without dead ends: 320 [2019-05-23 09:23:36,469 INFO L146 ILogger]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:23:36,470 INFO L146 ILogger]: Start minimizeSevpa. Operand 320 states. [2019-05-23 09:23:36,472 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 320 to 305. [2019-05-23 09:23:36,472 INFO L146 ILogger]: Start removeUnreachable. Operand 305 states. [2019-05-23 09:23:36,473 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2019-05-23 09:23:36,473 INFO L146 ILogger]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 294 [2019-05-23 09:23:36,473 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:36,473 INFO L146 ILogger]: Abstraction has 305 states and 306 transitions. [2019-05-23 09:23:36,473 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:23:36,473 INFO L146 ILogger]: Start isEmpty. Operand 305 states and 306 transitions. [2019-05-23 09:23:36,475 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 302 [2019-05-23 09:23:36,475 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:36,475 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] [2019-05-23 09:23:36,475 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:36,475 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:36,475 INFO L146 ILogger]: Analyzing trace with hash 168461041, now seen corresponding path program 41 times [2019-05-23 09:23:36,476 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:36,499 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:36,503 INFO L146 ILogger]: Trace formula consists of 431 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:23:36,507 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:40,137 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:40,137 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:40,137 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:23:40,138 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:23:40,138 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:23:40,138 INFO L146 ILogger]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:40,139 INFO L146 ILogger]: Start difference. First operand 305 states and 306 transitions. Second operand 85 states. [2019-05-23 09:23:43,586 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:43,586 INFO L146 ILogger]: Finished difference Result 327 states and 328 transitions. [2019-05-23 09:23:43,586 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 09:23:43,586 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 301 [2019-05-23 09:23:43,587 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:43,588 INFO L146 ILogger]: With dead ends: 327 [2019-05-23 09:23:43,588 INFO L146 ILogger]: Without dead ends: 327 [2019-05-23 09:23:43,590 INFO L146 ILogger]: 0 DeclaredPredicates, 382 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:23:43,590 INFO L146 ILogger]: Start minimizeSevpa. Operand 327 states. [2019-05-23 09:23:43,592 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 327 to 312. [2019-05-23 09:23:43,592 INFO L146 ILogger]: Start removeUnreachable. Operand 312 states. [2019-05-23 09:23:43,592 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-05-23 09:23:43,593 INFO L146 ILogger]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 301 [2019-05-23 09:23:43,593 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:43,593 INFO L146 ILogger]: Abstraction has 312 states and 313 transitions. [2019-05-23 09:23:43,593 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:23:43,593 INFO L146 ILogger]: Start isEmpty. Operand 312 states and 313 transitions. [2019-05-23 09:23:43,594 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 309 [2019-05-23 09:23:43,594 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:43,595 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] [2019-05-23 09:23:43,595 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:43,595 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:43,595 INFO L146 ILogger]: Analyzing trace with hash -1501857538, now seen corresponding path program 42 times [2019-05-23 09:23:43,596 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:43,620 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:43,624 INFO L146 ILogger]: Trace formula consists of 441 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:23:43,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:45,803 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:45,803 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:45,804 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:23:45,804 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:23:45,804 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:23:45,805 INFO L146 ILogger]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:23:45,805 INFO L146 ILogger]: Start difference. First operand 312 states and 313 transitions. Second operand 87 states. [2019-05-23 09:23:49,768 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:49,768 INFO L146 ILogger]: Finished difference Result 334 states and 335 transitions. [2019-05-23 09:23:49,768 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 09:23:49,768 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 308 [2019-05-23 09:23:49,769 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:49,771 INFO L146 ILogger]: With dead ends: 334 [2019-05-23 09:23:49,771 INFO L146 ILogger]: Without dead ends: 334 [2019-05-23 09:23:49,773 INFO L146 ILogger]: 0 DeclaredPredicates, 391 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:23:49,773 INFO L146 ILogger]: Start minimizeSevpa. Operand 334 states. [2019-05-23 09:23:49,775 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 334 to 319. [2019-05-23 09:23:49,775 INFO L146 ILogger]: Start removeUnreachable. Operand 319 states. [2019-05-23 09:23:49,775 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-05-23 09:23:49,776 INFO L146 ILogger]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 308 [2019-05-23 09:23:49,776 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:49,776 INFO L146 ILogger]: Abstraction has 319 states and 320 transitions. [2019-05-23 09:23:49,776 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:23:49,776 INFO L146 ILogger]: Start isEmpty. Operand 319 states and 320 transitions. [2019-05-23 09:23:49,777 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 316 [2019-05-23 09:23:49,777 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:49,777 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] [2019-05-23 09:23:49,777 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:49,778 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:49,778 INFO L146 ILogger]: Analyzing trace with hash -744945071, now seen corresponding path program 43 times [2019-05-23 09:23:49,778 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:49,804 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:49,808 INFO L146 ILogger]: Trace formula consists of 451 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:23:49,812 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:52,211 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:52,211 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:52,211 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:23:52,212 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:23:52,212 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:23:52,213 INFO L146 ILogger]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:23:52,213 INFO L146 ILogger]: Start difference. First operand 319 states and 320 transitions. Second operand 89 states. [2019-05-23 09:23:56,318 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:56,319 INFO L146 ILogger]: Finished difference Result 341 states and 342 transitions. [2019-05-23 09:23:56,319 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 09:23:56,319 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 315 [2019-05-23 09:23:56,320 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:56,321 INFO L146 ILogger]: With dead ends: 341 [2019-05-23 09:23:56,321 INFO L146 ILogger]: Without dead ends: 341 [2019-05-23 09:23:56,323 INFO L146 ILogger]: 0 DeclaredPredicates, 400 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:23:56,323 INFO L146 ILogger]: Start minimizeSevpa. Operand 341 states. [2019-05-23 09:23:56,326 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 341 to 326. [2019-05-23 09:23:56,326 INFO L146 ILogger]: Start removeUnreachable. Operand 326 states. [2019-05-23 09:23:56,327 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 326 states to 326 states and 327 transitions. [2019-05-23 09:23:56,327 INFO L146 ILogger]: Start accepts. Automaton has 326 states and 327 transitions. Word has length 315 [2019-05-23 09:23:56,327 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:56,327 INFO L146 ILogger]: Abstraction has 326 states and 327 transitions. [2019-05-23 09:23:56,327 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:23:56,328 INFO L146 ILogger]: Start isEmpty. Operand 326 states and 327 transitions. [2019-05-23 09:23:56,329 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 323 [2019-05-23 09:23:56,329 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:56,329 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] [2019-05-23 09:23:56,330 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:56,330 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:56,330 INFO L146 ILogger]: Analyzing trace with hash 1413997982, now seen corresponding path program 44 times [2019-05-23 09:23:56,330 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:56,356 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:56,360 INFO L146 ILogger]: Trace formula consists of 461 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:23:56,365 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:58,766 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:58,766 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:58,766 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:23:58,766 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:23:58,767 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:23:58,767 INFO L146 ILogger]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:23:58,767 INFO L146 ILogger]: Start difference. First operand 326 states and 327 transitions. Second operand 91 states. [2019-05-23 09:24:02,646 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:02,647 INFO L146 ILogger]: Finished difference Result 348 states and 349 transitions. [2019-05-23 09:24:02,647 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 09:24:02,647 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 322 [2019-05-23 09:24:02,648 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:02,649 INFO L146 ILogger]: With dead ends: 348 [2019-05-23 09:24:02,650 INFO L146 ILogger]: Without dead ends: 348 [2019-05-23 09:24:02,651 INFO L146 ILogger]: 0 DeclaredPredicates, 409 GetRequests, 232 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:02,652 INFO L146 ILogger]: Start minimizeSevpa. Operand 348 states. [2019-05-23 09:24:02,654 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 348 to 333. [2019-05-23 09:24:02,654 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 09:24:02,654 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2019-05-23 09:24:02,654 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 322 [2019-05-23 09:24:02,654 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:02,655 INFO L146 ILogger]: Abstraction has 333 states and 334 transitions. [2019-05-23 09:24:02,655 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:24:02,655 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 334 transitions. [2019-05-23 09:24:02,656 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 330 [2019-05-23 09:24:02,656 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:02,656 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] [2019-05-23 09:24:02,657 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:02,657 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:02,657 INFO L146 ILogger]: Analyzing trace with hash 871836081, now seen corresponding path program 45 times [2019-05-23 09:24:02,658 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:02,685 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:02,689 INFO L146 ILogger]: Trace formula consists of 471 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:24:02,693 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:05,232 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:05,233 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:05,233 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:24:05,233 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:24:05,234 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:24:05,235 INFO L146 ILogger]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:05,235 INFO L146 ILogger]: Start difference. First operand 333 states and 334 transitions. Second operand 93 states. [2019-05-23 09:24:09,740 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:09,741 INFO L146 ILogger]: Finished difference Result 355 states and 356 transitions. [2019-05-23 09:24:09,741 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 09:24:09,741 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 329 [2019-05-23 09:24:09,742 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:09,743 INFO L146 ILogger]: With dead ends: 355 [2019-05-23 09:24:09,743 INFO L146 ILogger]: Without dead ends: 355 [2019-05-23 09:24:09,744 INFO L146 ILogger]: 0 DeclaredPredicates, 418 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 09:24:09,744 INFO L146 ILogger]: Start minimizeSevpa. Operand 355 states. [2019-05-23 09:24:09,747 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 355 to 340. [2019-05-23 09:24:09,747 INFO L146 ILogger]: Start removeUnreachable. Operand 340 states. [2019-05-23 09:24:09,748 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 340 states to 340 states and 341 transitions. [2019-05-23 09:24:09,748 INFO L146 ILogger]: Start accepts. Automaton has 340 states and 341 transitions. Word has length 329 [2019-05-23 09:24:09,749 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:09,749 INFO L146 ILogger]: Abstraction has 340 states and 341 transitions. [2019-05-23 09:24:09,749 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:24:09,749 INFO L146 ILogger]: Start isEmpty. Operand 340 states and 341 transitions. [2019-05-23 09:24:09,750 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 337 [2019-05-23 09:24:09,750 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:09,751 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] [2019-05-23 09:24:09,751 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:09,751 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:09,751 INFO L146 ILogger]: Analyzing trace with hash -1492534722, now seen corresponding path program 46 times [2019-05-23 09:24:09,752 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:09,777 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:09,781 INFO L146 ILogger]: Trace formula consists of 481 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:24:09,785 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:12,380 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:12,381 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:12,381 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:24:12,381 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:24:12,382 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:24:12,382 INFO L146 ILogger]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:12,382 INFO L146 ILogger]: Start difference. First operand 340 states and 341 transitions. Second operand 95 states. [2019-05-23 09:24:17,283 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:17,284 INFO L146 ILogger]: Finished difference Result 362 states and 363 transitions. [2019-05-23 09:24:17,284 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 09:24:17,284 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 336 [2019-05-23 09:24:17,284 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:17,285 INFO L146 ILogger]: With dead ends: 362 [2019-05-23 09:24:17,286 INFO L146 ILogger]: Without dead ends: 362 [2019-05-23 09:24:17,287 INFO L146 ILogger]: 0 DeclaredPredicates, 427 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2019-05-23 09:24:17,287 INFO L146 ILogger]: Start minimizeSevpa. Operand 362 states. [2019-05-23 09:24:17,289 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 362 to 347. [2019-05-23 09:24:17,289 INFO L146 ILogger]: Start removeUnreachable. Operand 347 states. [2019-05-23 09:24:17,290 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2019-05-23 09:24:17,290 INFO L146 ILogger]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 336 [2019-05-23 09:24:17,290 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:17,291 INFO L146 ILogger]: Abstraction has 347 states and 348 transitions. [2019-05-23 09:24:17,291 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:24:17,291 INFO L146 ILogger]: Start isEmpty. Operand 347 states and 348 transitions. [2019-05-23 09:24:17,292 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 344 [2019-05-23 09:24:17,292 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:17,293 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] [2019-05-23 09:24:17,293 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:17,293 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:17,293 INFO L146 ILogger]: Analyzing trace with hash -604315375, now seen corresponding path program 47 times [2019-05-23 09:24:17,294 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:17,320 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:17,325 INFO L146 ILogger]: Trace formula consists of 491 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:24:17,330 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:20,241 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:20,241 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:20,241 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:24:20,242 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:24:20,242 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:24:20,242 INFO L146 ILogger]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:20,242 INFO L146 ILogger]: Start difference. First operand 347 states and 348 transitions. Second operand 97 states. [2019-05-23 09:24:24,871 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:24,872 INFO L146 ILogger]: Finished difference Result 369 states and 370 transitions. [2019-05-23 09:24:24,872 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 09:24:24,872 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 343 [2019-05-23 09:24:24,873 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:24,874 INFO L146 ILogger]: With dead ends: 369 [2019-05-23 09:24:24,874 INFO L146 ILogger]: Without dead ends: 369 [2019-05-23 09:24:24,876 INFO L146 ILogger]: 0 DeclaredPredicates, 436 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 09:24:24,876 INFO L146 ILogger]: Start minimizeSevpa. Operand 369 states. [2019-05-23 09:24:24,879 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 369 to 354. [2019-05-23 09:24:24,879 INFO L146 ILogger]: Start removeUnreachable. Operand 354 states. [2019-05-23 09:24:24,880 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2019-05-23 09:24:24,880 INFO L146 ILogger]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 343 [2019-05-23 09:24:24,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:24,880 INFO L146 ILogger]: Abstraction has 354 states and 355 transitions. [2019-05-23 09:24:24,880 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:24:24,880 INFO L146 ILogger]: Start isEmpty. Operand 354 states and 355 transitions. [2019-05-23 09:24:24,882 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 351 [2019-05-23 09:24:24,882 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:24,882 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] [2019-05-23 09:24:24,883 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:24,883 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:24,883 INFO L146 ILogger]: Analyzing trace with hash 1898641118, now seen corresponding path program 48 times [2019-05-23 09:24:24,884 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:24,911 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:24,915 INFO L146 ILogger]: Trace formula consists of 501 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:24:24,921 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:27,682 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:27,682 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:27,682 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:24:27,682 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:24:27,683 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:24:27,684 INFO L146 ILogger]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:27,684 INFO L146 ILogger]: Start difference. First operand 354 states and 355 transitions. Second operand 99 states. [2019-05-23 09:24:32,583 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:32,584 INFO L146 ILogger]: Finished difference Result 376 states and 377 transitions. [2019-05-23 09:24:32,587 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 09:24:32,587 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 350 [2019-05-23 09:24:32,587 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:32,589 INFO L146 ILogger]: With dead ends: 376 [2019-05-23 09:24:32,590 INFO L146 ILogger]: Without dead ends: 376 [2019-05-23 09:24:32,591 INFO L146 ILogger]: 0 DeclaredPredicates, 445 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2019-05-23 09:24:32,591 INFO L146 ILogger]: Start minimizeSevpa. Operand 376 states. [2019-05-23 09:24:32,594 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 376 to 361. [2019-05-23 09:24:32,594 INFO L146 ILogger]: Start removeUnreachable. Operand 361 states. [2019-05-23 09:24:32,595 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2019-05-23 09:24:32,595 INFO L146 ILogger]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 350 [2019-05-23 09:24:32,595 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:32,595 INFO L146 ILogger]: Abstraction has 361 states and 362 transitions. [2019-05-23 09:24:32,596 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:24:32,596 INFO L146 ILogger]: Start isEmpty. Operand 361 states and 362 transitions. [2019-05-23 09:24:32,597 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 358 [2019-05-23 09:24:32,597 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:32,597 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] [2019-05-23 09:24:32,597 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:32,598 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:32,598 INFO L146 ILogger]: Analyzing trace with hash 1308242033, now seen corresponding path program 49 times [2019-05-23 09:24:32,598 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:32,625 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:32,630 INFO L146 ILogger]: Trace formula consists of 511 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:24:32,634 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:36,384 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:36,384 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:36,384 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:24:36,385 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:24:36,385 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:24:36,385 INFO L146 ILogger]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:24:36,386 INFO L146 ILogger]: Start difference. First operand 361 states and 362 transitions. Second operand 101 states. [2019-05-23 09:24:41,491 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:41,492 INFO L146 ILogger]: Finished difference Result 383 states and 384 transitions. [2019-05-23 09:24:41,492 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 09:24:41,492 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 357 [2019-05-23 09:24:41,493 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:41,494 INFO L146 ILogger]: With dead ends: 383 [2019-05-23 09:24:41,495 INFO L146 ILogger]: Without dead ends: 383 [2019-05-23 09:24:41,496 INFO L146 ILogger]: 0 DeclaredPredicates, 454 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2019-05-23 09:24:41,496 INFO L146 ILogger]: Start minimizeSevpa. Operand 383 states. [2019-05-23 09:24:41,499 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 383 to 368. [2019-05-23 09:24:41,499 INFO L146 ILogger]: Start removeUnreachable. Operand 368 states. [2019-05-23 09:24:41,500 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-05-23 09:24:41,500 INFO L146 ILogger]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 357 [2019-05-23 09:24:41,500 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:41,500 INFO L146 ILogger]: Abstraction has 368 states and 369 transitions. [2019-05-23 09:24:41,500 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:24:41,500 INFO L146 ILogger]: Start isEmpty. Operand 368 states and 369 transitions. [2019-05-23 09:24:41,502 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 365 [2019-05-23 09:24:41,502 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:41,502 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] [2019-05-23 09:24:41,503 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:41,503 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:41,503 INFO L146 ILogger]: Analyzing trace with hash 60136318, now seen corresponding path program 50 times [2019-05-23 09:24:41,504 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:41,532 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:41,537 INFO L146 ILogger]: Trace formula consists of 521 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:24:41,541 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:44,535 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:44,536 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:44,536 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:24:44,537 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:24:44,537 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:24:44,538 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:24:44,538 INFO L146 ILogger]: Start difference. First operand 368 states and 369 transitions. Second operand 103 states. [2019-05-23 09:24:49,873 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:49,873 INFO L146 ILogger]: Finished difference Result 390 states and 391 transitions. [2019-05-23 09:24:49,874 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 09:24:49,874 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 364 [2019-05-23 09:24:49,875 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:49,877 INFO L146 ILogger]: With dead ends: 390 [2019-05-23 09:24:49,877 INFO L146 ILogger]: Without dead ends: 390 [2019-05-23 09:24:49,878 INFO L146 ILogger]: 0 DeclaredPredicates, 463 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2019-05-23 09:24:49,878 INFO L146 ILogger]: Start minimizeSevpa. Operand 390 states. [2019-05-23 09:24:49,881 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 390 to 375. [2019-05-23 09:24:49,881 INFO L146 ILogger]: Start removeUnreachable. Operand 375 states. [2019-05-23 09:24:49,881 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-05-23 09:24:49,881 INFO L146 ILogger]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 364 [2019-05-23 09:24:49,882 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:49,882 INFO L146 ILogger]: Abstraction has 375 states and 376 transitions. [2019-05-23 09:24:49,882 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:24:49,882 INFO L146 ILogger]: Start isEmpty. Operand 375 states and 376 transitions. [2019-05-23 09:24:49,883 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 372 [2019-05-23 09:24:49,884 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:49,884 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] [2019-05-23 09:24:49,884 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:49,884 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:49,884 INFO L146 ILogger]: Analyzing trace with hash 1036720081, now seen corresponding path program 51 times [2019-05-23 09:24:49,885 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:49,913 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:49,919 INFO L146 ILogger]: Trace formula consists of 531 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:24:49,923 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:53,021 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:53,021 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:53,022 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:24:53,022 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:24:53,023 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:24:53,023 INFO L146 ILogger]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:24:53,023 INFO L146 ILogger]: Start difference. First operand 375 states and 376 transitions. Second operand 105 states. [2019-05-23 09:24:58,316 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:58,316 INFO L146 ILogger]: Finished difference Result 397 states and 398 transitions. [2019-05-23 09:24:58,317 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 09:24:58,317 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 371 [2019-05-23 09:24:58,317 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:58,319 INFO L146 ILogger]: With dead ends: 397 [2019-05-23 09:24:58,319 INFO L146 ILogger]: Without dead ends: 397 [2019-05-23 09:24:58,321 INFO L146 ILogger]: 0 DeclaredPredicates, 472 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2019-05-23 09:24:58,321 INFO L146 ILogger]: Start minimizeSevpa. Operand 397 states. [2019-05-23 09:24:58,323 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 397 to 382. [2019-05-23 09:24:58,323 INFO L146 ILogger]: Start removeUnreachable. Operand 382 states. [2019-05-23 09:24:58,324 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2019-05-23 09:24:58,324 INFO L146 ILogger]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 371 [2019-05-23 09:24:58,324 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:58,324 INFO L146 ILogger]: Abstraction has 382 states and 383 transitions. [2019-05-23 09:24:58,324 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:24:58,324 INFO L146 ILogger]: Start isEmpty. Operand 382 states and 383 transitions. [2019-05-23 09:24:58,326 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 379 [2019-05-23 09:24:58,326 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:58,326 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] [2019-05-23 09:24:58,326 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:58,326 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:58,327 INFO L146 ILogger]: Analyzing trace with hash -843864034, now seen corresponding path program 52 times [2019-05-23 09:24:58,327 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:58,354 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:58,359 INFO L146 ILogger]: Trace formula consists of 541 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:24:58,363 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:02,085 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:25:02,085 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:02,085 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:25:02,086 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 09:25:02,086 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 09:25:02,086 INFO L146 ILogger]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:25:02,086 INFO L146 ILogger]: Start difference. First operand 382 states and 383 transitions. Second operand 107 states. [2019-05-23 09:25:07,817 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:07,818 INFO L146 ILogger]: Finished difference Result 404 states and 405 transitions. [2019-05-23 09:25:07,818 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 09:25:07,819 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 378 [2019-05-23 09:25:07,819 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:07,820 INFO L146 ILogger]: With dead ends: 404 [2019-05-23 09:25:07,820 INFO L146 ILogger]: Without dead ends: 404 [2019-05-23 09:25:07,821 INFO L146 ILogger]: 0 DeclaredPredicates, 481 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2019-05-23 09:25:07,822 INFO L146 ILogger]: Start minimizeSevpa. Operand 404 states. [2019-05-23 09:25:07,824 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 404 to 389. [2019-05-23 09:25:07,824 INFO L146 ILogger]: Start removeUnreachable. Operand 389 states. [2019-05-23 09:25:07,824 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2019-05-23 09:25:07,824 INFO L146 ILogger]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 378 [2019-05-23 09:25:07,824 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:07,825 INFO L146 ILogger]: Abstraction has 389 states and 390 transitions. [2019-05-23 09:25:07,825 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 09:25:07,825 INFO L146 ILogger]: Start isEmpty. Operand 389 states and 390 transitions. [2019-05-23 09:25:07,826 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 386 [2019-05-23 09:25:07,826 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:07,827 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] [2019-05-23 09:25:07,827 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:07,827 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:07,827 INFO L146 ILogger]: Analyzing trace with hash -255617231, now seen corresponding path program 53 times [2019-05-23 09:25:07,828 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:07,857 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:07,862 INFO L146 ILogger]: Trace formula consists of 551 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:25:07,866 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:11,440 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:11,440 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:11,440 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:25:11,441 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 09:25:11,441 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 09:25:11,441 INFO L146 ILogger]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:25:11,441 INFO L146 ILogger]: Start difference. First operand 389 states and 390 transitions. Second operand 109 states. [2019-05-23 09:25:17,196 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:17,197 INFO L146 ILogger]: Finished difference Result 411 states and 412 transitions. [2019-05-23 09:25:17,197 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 09:25:17,197 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 385 [2019-05-23 09:25:17,198 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:17,199 INFO L146 ILogger]: With dead ends: 411 [2019-05-23 09:25:17,199 INFO L146 ILogger]: Without dead ends: 411 [2019-05-23 09:25:17,200 INFO L146 ILogger]: 0 DeclaredPredicates, 490 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2019-05-23 09:25:17,201 INFO L146 ILogger]: Start minimizeSevpa. Operand 411 states. [2019-05-23 09:25:17,203 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 411 to 396. [2019-05-23 09:25:17,203 INFO L146 ILogger]: Start removeUnreachable. Operand 396 states. [2019-05-23 09:25:17,204 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 396 states to 396 states and 397 transitions. [2019-05-23 09:25:17,204 INFO L146 ILogger]: Start accepts. Automaton has 396 states and 397 transitions. Word has length 385 [2019-05-23 09:25:17,204 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:17,204 INFO L146 ILogger]: Abstraction has 396 states and 397 transitions. [2019-05-23 09:25:17,204 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 09:25:17,204 INFO L146 ILogger]: Start isEmpty. Operand 396 states and 397 transitions. [2019-05-23 09:25:17,205 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 393 [2019-05-23 09:25:17,205 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:17,206 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] [2019-05-23 09:25:17,206 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:17,206 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:17,206 INFO L146 ILogger]: Analyzing trace with hash -43049794, now seen corresponding path program 54 times [2019-05-23 09:25:17,207 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:17,233 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:17,238 INFO L146 ILogger]: Trace formula consists of 561 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:25:17,244 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:20,679 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:20,679 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:20,679 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:25:20,680 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 09:25:20,680 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 09:25:20,680 INFO L146 ILogger]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:25:20,680 INFO L146 ILogger]: Start difference. First operand 396 states and 397 transitions. Second operand 111 states. [2019-05-23 09:25:26,780 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:26,780 INFO L146 ILogger]: Finished difference Result 418 states and 419 transitions. [2019-05-23 09:25:26,780 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 09:25:26,781 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 392 [2019-05-23 09:25:26,781 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:26,782 INFO L146 ILogger]: With dead ends: 418 [2019-05-23 09:25:26,782 INFO L146 ILogger]: Without dead ends: 418 [2019-05-23 09:25:26,783 INFO L146 ILogger]: 0 DeclaredPredicates, 499 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2019-05-23 09:25:26,784 INFO L146 ILogger]: Start minimizeSevpa. Operand 418 states. [2019-05-23 09:25:26,786 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 418 to 403. [2019-05-23 09:25:26,786 INFO L146 ILogger]: Start removeUnreachable. Operand 403 states. [2019-05-23 09:25:26,786 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2019-05-23 09:25:26,787 INFO L146 ILogger]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 392 [2019-05-23 09:25:26,787 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:26,787 INFO L146 ILogger]: Abstraction has 403 states and 404 transitions. [2019-05-23 09:25:26,787 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 09:25:26,787 INFO L146 ILogger]: Start isEmpty. Operand 403 states and 404 transitions. [2019-05-23 09:25:26,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 400 [2019-05-23 09:25:26,788 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:26,789 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] [2019-05-23 09:25:26,789 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:26,789 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:26,789 INFO L146 ILogger]: Analyzing trace with hash -1648775535, now seen corresponding path program 55 times [2019-05-23 09:25:26,790 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:26,817 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:26,823 INFO L146 ILogger]: Trace formula consists of 571 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:25:26,827 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:31,031 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:31,032 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:31,032 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:25:31,032 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 09:25:31,033 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 09:25:31,033 INFO L146 ILogger]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:25:31,033 INFO L146 ILogger]: Start difference. First operand 403 states and 404 transitions. Second operand 113 states. [2019-05-23 09:25:37,261 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:37,261 INFO L146 ILogger]: Finished difference Result 425 states and 426 transitions. [2019-05-23 09:25:37,262 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 09:25:37,262 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 399 [2019-05-23 09:25:37,262 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:37,263 INFO L146 ILogger]: With dead ends: 425 [2019-05-23 09:25:37,263 INFO L146 ILogger]: Without dead ends: 425 [2019-05-23 09:25:37,265 INFO L146 ILogger]: 0 DeclaredPredicates, 508 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2019-05-23 09:25:37,265 INFO L146 ILogger]: Start minimizeSevpa. Operand 425 states. [2019-05-23 09:25:37,267 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 425 to 410. [2019-05-23 09:25:37,267 INFO L146 ILogger]: Start removeUnreachable. Operand 410 states. [2019-05-23 09:25:37,268 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2019-05-23 09:25:37,268 INFO L146 ILogger]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 399 [2019-05-23 09:25:37,268 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:37,268 INFO L146 ILogger]: Abstraction has 410 states and 411 transitions. [2019-05-23 09:25:37,268 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 09:25:37,268 INFO L146 ILogger]: Start isEmpty. Operand 410 states and 411 transitions. [2019-05-23 09:25:37,270 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 407 [2019-05-23 09:25:37,270 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:37,270 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] [2019-05-23 09:25:37,270 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:37,270 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:37,271 INFO L146 ILogger]: Analyzing trace with hash 523368798, now seen corresponding path program 56 times [2019-05-23 09:25:37,271 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:37,300 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:37,307 INFO L146 ILogger]: Trace formula consists of 581 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:25:37,311 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:41,181 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:41,181 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:41,182 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:25:41,182 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 09:25:41,182 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 09:25:41,183 INFO L146 ILogger]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:25:41,183 INFO L146 ILogger]: Start difference. First operand 410 states and 411 transitions. Second operand 115 states. [2019-05-23 09:25:47,515 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:47,515 INFO L146 ILogger]: Finished difference Result 432 states and 433 transitions. [2019-05-23 09:25:47,515 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 09:25:47,516 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 406 [2019-05-23 09:25:47,516 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:47,518 INFO L146 ILogger]: With dead ends: 432 [2019-05-23 09:25:47,518 INFO L146 ILogger]: Without dead ends: 432 [2019-05-23 09:25:47,520 INFO L146 ILogger]: 0 DeclaredPredicates, 517 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2019-05-23 09:25:47,521 INFO L146 ILogger]: Start minimizeSevpa. Operand 432 states. [2019-05-23 09:25:47,523 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 432 to 417. [2019-05-23 09:25:47,523 INFO L146 ILogger]: Start removeUnreachable. Operand 417 states. [2019-05-23 09:25:47,523 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2019-05-23 09:25:47,523 INFO L146 ILogger]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 406 [2019-05-23 09:25:47,524 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:47,524 INFO L146 ILogger]: Abstraction has 417 states and 418 transitions. [2019-05-23 09:25:47,524 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 09:25:47,524 INFO L146 ILogger]: Start isEmpty. Operand 417 states and 418 transitions. [2019-05-23 09:25:47,525 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 414 [2019-05-23 09:25:47,525 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:47,526 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] [2019-05-23 09:25:47,526 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:47,526 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:47,526 INFO L146 ILogger]: Analyzing trace with hash -855417359, now seen corresponding path program 57 times [2019-05-23 09:25:47,527 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:47,554 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:47,560 INFO L146 ILogger]: Trace formula consists of 591 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:25:47,565 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:51,518 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:51,519 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:51,519 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:25:51,519 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 09:25:51,520 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 09:25:51,520 INFO L146 ILogger]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:25:51,520 INFO L146 ILogger]: Start difference. First operand 417 states and 418 transitions. Second operand 117 states. [2019-05-23 09:25:58,183 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:58,184 INFO L146 ILogger]: Finished difference Result 439 states and 440 transitions. [2019-05-23 09:25:58,184 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 09:25:58,184 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 413 [2019-05-23 09:25:58,185 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:58,186 INFO L146 ILogger]: With dead ends: 439 [2019-05-23 09:25:58,186 INFO L146 ILogger]: Without dead ends: 439 [2019-05-23 09:25:58,188 INFO L146 ILogger]: 0 DeclaredPredicates, 526 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2019-05-23 09:25:58,188 INFO L146 ILogger]: Start minimizeSevpa. Operand 439 states. [2019-05-23 09:25:58,191 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 439 to 424. [2019-05-23 09:25:58,191 INFO L146 ILogger]: Start removeUnreachable. Operand 424 states. [2019-05-23 09:25:58,191 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-05-23 09:25:58,191 INFO L146 ILogger]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 413 [2019-05-23 09:25:58,192 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:58,192 INFO L146 ILogger]: Abstraction has 424 states and 425 transitions. [2019-05-23 09:25:58,192 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 09:25:58,192 INFO L146 ILogger]: Start isEmpty. Operand 424 states and 425 transitions. [2019-05-23 09:25:58,193 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 421 [2019-05-23 09:25:58,193 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:58,194 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] [2019-05-23 09:25:58,194 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:58,194 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:58,194 INFO L146 ILogger]: Analyzing trace with hash -1108984322, now seen corresponding path program 58 times [2019-05-23 09:25:58,195 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:58,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:58,225 INFO L146 ILogger]: Trace formula consists of 601 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:25:58,230 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:02,604 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:26:02,605 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:02,605 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:26:02,605 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 09:26:02,606 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 09:26:02,606 INFO L146 ILogger]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:26:02,607 INFO L146 ILogger]: Start difference. First operand 424 states and 425 transitions. Second operand 119 states. [2019-05-23 09:26:09,350 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:09,351 INFO L146 ILogger]: Finished difference Result 446 states and 447 transitions. [2019-05-23 09:26:09,351 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-05-23 09:26:09,351 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 420 [2019-05-23 09:26:09,352 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:09,353 INFO L146 ILogger]: With dead ends: 446 [2019-05-23 09:26:09,353 INFO L146 ILogger]: Without dead ends: 446 [2019-05-23 09:26:09,355 INFO L146 ILogger]: 0 DeclaredPredicates, 535 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2019-05-23 09:26:09,355 INFO L146 ILogger]: Start minimizeSevpa. Operand 446 states. [2019-05-23 09:26:09,358 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 446 to 431. [2019-05-23 09:26:09,358 INFO L146 ILogger]: Start removeUnreachable. Operand 431 states. [2019-05-23 09:26:09,358 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-05-23 09:26:09,358 INFO L146 ILogger]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 420 [2019-05-23 09:26:09,358 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:09,359 INFO L146 ILogger]: Abstraction has 431 states and 432 transitions. [2019-05-23 09:26:09,359 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 09:26:09,359 INFO L146 ILogger]: Start isEmpty. Operand 431 states and 432 transitions. [2019-05-23 09:26:09,360 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 428 [2019-05-23 09:26:09,360 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:09,360 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] [2019-05-23 09:26:09,361 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:09,361 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:09,361 INFO L146 ILogger]: Analyzing trace with hash -1200183983, now seen corresponding path program 59 times [2019-05-23 09:26:09,361 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:09,387 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:09,393 INFO L146 ILogger]: Trace formula consists of 611 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:26:09,397 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:13,728 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:13,728 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:13,729 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:26:13,729 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 09:26:13,729 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 09:26:13,730 INFO L146 ILogger]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:26:13,730 INFO L146 ILogger]: Start difference. First operand 431 states and 432 transitions. Second operand 121 states. [2019-05-23 09:26:20,622 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:20,622 INFO L146 ILogger]: Finished difference Result 453 states and 454 transitions. [2019-05-23 09:26:20,623 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-05-23 09:26:20,623 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 427 [2019-05-23 09:26:20,623 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:20,625 INFO L146 ILogger]: With dead ends: 453 [2019-05-23 09:26:20,625 INFO L146 ILogger]: Without dead ends: 453 [2019-05-23 09:26:20,627 INFO L146 ILogger]: 0 DeclaredPredicates, 544 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2019-05-23 09:26:20,627 INFO L146 ILogger]: Start minimizeSevpa. Operand 453 states. [2019-05-23 09:26:20,630 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 453 to 438. [2019-05-23 09:26:20,630 INFO L146 ILogger]: Start removeUnreachable. Operand 438 states. [2019-05-23 09:26:20,630 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 438 states to 438 states and 439 transitions. [2019-05-23 09:26:20,630 INFO L146 ILogger]: Start accepts. Automaton has 438 states and 439 transitions. Word has length 427 [2019-05-23 09:26:20,631 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:20,631 INFO L146 ILogger]: Abstraction has 438 states and 439 transitions. [2019-05-23 09:26:20,631 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 09:26:20,631 INFO L146 ILogger]: Start isEmpty. Operand 438 states and 439 transitions. [2019-05-23 09:26:20,633 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 435 [2019-05-23 09:26:20,633 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:20,633 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] [2019-05-23 09:26:20,633 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:20,633 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:20,634 INFO L146 ILogger]: Analyzing trace with hash 49670814, now seen corresponding path program 60 times [2019-05-23 09:26:20,634 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:20,661 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:20,667 INFO L146 ILogger]: Trace formula consists of 621 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:26:20,673 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:25,063 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:25,064 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:25,064 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 09:26:25,065 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 09:26:25,065 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 09:26:25,066 INFO L146 ILogger]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:26:25,066 INFO L146 ILogger]: Start difference. First operand 438 states and 439 transitions. Second operand 123 states. [2019-05-23 09:26:32,556 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:32,556 INFO L146 ILogger]: Finished difference Result 460 states and 461 transitions. [2019-05-23 09:26:32,556 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-05-23 09:26:32,556 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 434 [2019-05-23 09:26:32,557 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:32,558 INFO L146 ILogger]: With dead ends: 460 [2019-05-23 09:26:32,558 INFO L146 ILogger]: Without dead ends: 460 [2019-05-23 09:26:32,559 INFO L146 ILogger]: 0 DeclaredPredicates, 553 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2019-05-23 09:26:32,560 INFO L146 ILogger]: Start minimizeSevpa. Operand 460 states. [2019-05-23 09:26:32,562 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 460 to 445. [2019-05-23 09:26:32,562 INFO L146 ILogger]: Start removeUnreachable. Operand 445 states. [2019-05-23 09:26:32,563 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2019-05-23 09:26:32,563 INFO L146 ILogger]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 434 [2019-05-23 09:26:32,563 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:32,563 INFO L146 ILogger]: Abstraction has 445 states and 446 transitions. [2019-05-23 09:26:32,563 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 09:26:32,563 INFO L146 ILogger]: Start isEmpty. Operand 445 states and 446 transitions. [2019-05-23 09:26:32,565 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 442 [2019-05-23 09:26:32,565 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:32,565 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] [2019-05-23 09:26:32,565 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:32,565 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:32,565 INFO L146 ILogger]: Analyzing trace with hash -1419148111, now seen corresponding path program 61 times [2019-05-23 09:26:32,566 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:32,592 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:32,599 INFO L146 ILogger]: Trace formula consists of 631 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 09:26:32,603 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:36,810 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:36,810 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:36,810 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 09:26:36,811 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 09:26:36,811 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 09:26:36,812 INFO L146 ILogger]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:26:36,812 INFO L146 ILogger]: Start difference. First operand 445 states and 446 transitions. Second operand 125 states. [2019-05-23 09:26:44,087 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:44,087 INFO L146 ILogger]: Finished difference Result 467 states and 468 transitions. [2019-05-23 09:26:44,087 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-05-23 09:26:44,088 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 441 [2019-05-23 09:26:44,088 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:44,090 INFO L146 ILogger]: With dead ends: 467 [2019-05-23 09:26:44,090 INFO L146 ILogger]: Without dead ends: 467 [2019-05-23 09:26:44,093 INFO L146 ILogger]: 0 DeclaredPredicates, 562 GetRequests, 317 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:44,093 INFO L146 ILogger]: Start minimizeSevpa. Operand 467 states. [2019-05-23 09:26:44,096 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 467 to 452. [2019-05-23 09:26:44,096 INFO L146 ILogger]: Start removeUnreachable. Operand 452 states. [2019-05-23 09:26:44,096 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 452 states to 452 states and 453 transitions. [2019-05-23 09:26:44,096 INFO L146 ILogger]: Start accepts. Automaton has 452 states and 453 transitions. Word has length 441 [2019-05-23 09:26:44,096 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:44,096 INFO L146 ILogger]: Abstraction has 452 states and 453 transitions. [2019-05-23 09:26:44,096 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 09:26:44,097 INFO L146 ILogger]: Start isEmpty. Operand 452 states and 453 transitions. [2019-05-23 09:26:44,098 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 449 [2019-05-23 09:26:44,098 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:44,098 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] [2019-05-23 09:26:44,098 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:44,099 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:44,099 INFO L146 ILogger]: Analyzing trace with hash 1447755582, now seen corresponding path program 62 times [2019-05-23 09:26:44,099 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:44,129 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:44,135 INFO L146 ILogger]: Trace formula consists of 641 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:26:44,141 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:48,734 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:48,734 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:48,734 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 09:26:48,735 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 09:26:48,736 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 09:26:48,736 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:26:48,736 INFO L146 ILogger]: Start difference. First operand 452 states and 453 transitions. Second operand 127 states. [2019-05-23 09:26:56,279 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:56,280 INFO L146 ILogger]: Finished difference Result 474 states and 475 transitions. [2019-05-23 09:26:56,280 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-05-23 09:26:56,280 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 448 [2019-05-23 09:26:56,281 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:56,282 INFO L146 ILogger]: With dead ends: 474 [2019-05-23 09:26:56,283 INFO L146 ILogger]: Without dead ends: 474 [2019-05-23 09:26:56,285 INFO L146 ILogger]: 0 DeclaredPredicates, 571 GetRequests, 322 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:56,286 INFO L146 ILogger]: Start minimizeSevpa. Operand 474 states. [2019-05-23 09:26:56,289 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 474 to 459. [2019-05-23 09:26:56,289 INFO L146 ILogger]: Start removeUnreachable. Operand 459 states. [2019-05-23 09:26:56,290 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 459 states to 459 states and 460 transitions. [2019-05-23 09:26:56,290 INFO L146 ILogger]: Start accepts. Automaton has 459 states and 460 transitions. Word has length 448 [2019-05-23 09:26:56,290 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:56,290 INFO L146 ILogger]: Abstraction has 459 states and 460 transitions. [2019-05-23 09:26:56,290 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 09:26:56,290 INFO L146 ILogger]: Start isEmpty. Operand 459 states and 460 transitions. [2019-05-23 09:26:56,292 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 456 [2019-05-23 09:26:56,293 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:56,293 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] [2019-05-23 09:26:56,293 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:56,293 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:56,294 INFO L146 ILogger]: Analyzing trace with hash 1655831569, now seen corresponding path program 63 times [2019-05-23 09:26:56,294 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:56,321 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:56,326 INFO L146 ILogger]: Trace formula consists of 651 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 09:26:56,331 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:00,962 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:27:00,962 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:00,962 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 09:27:00,963 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 09:27:00,963 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 09:27:00,964 INFO L146 ILogger]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:27:00,964 INFO L146 ILogger]: Start difference. First operand 459 states and 460 transitions. Second operand 129 states. [2019-05-23 09:27:09,070 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:09,070 INFO L146 ILogger]: Finished difference Result 481 states and 482 transitions. [2019-05-23 09:27:09,071 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-05-23 09:27:09,071 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 455 [2019-05-23 09:27:09,071 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:09,072 INFO L146 ILogger]: With dead ends: 481 [2019-05-23 09:27:09,073 INFO L146 ILogger]: Without dead ends: 481 [2019-05-23 09:27:09,075 INFO L146 ILogger]: 0 DeclaredPredicates, 580 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2019-05-23 09:27:09,076 INFO L146 ILogger]: Start minimizeSevpa. Operand 481 states. [2019-05-23 09:27:09,079 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 481 to 466. [2019-05-23 09:27:09,079 INFO L146 ILogger]: Start removeUnreachable. Operand 466 states. [2019-05-23 09:27:09,079 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 466 states to 466 states and 467 transitions. [2019-05-23 09:27:09,080 INFO L146 ILogger]: Start accepts. Automaton has 466 states and 467 transitions. Word has length 455 [2019-05-23 09:27:09,080 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:09,080 INFO L146 ILogger]: Abstraction has 466 states and 467 transitions. [2019-05-23 09:27:09,080 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 09:27:09,080 INFO L146 ILogger]: Start isEmpty. Operand 466 states and 467 transitions. [2019-05-23 09:27:09,082 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 463 [2019-05-23 09:27:09,082 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:09,082 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] [2019-05-23 09:27:09,082 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:09,083 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:09,083 INFO L146 ILogger]: Analyzing trace with hash -28345378, now seen corresponding path program 64 times [2019-05-23 09:27:09,083 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:09,105 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:09,110 INFO L146 ILogger]: Trace formula consists of 661 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:27:09,115 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:13,865 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:13,866 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:13,866 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 09:27:13,866 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 09:27:13,867 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 09:27:13,867 INFO L146 ILogger]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:27:13,867 INFO L146 ILogger]: Start difference. First operand 466 states and 467 transitions. Second operand 131 states. [2019-05-23 09:27:22,035 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:22,035 INFO L146 ILogger]: Finished difference Result 488 states and 489 transitions. [2019-05-23 09:27:22,035 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-05-23 09:27:22,035 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 462 [2019-05-23 09:27:22,036 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:22,038 INFO L146 ILogger]: With dead ends: 488 [2019-05-23 09:27:22,038 INFO L146 ILogger]: Without dead ends: 488 [2019-05-23 09:27:22,039 INFO L146 ILogger]: 0 DeclaredPredicates, 589 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2019-05-23 09:27:22,040 INFO L146 ILogger]: Start minimizeSevpa. Operand 488 states. [2019-05-23 09:27:22,042 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 488 to 473. [2019-05-23 09:27:22,042 INFO L146 ILogger]: Start removeUnreachable. Operand 473 states. [2019-05-23 09:27:22,043 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 473 states to 473 states and 474 transitions. [2019-05-23 09:27:22,043 INFO L146 ILogger]: Start accepts. Automaton has 473 states and 474 transitions. Word has length 462 [2019-05-23 09:27:22,043 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:22,043 INFO L146 ILogger]: Abstraction has 473 states and 474 transitions. [2019-05-23 09:27:22,043 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 09:27:22,043 INFO L146 ILogger]: Start isEmpty. Operand 473 states and 474 transitions. [2019-05-23 09:27:22,045 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 470 [2019-05-23 09:27:22,045 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:22,045 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] [2019-05-23 09:27:22,045 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:22,046 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:22,046 INFO L146 ILogger]: Analyzing trace with hash 1822821233, now seen corresponding path program 65 times [2019-05-23 09:27:22,046 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:22,077 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:22,086 INFO L146 ILogger]: Trace formula consists of 671 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:27:22,091 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:26,940 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:26,941 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:26,941 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 09:27:26,941 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 09:27:26,942 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 09:27:26,942 INFO L146 ILogger]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:27:26,942 INFO L146 ILogger]: Start difference. First operand 473 states and 474 transitions. Second operand 133 states. [2019-05-23 09:27:35,384 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:35,384 INFO L146 ILogger]: Finished difference Result 495 states and 496 transitions. [2019-05-23 09:27:35,385 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2019-05-23 09:27:35,385 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 469 [2019-05-23 09:27:35,385 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:35,387 INFO L146 ILogger]: With dead ends: 495 [2019-05-23 09:27:35,387 INFO L146 ILogger]: Without dead ends: 495 [2019-05-23 09:27:35,390 INFO L146 ILogger]: 0 DeclaredPredicates, 598 GetRequests, 337 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:35,390 INFO L146 ILogger]: Start minimizeSevpa. Operand 495 states. [2019-05-23 09:27:35,393 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 495 to 480. [2019-05-23 09:27:35,393 INFO L146 ILogger]: Start removeUnreachable. Operand 480 states. [2019-05-23 09:27:35,393 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-05-23 09:27:35,393 INFO L146 ILogger]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 469 [2019-05-23 09:27:35,394 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:35,394 INFO L146 ILogger]: Abstraction has 480 states and 481 transitions. [2019-05-23 09:27:35,394 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 09:27:35,394 INFO L146 ILogger]: Start isEmpty. Operand 480 states and 481 transitions. [2019-05-23 09:27:35,395 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 477 [2019-05-23 09:27:35,396 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:35,396 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] [2019-05-23 09:27:35,396 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:35,396 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:35,396 INFO L146 ILogger]: Analyzing trace with hash -1074962306, now seen corresponding path program 66 times [2019-05-23 09:27:35,397 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:35,418 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:35,423 INFO L146 ILogger]: Trace formula consists of 681 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:27:35,429 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:40,421 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:40,422 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:40,422 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 09:27:40,422 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 09:27:40,423 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 09:27:40,423 INFO L146 ILogger]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:27:40,423 INFO L146 ILogger]: Start difference. First operand 480 states and 481 transitions. Second operand 135 states. [2019-05-23 09:27:48,602 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:48,602 INFO L146 ILogger]: Finished difference Result 502 states and 503 transitions. [2019-05-23 09:27:48,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-05-23 09:27:48,603 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 476 [2019-05-23 09:27:48,603 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:48,604 INFO L146 ILogger]: With dead ends: 502 [2019-05-23 09:27:48,604 INFO L146 ILogger]: Without dead ends: 502 [2019-05-23 09:27:48,606 INFO L146 ILogger]: 0 DeclaredPredicates, 607 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2019-05-23 09:27:48,606 INFO L146 ILogger]: Start minimizeSevpa. Operand 502 states. [2019-05-23 09:27:48,609 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 502 to 487. [2019-05-23 09:27:48,609 INFO L146 ILogger]: Start removeUnreachable. Operand 487 states. [2019-05-23 09:27:48,610 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-05-23 09:27:48,610 INFO L146 ILogger]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 476 [2019-05-23 09:27:48,610 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:48,610 INFO L146 ILogger]: Abstraction has 487 states and 488 transitions. [2019-05-23 09:27:48,610 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 09:27:48,610 INFO L146 ILogger]: Start isEmpty. Operand 487 states and 488 transitions. [2019-05-23 09:27:48,612 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 484 [2019-05-23 09:27:48,612 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:48,612 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] [2019-05-23 09:27:48,612 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:48,612 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:48,613 INFO L146 ILogger]: Analyzing trace with hash -1994673455, now seen corresponding path program 67 times [2019-05-23 09:27:48,613 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:48,635 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:48,641 INFO L146 ILogger]: Trace formula consists of 691 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 09:27:48,645 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:53,592 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:53,592 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:53,592 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 09:27:53,593 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 09:27:53,593 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 09:27:53,594 INFO L146 ILogger]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:27:53,594 INFO L146 ILogger]: Start difference. First operand 487 states and 488 transitions. Second operand 137 states. [2019-05-23 09:28:02,493 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:02,493 INFO L146 ILogger]: Finished difference Result 509 states and 510 transitions. [2019-05-23 09:28:02,494 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-05-23 09:28:02,494 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 483 [2019-05-23 09:28:02,494 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:02,497 INFO L146 ILogger]: With dead ends: 509 [2019-05-23 09:28:02,497 INFO L146 ILogger]: Without dead ends: 509 [2019-05-23 09:28:02,500 INFO L146 ILogger]: 0 DeclaredPredicates, 616 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2019-05-23 09:28:02,500 INFO L146 ILogger]: Start minimizeSevpa. Operand 509 states. [2019-05-23 09:28:02,503 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 509 to 494. [2019-05-23 09:28:02,503 INFO L146 ILogger]: Start removeUnreachable. Operand 494 states. [2019-05-23 09:28:02,503 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 494 states to 494 states and 495 transitions. [2019-05-23 09:28:02,503 INFO L146 ILogger]: Start accepts. Automaton has 494 states and 495 transitions. Word has length 483 [2019-05-23 09:28:02,504 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:02,504 INFO L146 ILogger]: Abstraction has 494 states and 495 transitions. [2019-05-23 09:28:02,504 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 09:28:02,504 INFO L146 ILogger]: Start isEmpty. Operand 494 states and 495 transitions. [2019-05-23 09:28:02,506 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 491 [2019-05-23 09:28:02,506 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:02,506 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] [2019-05-23 09:28:02,506 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:02,507 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:02,507 INFO L146 ILogger]: Analyzing trace with hash 2123279646, now seen corresponding path program 68 times [2019-05-23 09:28:02,507 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:02,530 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:02,535 INFO L146 ILogger]: Trace formula consists of 701 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:28:02,538 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:07,683 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:07,683 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:07,683 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 09:28:07,684 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 09:28:07,684 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 09:28:07,685 INFO L146 ILogger]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:28:07,685 INFO L146 ILogger]: Start difference. First operand 494 states and 495 transitions. Second operand 139 states. [2019-05-23 09:28:16,808 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:16,808 INFO L146 ILogger]: Finished difference Result 516 states and 517 transitions. [2019-05-23 09:28:16,808 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2019-05-23 09:28:16,809 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 490 [2019-05-23 09:28:16,809 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:16,810 INFO L146 ILogger]: With dead ends: 516 [2019-05-23 09:28:16,810 INFO L146 ILogger]: Without dead ends: 516 [2019-05-23 09:28:16,812 INFO L146 ILogger]: 0 DeclaredPredicates, 625 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2019-05-23 09:28:16,813 INFO L146 ILogger]: Start minimizeSevpa. Operand 516 states. [2019-05-23 09:28:16,815 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 516 to 501. [2019-05-23 09:28:16,815 INFO L146 ILogger]: Start removeUnreachable. Operand 501 states. [2019-05-23 09:28:16,816 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 501 states to 501 states and 502 transitions. [2019-05-23 09:28:16,816 INFO L146 ILogger]: Start accepts. Automaton has 501 states and 502 transitions. Word has length 490 [2019-05-23 09:28:16,816 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:16,816 INFO L146 ILogger]: Abstraction has 501 states and 502 transitions. [2019-05-23 09:28:16,816 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 09:28:16,816 INFO L146 ILogger]: Start isEmpty. Operand 501 states and 502 transitions. [2019-05-23 09:28:16,818 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 498 [2019-05-23 09:28:16,818 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:16,818 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] [2019-05-23 09:28:16,819 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:16,819 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:16,819 INFO L146 ILogger]: Analyzing trace with hash 157872689, now seen corresponding path program 69 times [2019-05-23 09:28:16,819 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:16,851 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:16,856 INFO L146 ILogger]: Trace formula consists of 711 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 09:28:16,859 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:22,250 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:22,250 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:22,251 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 09:28:22,251 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 09:28:22,252 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 09:28:22,252 INFO L146 ILogger]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:28:22,252 INFO L146 ILogger]: Start difference. First operand 501 states and 502 transitions. Second operand 141 states. [2019-05-23 09:28:31,792 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:31,793 INFO L146 ILogger]: Finished difference Result 523 states and 524 transitions. [2019-05-23 09:28:31,793 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-05-23 09:28:31,793 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 497 [2019-05-23 09:28:31,794 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:31,795 INFO L146 ILogger]: With dead ends: 523 [2019-05-23 09:28:31,795 INFO L146 ILogger]: Without dead ends: 523 [2019-05-23 09:28:31,798 INFO L146 ILogger]: 0 DeclaredPredicates, 634 GetRequests, 357 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:31,798 INFO L146 ILogger]: Start minimizeSevpa. Operand 523 states. [2019-05-23 09:28:31,801 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 523 to 508. [2019-05-23 09:28:31,801 INFO L146 ILogger]: Start removeUnreachable. Operand 508 states. [2019-05-23 09:28:31,802 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2019-05-23 09:28:31,802 INFO L146 ILogger]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 497 [2019-05-23 09:28:31,802 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:31,802 INFO L146 ILogger]: Abstraction has 508 states and 509 transitions. [2019-05-23 09:28:31,802 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 09:28:31,802 INFO L146 ILogger]: Start isEmpty. Operand 508 states and 509 transitions. [2019-05-23 09:28:31,804 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 505 [2019-05-23 09:28:31,804 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:31,805 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] [2019-05-23 09:28:31,805 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:31,805 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:31,805 INFO L146 ILogger]: Analyzing trace with hash -602054210, now seen corresponding path program 70 times [2019-05-23 09:28:31,805 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:31,832 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:31,839 INFO L146 ILogger]: Trace formula consists of 721 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:28:31,843 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:37,324 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:37,325 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:37,325 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 09:28:37,325 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 09:28:37,326 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 09:28:37,327 INFO L146 ILogger]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:28:37,327 INFO L146 ILogger]: Start difference. First operand 508 states and 509 transitions. Second operand 143 states. [2019-05-23 09:28:46,984 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:46,984 INFO L146 ILogger]: Finished difference Result 530 states and 531 transitions. [2019-05-23 09:28:46,985 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-05-23 09:28:46,985 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 504 [2019-05-23 09:28:46,985 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:46,987 INFO L146 ILogger]: With dead ends: 530 [2019-05-23 09:28:46,987 INFO L146 ILogger]: Without dead ends: 530 [2019-05-23 09:28:46,988 INFO L146 ILogger]: 0 DeclaredPredicates, 643 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2019-05-23 09:28:46,989 INFO L146 ILogger]: Start minimizeSevpa. Operand 530 states. [2019-05-23 09:28:46,991 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 530 to 515. [2019-05-23 09:28:46,991 INFO L146 ILogger]: Start removeUnreachable. Operand 515 states. [2019-05-23 09:28:46,992 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 515 states to 515 states and 516 transitions. [2019-05-23 09:28:46,992 INFO L146 ILogger]: Start accepts. Automaton has 515 states and 516 transitions. Word has length 504 [2019-05-23 09:28:46,992 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:46,992 INFO L146 ILogger]: Abstraction has 515 states and 516 transitions. [2019-05-23 09:28:46,992 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 09:28:46,992 INFO L146 ILogger]: Start isEmpty. Operand 515 states and 516 transitions. [2019-05-23 09:28:46,995 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 512 [2019-05-23 09:28:46,995 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:46,995 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] [2019-05-23 09:28:46,996 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:46,996 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:46,996 INFO L146 ILogger]: Analyzing trace with hash 811846033, now seen corresponding path program 71 times [2019-05-23 09:28:46,997 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:47,031 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:47,039 INFO L146 ILogger]: Trace formula consists of 731 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:28:47,043 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:52,597 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:52,598 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:52,598 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 09:28:52,598 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 09:28:52,599 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 09:28:52,599 INFO L146 ILogger]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:28:52,599 INFO L146 ILogger]: Start difference. First operand 515 states and 516 transitions. Second operand 145 states. [2019-05-23 09:29:02,629 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:02,630 INFO L146 ILogger]: Finished difference Result 537 states and 538 transitions. [2019-05-23 09:29:02,630 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-05-23 09:29:02,630 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 511 [2019-05-23 09:29:02,631 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:02,632 INFO L146 ILogger]: With dead ends: 537 [2019-05-23 09:29:02,632 INFO L146 ILogger]: Without dead ends: 537 [2019-05-23 09:29:02,635 INFO L146 ILogger]: 0 DeclaredPredicates, 652 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2019-05-23 09:29:02,635 INFO L146 ILogger]: Start minimizeSevpa. Operand 537 states. [2019-05-23 09:29:02,638 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 537 to 522. [2019-05-23 09:29:02,638 INFO L146 ILogger]: Start removeUnreachable. Operand 522 states. [2019-05-23 09:29:02,639 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 522 states to 522 states and 523 transitions. [2019-05-23 09:29:02,639 INFO L146 ILogger]: Start accepts. Automaton has 522 states and 523 transitions. Word has length 511 [2019-05-23 09:29:02,639 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:02,639 INFO L146 ILogger]: Abstraction has 522 states and 523 transitions. [2019-05-23 09:29:02,639 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 09:29:02,639 INFO L146 ILogger]: Start isEmpty. Operand 522 states and 523 transitions. [2019-05-23 09:29:02,641 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 519 [2019-05-23 09:29:02,641 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:02,642 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] [2019-05-23 09:29:02,642 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:02,642 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:02,642 INFO L146 ILogger]: Analyzing trace with hash -654082466, now seen corresponding path program 72 times [2019-05-23 09:29:02,642 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:02,671 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:02,677 INFO L146 ILogger]: Trace formula consists of 741 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:29:02,681 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:08,471 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:08,471 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:08,472 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 09:29:08,472 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 09:29:08,473 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 09:29:08,474 INFO L146 ILogger]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:29:08,474 INFO L146 ILogger]: Start difference. First operand 522 states and 523 transitions. Second operand 147 states. [2019-05-23 09:29:18,580 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:18,580 INFO L146 ILogger]: Finished difference Result 544 states and 545 transitions. [2019-05-23 09:29:18,581 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-05-23 09:29:18,581 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 518 [2019-05-23 09:29:18,581 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:18,584 INFO L146 ILogger]: With dead ends: 544 [2019-05-23 09:29:18,584 INFO L146 ILogger]: Without dead ends: 544 [2019-05-23 09:29:18,587 INFO L146 ILogger]: 0 DeclaredPredicates, 661 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2019-05-23 09:29:18,587 INFO L146 ILogger]: Start minimizeSevpa. Operand 544 states. [2019-05-23 09:29:18,590 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 544 to 529. [2019-05-23 09:29:18,590 INFO L146 ILogger]: Start removeUnreachable. Operand 529 states. [2019-05-23 09:29:18,591 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2019-05-23 09:29:18,591 INFO L146 ILogger]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 518 [2019-05-23 09:29:18,591 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:18,591 INFO L146 ILogger]: Abstraction has 529 states and 530 transitions. [2019-05-23 09:29:18,591 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 09:29:18,591 INFO L146 ILogger]: Start isEmpty. Operand 529 states and 530 transitions. [2019-05-23 09:29:18,593 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 526 [2019-05-23 09:29:18,593 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:18,593 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] [2019-05-23 09:29:18,594 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:18,594 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:18,594 INFO L146 ILogger]: Analyzing trace with hash -1839056655, now seen corresponding path program 73 times [2019-05-23 09:29:18,594 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:18,627 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:18,635 INFO L146 ILogger]: Trace formula consists of 751 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 09:29:18,640 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:24,822 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:24,823 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:24,823 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 09:29:24,823 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 09:29:24,824 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 09:29:24,825 INFO L146 ILogger]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:29:24,825 INFO L146 ILogger]: Start difference. First operand 529 states and 530 transitions. Second operand 149 states. [2019-05-23 09:29:35,246 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:35,247 INFO L146 ILogger]: Finished difference Result 551 states and 552 transitions. [2019-05-23 09:29:35,247 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2019-05-23 09:29:35,247 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 525 [2019-05-23 09:29:35,248 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:35,249 INFO L146 ILogger]: With dead ends: 551 [2019-05-23 09:29:35,249 INFO L146 ILogger]: Without dead ends: 551 [2019-05-23 09:29:35,252 INFO L146 ILogger]: 0 DeclaredPredicates, 670 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2019-05-23 09:29:35,253 INFO L146 ILogger]: Start minimizeSevpa. Operand 551 states. [2019-05-23 09:29:35,255 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 551 to 536. [2019-05-23 09:29:35,255 INFO L146 ILogger]: Start removeUnreachable. Operand 536 states. [2019-05-23 09:29:35,256 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2019-05-23 09:29:35,256 INFO L146 ILogger]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 525 [2019-05-23 09:29:35,256 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:35,256 INFO L146 ILogger]: Abstraction has 536 states and 537 transitions. [2019-05-23 09:29:35,256 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 09:29:35,256 INFO L146 ILogger]: Start isEmpty. Operand 536 states and 537 transitions. [2019-05-23 09:29:35,258 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 533 [2019-05-23 09:29:35,258 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:35,259 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] [2019-05-23 09:29:35,259 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:35,259 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:35,259 INFO L146 ILogger]: Analyzing trace with hash 1948975870, now seen corresponding path program 74 times [2019-05-23 09:29:35,259 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:35,284 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:35,289 INFO L146 ILogger]: Trace formula consists of 761 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:29:35,292 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:41,625 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:41,625 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:41,625 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 09:29:41,626 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 09:29:41,627 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 09:29:41,628 INFO L146 ILogger]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:29:41,628 INFO L146 ILogger]: Start difference. First operand 536 states and 537 transitions. Second operand 151 states. [2019-05-23 09:29:52,127 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:52,127 INFO L146 ILogger]: Finished difference Result 558 states and 559 transitions. [2019-05-23 09:29:52,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2019-05-23 09:29:52,128 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 532 [2019-05-23 09:29:52,128 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:52,130 INFO L146 ILogger]: With dead ends: 558 [2019-05-23 09:29:52,130 INFO L146 ILogger]: Without dead ends: 558 [2019-05-23 09:29:52,133 INFO L146 ILogger]: 0 DeclaredPredicates, 679 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16280 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=28123, Invalid=60979, Unknown=0, NotChecked=0, Total=89102 [2019-05-23 09:29:52,134 INFO L146 ILogger]: Start minimizeSevpa. Operand 558 states. [2019-05-23 09:29:52,137 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 558 to 543. [2019-05-23 09:29:52,138 INFO L146 ILogger]: Start removeUnreachable. Operand 543 states. [2019-05-23 09:29:52,138 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2019-05-23 09:29:52,138 INFO L146 ILogger]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 532 [2019-05-23 09:29:52,138 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:52,138 INFO L146 ILogger]: Abstraction has 543 states and 544 transitions. [2019-05-23 09:29:52,138 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 09:29:52,139 INFO L146 ILogger]: Start isEmpty. Operand 543 states and 544 transitions. [2019-05-23 09:29:52,140 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 540 [2019-05-23 09:29:52,141 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:52,141 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] [2019-05-23 09:29:52,141 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:52,141 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:52,141 INFO L146 ILogger]: Analyzing trace with hash 1966751825, now seen corresponding path program 75 times [2019-05-23 09:29:52,142 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:52,181 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:52,188 INFO L146 ILogger]: Trace formula consists of 771 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 09:29:52,193 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:58,524 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:58,524 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:58,525 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 09:29:58,525 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 09:29:58,526 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 09:29:58,527 INFO L146 ILogger]: CoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:29:58,527 INFO L146 ILogger]: Start difference. First operand 543 states and 544 transitions. Second operand 153 states. [2019-05-23 09:30:09,041 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:09,041 INFO L146 ILogger]: Finished difference Result 565 states and 566 transitions. [2019-05-23 09:30:09,041 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-05-23 09:30:09,041 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 539 [2019-05-23 09:30:09,042 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:09,043 INFO L146 ILogger]: With dead ends: 565 [2019-05-23 09:30:09,044 INFO L146 ILogger]: Without dead ends: 565 [2019-05-23 09:30:09,045 INFO L146 ILogger]: 0 DeclaredPredicates, 688 GetRequests, 387 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:09,046 INFO L146 ILogger]: Start minimizeSevpa. Operand 565 states. [2019-05-23 09:30:09,049 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 565 to 550. [2019-05-23 09:30:09,049 INFO L146 ILogger]: Start removeUnreachable. Operand 550 states. [2019-05-23 09:30:09,049 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 550 states to 550 states and 551 transitions. [2019-05-23 09:30:09,049 INFO L146 ILogger]: Start accepts. Automaton has 550 states and 551 transitions. Word has length 539 [2019-05-23 09:30:09,050 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:09,050 INFO L146 ILogger]: Abstraction has 550 states and 551 transitions. [2019-05-23 09:30:09,050 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 09:30:09,050 INFO L146 ILogger]: Start isEmpty. Operand 550 states and 551 transitions. [2019-05-23 09:30:09,052 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 547 [2019-05-23 09:30:09,052 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:09,052 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] [2019-05-23 09:30:09,052 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:09,052 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:09,052 INFO L146 ILogger]: Analyzing trace with hash 1258155934, now seen corresponding path program 76 times [2019-05-23 09:30:09,053 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:09,078 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:09,084 INFO L146 ILogger]: Trace formula consists of 781 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:30:09,088 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:15,394 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:15,394 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:15,394 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 09:30:15,395 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 09:30:15,396 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 09:30:15,396 INFO L146 ILogger]: CoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:30:15,396 INFO L146 ILogger]: Start difference. First operand 550 states and 551 transitions. Second operand 155 states. [2019-05-23 09:30:26,402 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:26,403 INFO L146 ILogger]: Finished difference Result 572 states and 573 transitions. [2019-05-23 09:30:26,403 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-05-23 09:30:26,403 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 546 [2019-05-23 09:30:26,404 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:26,406 INFO L146 ILogger]: With dead ends: 572 [2019-05-23 09:30:26,406 INFO L146 ILogger]: Without dead ends: 572 [2019-05-23 09:30:26,409 INFO L146 ILogger]: 0 DeclaredPredicates, 697 GetRequests, 392 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:26,409 INFO L146 ILogger]: Start minimizeSevpa. Operand 572 states. [2019-05-23 09:30:26,412 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 572 to 557. [2019-05-23 09:30:26,412 INFO L146 ILogger]: Start removeUnreachable. Operand 557 states. [2019-05-23 09:30:26,412 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 557 states to 557 states and 558 transitions. [2019-05-23 09:30:26,412 INFO L146 ILogger]: Start accepts. Automaton has 557 states and 558 transitions. Word has length 546 [2019-05-23 09:30:26,413 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:26,413 INFO L146 ILogger]: Abstraction has 557 states and 558 transitions. [2019-05-23 09:30:26,413 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 09:30:26,413 INFO L146 ILogger]: Start isEmpty. Operand 557 states and 558 transitions. [2019-05-23 09:30:26,415 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 554 [2019-05-23 09:30:26,415 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:26,415 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] [2019-05-23 09:30:26,415 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:26,415 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:26,416 INFO L146 ILogger]: Analyzing trace with hash 809623473, now seen corresponding path program 77 times [2019-05-23 09:30:26,416 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:26,453 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:26,459 INFO L146 ILogger]: Trace formula consists of 791 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:30:26,462 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:33,325 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:33,325 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:33,325 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 09:30:33,325 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 09:30:33,326 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 09:30:33,327 INFO L146 ILogger]: CoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:30:33,327 INFO L146 ILogger]: Start difference. First operand 557 states and 558 transitions. Second operand 157 states. [2019-05-23 09:30:44,788 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:44,788 INFO L146 ILogger]: Finished difference Result 579 states and 580 transitions. [2019-05-23 09:30:44,788 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-05-23 09:30:44,789 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 553 [2019-05-23 09:30:44,789 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:44,790 INFO L146 ILogger]: With dead ends: 579 [2019-05-23 09:30:44,791 INFO L146 ILogger]: Without dead ends: 579 [2019-05-23 09:30:44,793 INFO L146 ILogger]: 0 DeclaredPredicates, 706 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17633 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=30418, Invalid=65992, Unknown=0, NotChecked=0, Total=96410 [2019-05-23 09:30:44,793 INFO L146 ILogger]: Start minimizeSevpa. Operand 579 states. [2019-05-23 09:30:44,796 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 579 to 564. [2019-05-23 09:30:44,796 INFO L146 ILogger]: Start removeUnreachable. Operand 564 states. [2019-05-23 09:30:44,797 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 564 states to 564 states and 565 transitions. [2019-05-23 09:30:44,797 INFO L146 ILogger]: Start accepts. Automaton has 564 states and 565 transitions. Word has length 553 [2019-05-23 09:30:44,797 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:44,797 INFO L146 ILogger]: Abstraction has 564 states and 565 transitions. [2019-05-23 09:30:44,797 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 09:30:44,797 INFO L146 ILogger]: Start isEmpty. Operand 564 states and 565 transitions. [2019-05-23 09:30:44,799 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 561 [2019-05-23 09:30:44,799 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:44,800 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] [2019-05-23 09:30:44,800 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:44,800 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:44,800 INFO L146 ILogger]: Analyzing trace with hash 963003454, now seen corresponding path program 78 times [2019-05-23 09:30:44,801 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:44,826 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:44,832 INFO L146 ILogger]: Trace formula consists of 801 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:30:44,835 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:51,563 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:51,564 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:51,564 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 09:30:51,564 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 09:30:51,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 09:30:51,566 INFO L146 ILogger]: CoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:30:51,566 INFO L146 ILogger]: Start difference. First operand 564 states and 565 transitions. Second operand 159 states. [2019-05-23 09:31:02,936 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:02,937 INFO L146 ILogger]: Finished difference Result 586 states and 587 transitions. [2019-05-23 09:31:02,937 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2019-05-23 09:31:02,937 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 560 [2019-05-23 09:31:02,938 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:02,939 INFO L146 ILogger]: With dead ends: 586 [2019-05-23 09:31:02,940 INFO L146 ILogger]: Without dead ends: 586 [2019-05-23 09:31:02,942 INFO L146 ILogger]: 0 DeclaredPredicates, 715 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=31203, Invalid=67707, Unknown=0, NotChecked=0, Total=98910 [2019-05-23 09:31:02,943 INFO L146 ILogger]: Start minimizeSevpa. Operand 586 states. [2019-05-23 09:31:02,946 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 586 to 571. [2019-05-23 09:31:02,946 INFO L146 ILogger]: Start removeUnreachable. Operand 571 states. [2019-05-23 09:31:02,946 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 571 states to 571 states and 572 transitions. [2019-05-23 09:31:02,946 INFO L146 ILogger]: Start accepts. Automaton has 571 states and 572 transitions. Word has length 560 [2019-05-23 09:31:02,947 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:02,947 INFO L146 ILogger]: Abstraction has 571 states and 572 transitions. [2019-05-23 09:31:02,947 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 09:31:02,947 INFO L146 ILogger]: Start isEmpty. Operand 571 states and 572 transitions. [2019-05-23 09:31:02,949 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 568 [2019-05-23 09:31:02,949 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:02,949 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] [2019-05-23 09:31:02,950 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:02,950 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:02,950 INFO L146 ILogger]: Analyzing trace with hash -1940973807, now seen corresponding path program 79 times [2019-05-23 09:31:02,950 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:02,987 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:02,995 INFO L146 ILogger]: Trace formula consists of 811 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 09:31:03,000 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:10,033 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:10,033 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:10,033 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 09:31:10,034 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 09:31:10,034 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 09:31:10,035 INFO L146 ILogger]: CoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:31:10,035 INFO L146 ILogger]: Start difference. First operand 571 states and 572 transitions. Second operand 161 states. [2019-05-23 09:31:22,049 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:22,049 INFO L146 ILogger]: Finished difference Result 593 states and 594 transitions. [2019-05-23 09:31:22,050 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-05-23 09:31:22,050 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 567 [2019-05-23 09:31:22,050 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:22,052 INFO L146 ILogger]: With dead ends: 593 [2019-05-23 09:31:22,052 INFO L146 ILogger]: Without dead ends: 593 [2019-05-23 09:31:22,055 INFO L146 ILogger]: 0 DeclaredPredicates, 724 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18565 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=31998, Invalid=69444, Unknown=0, NotChecked=0, Total=101442 [2019-05-23 09:31:22,055 INFO L146 ILogger]: Start minimizeSevpa. Operand 593 states. [2019-05-23 09:31:22,058 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 593 to 578. [2019-05-23 09:31:22,058 INFO L146 ILogger]: Start removeUnreachable. Operand 578 states. [2019-05-23 09:31:22,059 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 578 states to 578 states and 579 transitions. [2019-05-23 09:31:22,059 INFO L146 ILogger]: Start accepts. Automaton has 578 states and 579 transitions. Word has length 567 [2019-05-23 09:31:22,059 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:22,059 INFO L146 ILogger]: Abstraction has 578 states and 579 transitions. [2019-05-23 09:31:22,059 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 09:31:22,060 INFO L146 ILogger]: Start isEmpty. Operand 578 states and 579 transitions. [2019-05-23 09:31:22,062 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 575 [2019-05-23 09:31:22,062 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:22,062 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] [2019-05-23 09:31:22,062 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:22,062 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:22,062 INFO L146 ILogger]: Analyzing trace with hash -103939874, now seen corresponding path program 80 times [2019-05-23 09:31:22,063 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:22,091 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:22,101 INFO L146 ILogger]: Trace formula consists of 821 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:31:22,107 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:29,327 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:29,327 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:29,327 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 09:31:29,328 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 09:31:29,329 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 09:31:29,329 INFO L146 ILogger]: CoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:31:29,329 INFO L146 ILogger]: Start difference. First operand 578 states and 579 transitions. Second operand 163 states. [2019-05-23 09:31:41,607 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:41,607 INFO L146 ILogger]: Finished difference Result 600 states and 601 transitions. [2019-05-23 09:31:41,607 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-05-23 09:31:41,608 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 574 [2019-05-23 09:31:41,608 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:41,610 INFO L146 ILogger]: With dead ends: 600 [2019-05-23 09:31:41,610 INFO L146 ILogger]: Without dead ends: 600 [2019-05-23 09:31:41,613 INFO L146 ILogger]: 0 DeclaredPredicates, 733 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19040 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=32803, Invalid=71203, Unknown=0, NotChecked=0, Total=104006 [2019-05-23 09:31:41,613 INFO L146 ILogger]: Start minimizeSevpa. Operand 600 states. [2019-05-23 09:31:41,616 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 600 to 585. [2019-05-23 09:31:41,616 INFO L146 ILogger]: Start removeUnreachable. Operand 585 states. [2019-05-23 09:31:41,617 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2019-05-23 09:31:41,617 INFO L146 ILogger]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 574 [2019-05-23 09:31:41,617 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:41,617 INFO L146 ILogger]: Abstraction has 585 states and 586 transitions. [2019-05-23 09:31:41,617 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 09:31:41,617 INFO L146 ILogger]: Start isEmpty. Operand 585 states and 586 transitions. [2019-05-23 09:31:41,619 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 582 [2019-05-23 09:31:41,619 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:41,620 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] [2019-05-23 09:31:41,620 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:41,620 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:41,620 INFO L146 ILogger]: Analyzing trace with hash 599254641, now seen corresponding path program 81 times [2019-05-23 09:31:41,621 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:41,648 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:41,655 INFO L146 ILogger]: Trace formula consists of 831 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 09:31:41,659 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:48,886 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:48,887 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:48,887 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 09:31:48,887 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 09:31:48,888 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 09:31:48,889 INFO L146 ILogger]: CoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:31:48,889 INFO L146 ILogger]: Start difference. First operand 585 states and 586 transitions. Second operand 165 states. [2019-05-23 09:32:01,602 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:01,602 INFO L146 ILogger]: Finished difference Result 607 states and 608 transitions. [2019-05-23 09:32:01,603 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2019-05-23 09:32:01,603 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 581 [2019-05-23 09:32:01,604 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:01,605 INFO L146 ILogger]: With dead ends: 607 [2019-05-23 09:32:01,605 INFO L146 ILogger]: Without dead ends: 607 [2019-05-23 09:32:01,609 INFO L146 ILogger]: 0 DeclaredPredicates, 742 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19521 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=33618, Invalid=72984, Unknown=0, NotChecked=0, Total=106602 [2019-05-23 09:32:01,609 INFO L146 ILogger]: Start minimizeSevpa. Operand 607 states. [2019-05-23 09:32:01,612 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 607 to 592. [2019-05-23 09:32:01,613 INFO L146 ILogger]: Start removeUnreachable. Operand 592 states. [2019-05-23 09:32:01,613 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 592 states to 592 states and 593 transitions. [2019-05-23 09:32:01,613 INFO L146 ILogger]: Start accepts. Automaton has 592 states and 593 transitions. Word has length 581 [2019-05-23 09:32:01,613 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:01,614 INFO L146 ILogger]: Abstraction has 592 states and 593 transitions. [2019-05-23 09:32:01,614 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 09:32:01,614 INFO L146 ILogger]: Start isEmpty. Operand 592 states and 593 transitions. [2019-05-23 09:32:01,616 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 589 [2019-05-23 09:32:01,616 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:01,616 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] [2019-05-23 09:32:01,617 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:01,617 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:01,617 INFO L146 ILogger]: Analyzing trace with hash -987814530, now seen corresponding path program 82 times [2019-05-23 09:32:01,618 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:01,656 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:01,663 INFO L146 ILogger]: Trace formula consists of 841 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:32:01,667 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:08,977 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:08,978 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:08,978 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 09:32:08,978 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 09:32:08,979 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 09:32:08,980 INFO L146 ILogger]: CoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:32:08,980 INFO L146 ILogger]: Start difference. First operand 592 states and 593 transitions. Second operand 167 states. [2019-05-23 09:32:22,045 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:22,045 INFO L146 ILogger]: Finished difference Result 614 states and 615 transitions. [2019-05-23 09:32:22,046 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2019-05-23 09:32:22,046 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 588 [2019-05-23 09:32:22,046 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:22,048 INFO L146 ILogger]: With dead ends: 614 [2019-05-23 09:32:22,048 INFO L146 ILogger]: Without dead ends: 614 [2019-05-23 09:32:22,051 INFO L146 ILogger]: 0 DeclaredPredicates, 751 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20008 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=34443, Invalid=74787, Unknown=0, NotChecked=0, Total=109230 [2019-05-23 09:32:22,052 INFO L146 ILogger]: Start minimizeSevpa. Operand 614 states. [2019-05-23 09:32:22,055 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 614 to 599. [2019-05-23 09:32:22,055 INFO L146 ILogger]: Start removeUnreachable. Operand 599 states. [2019-05-23 09:32:22,056 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 599 states to 599 states and 600 transitions. [2019-05-23 09:32:22,056 INFO L146 ILogger]: Start accepts. Automaton has 599 states and 600 transitions. Word has length 588 [2019-05-23 09:32:22,056 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:22,056 INFO L146 ILogger]: Abstraction has 599 states and 600 transitions. [2019-05-23 09:32:22,056 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 09:32:22,056 INFO L146 ILogger]: Start isEmpty. Operand 599 states and 600 transitions. [2019-05-23 09:32:22,058 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 596 [2019-05-23 09:32:22,058 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:22,059 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] [2019-05-23 09:32:22,059 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:22,059 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:22,059 INFO L146 ILogger]: Analyzing trace with hash -1034793519, now seen corresponding path program 83 times [2019-05-23 09:32:22,060 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:22,087 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:22,094 INFO L146 ILogger]: Trace formula consists of 851 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:32:22,098 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:29,647 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:29,647 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:29,647 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 09:32:29,648 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 09:32:29,649 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 09:32:29,649 INFO L146 ILogger]: CoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:32:29,650 INFO L146 ILogger]: Start difference. First operand 599 states and 600 transitions. Second operand 169 states. [2019-05-23 09:32:42,665 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:42,665 INFO L146 ILogger]: Finished difference Result 621 states and 622 transitions. [2019-05-23 09:32:42,665 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2019-05-23 09:32:42,666 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 595 [2019-05-23 09:32:42,666 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:42,668 INFO L146 ILogger]: With dead ends: 621 [2019-05-23 09:32:42,668 INFO L146 ILogger]: Without dead ends: 621 [2019-05-23 09:32:42,671 INFO L146 ILogger]: 0 DeclaredPredicates, 760 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20501 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=35278, Invalid=76612, Unknown=0, NotChecked=0, Total=111890 [2019-05-23 09:32:42,671 INFO L146 ILogger]: Start minimizeSevpa. Operand 621 states. [2019-05-23 09:32:42,675 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 621 to 606. [2019-05-23 09:32:42,675 INFO L146 ILogger]: Start removeUnreachable. Operand 606 states. [2019-05-23 09:32:42,675 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 606 states to 606 states and 607 transitions. [2019-05-23 09:32:42,675 INFO L146 ILogger]: Start accepts. Automaton has 606 states and 607 transitions. Word has length 595 [2019-05-23 09:32:42,676 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:42,676 INFO L146 ILogger]: Abstraction has 606 states and 607 transitions. [2019-05-23 09:32:42,676 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 09:32:42,676 INFO L146 ILogger]: Start isEmpty. Operand 606 states and 607 transitions. [2019-05-23 09:32:42,678 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 603 [2019-05-23 09:32:42,678 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:42,679 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] [2019-05-23 09:32:42,679 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:42,679 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:42,679 INFO L146 ILogger]: Analyzing trace with hash -222055906, now seen corresponding path program 84 times [2019-05-23 09:32:42,680 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:42,709 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:42,715 INFO L146 ILogger]: Trace formula consists of 861 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:32:42,719 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:50,268 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:50,269 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:50,269 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 09:32:50,269 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 09:32:50,270 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 09:32:50,271 INFO L146 ILogger]: CoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:32:50,271 INFO L146 ILogger]: Start difference. First operand 606 states and 607 transitions. Second operand 171 states. [2019-05-23 09:33:03,783 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:03,784 INFO L146 ILogger]: Finished difference Result 628 states and 629 transitions. [2019-05-23 09:33:03,784 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2019-05-23 09:33:03,784 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 602 [2019-05-23 09:33:03,785 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:03,787 INFO L146 ILogger]: With dead ends: 628 [2019-05-23 09:33:03,787 INFO L146 ILogger]: Without dead ends: 628 [2019-05-23 09:33:03,790 INFO L146 ILogger]: 0 DeclaredPredicates, 769 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21000 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=36123, Invalid=78459, Unknown=0, NotChecked=0, Total=114582 [2019-05-23 09:33:03,791 INFO L146 ILogger]: Start minimizeSevpa. Operand 628 states. [2019-05-23 09:33:03,794 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 628 to 613. [2019-05-23 09:33:03,794 INFO L146 ILogger]: Start removeUnreachable. Operand 613 states. [2019-05-23 09:33:03,795 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 613 states to 613 states and 614 transitions. [2019-05-23 09:33:03,795 INFO L146 ILogger]: Start accepts. Automaton has 613 states and 614 transitions. Word has length 602 [2019-05-23 09:33:03,795 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:03,796 INFO L146 ILogger]: Abstraction has 613 states and 614 transitions. [2019-05-23 09:33:03,796 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 09:33:03,796 INFO L146 ILogger]: Start isEmpty. Operand 613 states and 614 transitions. [2019-05-23 09:33:03,798 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 610 [2019-05-23 09:33:03,798 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:03,799 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] [2019-05-23 09:33:03,799 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:03,799 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:03,799 INFO L146 ILogger]: Analyzing trace with hash -982233807, now seen corresponding path program 85 times [2019-05-23 09:33:03,800 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:03,831 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:03,837 INFO L146 ILogger]: Trace formula consists of 871 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 09:33:03,841 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:11,883 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:11,883 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:11,883 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2019-05-23 09:33:11,884 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 09:33:11,886 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 09:33:11,887 INFO L146 ILogger]: CoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:33:11,887 INFO L146 ILogger]: Start difference. First operand 613 states and 614 transitions. Second operand 173 states. [2019-05-23 09:33:25,536 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:25,537 INFO L146 ILogger]: Finished difference Result 635 states and 636 transitions. [2019-05-23 09:33:25,537 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-05-23 09:33:25,537 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 609 [2019-05-23 09:33:25,538 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:25,540 INFO L146 ILogger]: With dead ends: 635 [2019-05-23 09:33:25,540 INFO L146 ILogger]: Without dead ends: 635 [2019-05-23 09:33:25,544 INFO L146 ILogger]: 0 DeclaredPredicates, 778 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21505 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=36978, Invalid=80328, Unknown=0, NotChecked=0, Total=117306 [2019-05-23 09:33:25,545 INFO L146 ILogger]: Start minimizeSevpa. Operand 635 states. [2019-05-23 09:33:25,548 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 635 to 620. [2019-05-23 09:33:25,548 INFO L146 ILogger]: Start removeUnreachable. Operand 620 states. [2019-05-23 09:33:25,549 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 620 states to 620 states and 621 transitions. [2019-05-23 09:33:25,549 INFO L146 ILogger]: Start accepts. Automaton has 620 states and 621 transitions. Word has length 609 [2019-05-23 09:33:25,549 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:25,549 INFO L146 ILogger]: Abstraction has 620 states and 621 transitions. [2019-05-23 09:33:25,549 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 09:33:25,550 INFO L146 ILogger]: Start isEmpty. Operand 620 states and 621 transitions. [2019-05-23 09:33:25,552 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 617 [2019-05-23 09:33:25,552 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:25,553 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] [2019-05-23 09:33:25,553 INFO L146 ILogger]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:25,553 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:25,553 INFO L146 ILogger]: Analyzing trace with hash -1733974338, now seen corresponding path program 86 times [2019-05-23 09:33:25,553 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:25,582 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:25,589 INFO L146 ILogger]: Trace formula consists of 881 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:33:25,592 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:33,837 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:33,837 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:33,837 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2019-05-23 09:33:33,838 INFO L146 ILogger]: Interpolant automaton has 175 states [2019-05-23 09:33:33,840 INFO L146 ILogger]: Constructing interpolant automaton starting with 175 interpolants. [2019-05-23 09:33:33,841 INFO L146 ILogger]: CoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:33:33,841 INFO L146 ILogger]: Start difference. First operand 620 states and 621 transitions. Second operand 175 states. [2019-05-23 09:33:47,655 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:47,656 INFO L146 ILogger]: Finished difference Result 642 states and 643 transitions. [2019-05-23 09:33:47,656 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-05-23 09:33:47,656 INFO L146 ILogger]: Start accepts. Automaton has 175 states. Word has length 616 [2019-05-23 09:33:47,657 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:47,658 INFO L146 ILogger]: With dead ends: 642 [2019-05-23 09:33:47,659 INFO L146 ILogger]: Without dead ends: 642 [2019-05-23 09:33:47,663 INFO L146 ILogger]: 0 DeclaredPredicates, 787 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22016 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=37843, Invalid=82219, Unknown=0, NotChecked=0, Total=120062 [2019-05-23 09:33:47,663 INFO L146 ILogger]: Start minimizeSevpa. Operand 642 states. [2019-05-23 09:33:47,667 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 642 to 627. [2019-05-23 09:33:47,667 INFO L146 ILogger]: Start removeUnreachable. Operand 627 states. [2019-05-23 09:33:47,667 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 627 states to 627 states and 628 transitions. [2019-05-23 09:33:47,667 INFO L146 ILogger]: Start accepts. Automaton has 627 states and 628 transitions. Word has length 616 [2019-05-23 09:33:47,668 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:47,668 INFO L146 ILogger]: Abstraction has 627 states and 628 transitions. [2019-05-23 09:33:47,668 INFO L146 ILogger]: Interpolant automaton has 175 states. [2019-05-23 09:33:47,668 INFO L146 ILogger]: Start isEmpty. Operand 627 states and 628 transitions. [2019-05-23 09:33:47,670 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 624 [2019-05-23 09:33:47,671 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:47,671 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] [2019-05-23 09:33:47,671 INFO L146 ILogger]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:47,671 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:47,671 INFO L146 ILogger]: Analyzing trace with hash 2079581329, now seen corresponding path program 87 times [2019-05-23 09:33:47,672 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:47,712 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:47,723 INFO L146 ILogger]: Trace formula consists of 891 conjuncts, 176 conjunts are in the unsatisfiable core [2019-05-23 09:33:47,728 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:56,098 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:56,098 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:56,098 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2019-05-23 09:33:56,099 INFO L146 ILogger]: Interpolant automaton has 177 states [2019-05-23 09:33:56,100 INFO L146 ILogger]: Constructing interpolant automaton starting with 177 interpolants. [2019-05-23 09:33:56,101 INFO L146 ILogger]: CoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 09:33:56,101 INFO L146 ILogger]: Start difference. First operand 627 states and 628 transitions. Second operand 177 states. [2019-05-23 09:34:10,631 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:10,632 INFO L146 ILogger]: Finished difference Result 649 states and 650 transitions. [2019-05-23 09:34:10,632 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-05-23 09:34:10,632 INFO L146 ILogger]: Start accepts. Automaton has 177 states. Word has length 623 [2019-05-23 09:34:10,632 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:10,635 INFO L146 ILogger]: With dead ends: 649 [2019-05-23 09:34:10,635 INFO L146 ILogger]: Without dead ends: 649 [2019-05-23 09:34:10,638 INFO L146 ILogger]: 0 DeclaredPredicates, 796 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22533 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=38718, Invalid=84132, Unknown=0, NotChecked=0, Total=122850 [2019-05-23 09:34:10,639 INFO L146 ILogger]: Start minimizeSevpa. Operand 649 states. [2019-05-23 09:34:10,642 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 649 to 634. [2019-05-23 09:34:10,642 INFO L146 ILogger]: Start removeUnreachable. Operand 634 states. [2019-05-23 09:34:10,643 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 634 states to 634 states and 635 transitions. [2019-05-23 09:34:10,643 INFO L146 ILogger]: Start accepts. Automaton has 634 states and 635 transitions. Word has length 623 [2019-05-23 09:34:10,643 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:10,643 INFO L146 ILogger]: Abstraction has 634 states and 635 transitions. [2019-05-23 09:34:10,643 INFO L146 ILogger]: Interpolant automaton has 177 states. [2019-05-23 09:34:10,643 INFO L146 ILogger]: Start isEmpty. Operand 634 states and 635 transitions. [2019-05-23 09:34:10,646 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 631 [2019-05-23 09:34:10,646 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:10,646 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] [2019-05-23 09:34:10,646 INFO L146 ILogger]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:10,646 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:10,646 INFO L146 ILogger]: Analyzing trace with hash 724501342, now seen corresponding path program 88 times [2019-05-23 09:34:10,647 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:10,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:10,683 INFO L146 ILogger]: Trace formula consists of 901 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 09:34:10,687 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:19,388 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:19,388 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:19,388 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2019-05-23 09:34:19,389 INFO L146 ILogger]: Interpolant automaton has 179 states [2019-05-23 09:34:19,390 INFO L146 ILogger]: Constructing interpolant automaton starting with 179 interpolants. [2019-05-23 09:34:19,390 INFO L146 ILogger]: CoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:34:19,390 INFO L146 ILogger]: Start difference. First operand 634 states and 635 transitions. Second operand 179 states. [2019-05-23 09:34:34,047 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:34,047 INFO L146 ILogger]: Finished difference Result 656 states and 657 transitions. [2019-05-23 09:34:34,047 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2019-05-23 09:34:34,047 INFO L146 ILogger]: Start accepts. Automaton has 179 states. Word has length 630 [2019-05-23 09:34:34,048 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:34,050 INFO L146 ILogger]: With dead ends: 656 [2019-05-23 09:34:34,050 INFO L146 ILogger]: Without dead ends: 656 [2019-05-23 09:34:34,054 INFO L146 ILogger]: 0 DeclaredPredicates, 805 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23056 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=39603, Invalid=86067, Unknown=0, NotChecked=0, Total=125670 [2019-05-23 09:34:34,054 INFO L146 ILogger]: Start minimizeSevpa. Operand 656 states. [2019-05-23 09:34:34,059 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 656 to 641. [2019-05-23 09:34:34,059 INFO L146 ILogger]: Start removeUnreachable. Operand 641 states. [2019-05-23 09:34:34,060 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 641 states to 641 states and 642 transitions. [2019-05-23 09:34:34,060 INFO L146 ILogger]: Start accepts. Automaton has 641 states and 642 transitions. Word has length 630 [2019-05-23 09:34:34,060 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:34,060 INFO L146 ILogger]: Abstraction has 641 states and 642 transitions. [2019-05-23 09:34:34,060 INFO L146 ILogger]: Interpolant automaton has 179 states. [2019-05-23 09:34:34,060 INFO L146 ILogger]: Start isEmpty. Operand 641 states and 642 transitions. [2019-05-23 09:34:34,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 638 [2019-05-23 09:34:34,064 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:34,065 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] [2019-05-23 09:34:34,065 INFO L146 ILogger]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:34,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:34,065 INFO L146 ILogger]: Analyzing trace with hash -2044259343, now seen corresponding path program 89 times [2019-05-23 09:34:34,066 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:34,107 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:34,117 INFO L146 ILogger]: Trace formula consists of 911 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 09:34:34,123 INFO L146 ILogger]: Computing forward predicates...