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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:22:05,124 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:22:05,127 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:22:05,141 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:22:05,141 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:22:05,142 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:22:05,146 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:22:05,149 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:22:05,151 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:22:05,151 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:22:05,152 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:22:05,153 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:22:05,154 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:22:05,155 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:22:05,156 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:22:05,156 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:22:05,157 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:22:05,159 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:22:05,161 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:22:05,163 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:22:05,164 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:22:05,166 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:22:05,170 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:22:05,170 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:22:05,170 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:22:05,171 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:22:05,173 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:22:05,174 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:22:05,174 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:22:05,175 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:22:05,176 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:22:05,178 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:22:05,179 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:22:05,179 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:22:05,180 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:22:05,180 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:22:05,180 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:22:05,182 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:22:05,183 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:22:05,221 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:22:05,234 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:22:05,237 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:22:05,238 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:22:05,239 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:22:05,240 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-05-23 09:22:05,240 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-05-23 09:22:05,275 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:22:05,277 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:22:05,278 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:05,278 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:22:05,278 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:22:05,294 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,306 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,313 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:22:05,313 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:22:05,313 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:22:05,315 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:05,316 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:22:05,316 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:22:05,316 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:22:05,327 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,327 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,328 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,328 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,333 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,337 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,338 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/1) ... [2019-05-23 09:22:05,339 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:22:05,340 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:22:05,340 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:22:05,340 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:22:05,341 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (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:22:05,412 INFO L146 ILogger]: Found specification of procedure main [2019-05-23 09:22:05,412 INFO L146 ILogger]: Found implementation of procedure main [2019-05-23 09:22:05,412 INFO L146 ILogger]: Found specification of procedure ~malloc [2019-05-23 09:22:05,692 INFO L146 ILogger]: Using library mode [2019-05-23 09:22:05,693 INFO L146 ILogger]: Removed 1 assume(true) statements. [2019-05-23 09:22:05,694 INFO L146 ILogger]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:05 BoogieIcfgContainer [2019-05-23 09:22:05,694 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:22:05,695 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:22:05,695 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:22:05,698 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:22:05,698 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:22:05" (1/2) ... [2019-05-23 09:22:05,699 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f8e875 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:22:05, skipping insertion in model container [2019-05-23 09:22:05,700 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:05" (2/2) ... [2019-05-23 09:22:05,701 INFO L146 ILogger]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-05-23 09:22:05,710 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:22:05,717 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:22:05,732 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:22:05,756 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:22:05,757 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:22:05,757 INFO L146 ILogger]: Hoare is false [2019-05-23 09:22:05,757 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:22:05,757 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:22:05,757 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:22:05,757 INFO L146 ILogger]: Difference is false [2019-05-23 09:22:05,758 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:22:05,758 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:22:05,772 INFO L146 ILogger]: Start isEmpty. Operand 9 states. [2019-05-23 09:22:05,779 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 6 [2019-05-23 09:22:05,780 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,781 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1] [2019-05-23 09:22:05,783 INFO L146 ILogger]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,788 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,788 INFO L146 ILogger]: Analyzing trace with hash 28664004, now seen corresponding path program 1 times [2019-05-23 09:22:05,832 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,879 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,882 INFO L146 ILogger]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,887 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,993 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:05,997 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,084 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,085 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,085 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:06,183 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:22:06,186 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:22:06,186 INFO L146 ILogger]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-23 09:22:06,190 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:22:06,201 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:22:06,202 INFO L146 ILogger]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:22:06,203 INFO L146 ILogger]: Start difference. First operand 9 states. Second operand 4 states. [2019-05-23 09:22:06,393 WARN L146 ILogger]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-05-23 09:22:06,518 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,518 INFO L146 ILogger]: Finished difference Result 15 states and 15 transitions. [2019-05-23 09:22:06,519 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:22:06,520 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-23 09:22:06,521 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,530 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:22:06,531 INFO L146 ILogger]: Without dead ends: 11 [2019-05-23 09:22:06,533 INFO L146 ILogger]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:06,553 INFO L146 ILogger]: Start minimizeSevpa. Operand 11 states. [2019-05-23 09:22:06,566 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-05-23 09:22:06,568 INFO L146 ILogger]: Start removeUnreachable. Operand 10 states. [2019-05-23 09:22:06,568 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-05-23 09:22:06,570 INFO L146 ILogger]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2019-05-23 09:22:06,570 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,571 INFO L146 ILogger]: Abstraction has 10 states and 10 transitions. [2019-05-23 09:22:06,571 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:22:06,571 INFO L146 ILogger]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-23 09:22:06,571 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 10 [2019-05-23 09:22:06,572 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,572 INFO L146 ILogger]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-05-23 09:22:06,572 INFO L146 ILogger]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,573 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,573 INFO L146 ILogger]: Analyzing trace with hash 1927538493, now seen corresponding path program 1 times [2019-05-23 09:22:06,574 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,593 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,595 INFO L146 ILogger]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,596 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,625 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:06,626 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,651 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,651 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,652 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:06,781 INFO L146 ILogger]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,781 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,782 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 09:22:06,783 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:06,784 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:06,784 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:06,784 INFO L146 ILogger]: Start difference. First operand 10 states and 10 transitions. Second operand 5 states. [2019-05-23 09:22:07,014 WARN L146 ILogger]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:07,112 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,112 INFO L146 ILogger]: Finished difference Result 15 states and 15 transitions. [2019-05-23 09:22:07,113 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:22:07,113 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 9 [2019-05-23 09:22:07,113 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,113 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:22:07,114 INFO L146 ILogger]: Without dead ends: 15 [2019-05-23 09:22:07,115 INFO L146 ILogger]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:07,115 INFO L146 ILogger]: Start minimizeSevpa. Operand 15 states. [2019-05-23 09:22:07,117 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-05-23 09:22:07,117 INFO L146 ILogger]: Start removeUnreachable. Operand 14 states. [2019-05-23 09:22:07,118 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-05-23 09:22:07,118 INFO L146 ILogger]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 9 [2019-05-23 09:22:07,119 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,119 INFO L146 ILogger]: Abstraction has 14 states and 14 transitions. [2019-05-23 09:22:07,119 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:07,119 INFO L146 ILogger]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-23 09:22:07,120 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 09:22:07,120 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,120 INFO L146 ILogger]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-05-23 09:22:07,120 INFO L146 ILogger]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,120 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,121 INFO L146 ILogger]: Analyzing trace with hash 67668278, now seen corresponding path program 2 times [2019-05-23 09:22:07,122 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,142 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,144 INFO L146 ILogger]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,146 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,156 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:07,156 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,172 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,173 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,173 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:07,260 INFO L146 ILogger]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,261 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,261 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 09:22:07,262 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:22:07,262 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:22:07,262 INFO L146 ILogger]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:07,263 INFO L146 ILogger]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2019-05-23 09:22:07,532 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,532 INFO L146 ILogger]: Finished difference Result 19 states and 19 transitions. [2019-05-23 09:22:07,533 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:07,533 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 13 [2019-05-23 09:22:07,533 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,534 INFO L146 ILogger]: With dead ends: 19 [2019-05-23 09:22:07,535 INFO L146 ILogger]: Without dead ends: 19 [2019-05-23 09:22:07,535 INFO L146 ILogger]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:07,536 INFO L146 ILogger]: Start minimizeSevpa. Operand 19 states. [2019-05-23 09:22:07,538 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-05-23 09:22:07,538 INFO L146 ILogger]: Start removeUnreachable. Operand 18 states. [2019-05-23 09:22:07,539 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-05-23 09:22:07,539 INFO L146 ILogger]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2019-05-23 09:22:07,541 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,541 INFO L146 ILogger]: Abstraction has 18 states and 18 transitions. [2019-05-23 09:22:07,541 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:22:07,542 INFO L146 ILogger]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-23 09:22:07,542 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 18 [2019-05-23 09:22:07,542 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,543 INFO L146 ILogger]: trace histogram [4, 4, 3, 3, 1, 1, 1] [2019-05-23 09:22:07,543 INFO L146 ILogger]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,543 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,543 INFO L146 ILogger]: Analyzing trace with hash 1302955695, now seen corresponding path program 3 times [2019-05-23 09:22:07,545 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,592 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,594 INFO L146 ILogger]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,597 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,609 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:07,609 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,620 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,620 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,621 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:07,718 INFO L146 ILogger]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,719 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,720 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:22:07,720 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:22:07,720 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:22:07,721 INFO L146 ILogger]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:07,721 INFO L146 ILogger]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2019-05-23 09:22:08,019 WARN L146 ILogger]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:08,138 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,139 INFO L146 ILogger]: Finished difference Result 23 states and 23 transitions. [2019-05-23 09:22:08,139 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:22:08,139 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 17 [2019-05-23 09:22:08,140 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,140 INFO L146 ILogger]: With dead ends: 23 [2019-05-23 09:22:08,141 INFO L146 ILogger]: Without dead ends: 23 [2019-05-23 09:22:08,141 INFO L146 ILogger]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:08,142 INFO L146 ILogger]: Start minimizeSevpa. Operand 23 states. [2019-05-23 09:22:08,144 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-05-23 09:22:08,144 INFO L146 ILogger]: Start removeUnreachable. Operand 22 states. [2019-05-23 09:22:08,145 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-05-23 09:22:08,145 INFO L146 ILogger]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2019-05-23 09:22:08,145 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,146 INFO L146 ILogger]: Abstraction has 22 states and 22 transitions. [2019-05-23 09:22:08,146 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:22:08,146 INFO L146 ILogger]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-23 09:22:08,146 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 09:22:08,147 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,147 INFO L146 ILogger]: trace histogram [5, 5, 4, 4, 1, 1, 1] [2019-05-23 09:22:08,147 INFO L146 ILogger]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,147 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,148 INFO L146 ILogger]: Analyzing trace with hash -1154670680, now seen corresponding path program 4 times [2019-05-23 09:22:08,148 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,171 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,174 INFO L146 ILogger]: Trace formula consists of 43 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,175 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,216 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:08,217 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,229 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,229 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,230 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:08,442 INFO L146 ILogger]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,442 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,443 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:22:08,443 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:22:08,443 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:22:08,444 INFO L146 ILogger]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:08,444 INFO L146 ILogger]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2019-05-23 09:22:08,597 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,598 INFO L146 ILogger]: Finished difference Result 27 states and 27 transitions. [2019-05-23 09:22:08,599 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:22:08,599 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 21 [2019-05-23 09:22:08,600 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,600 INFO L146 ILogger]: With dead ends: 27 [2019-05-23 09:22:08,601 INFO L146 ILogger]: Without dead ends: 27 [2019-05-23 09:22:08,601 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:08,602 INFO L146 ILogger]: Start minimizeSevpa. Operand 27 states. [2019-05-23 09:22:08,604 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-05-23 09:22:08,605 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 09:22:08,605 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-05-23 09:22:08,606 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2019-05-23 09:22:08,607 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,607 INFO L146 ILogger]: Abstraction has 26 states and 26 transitions. [2019-05-23 09:22:08,607 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:22:08,607 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-23 09:22:08,608 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 26 [2019-05-23 09:22:08,608 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,608 INFO L146 ILogger]: trace histogram [6, 6, 5, 5, 1, 1, 1] [2019-05-23 09:22:08,609 INFO L146 ILogger]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,609 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,609 INFO L146 ILogger]: Analyzing trace with hash 450466849, now seen corresponding path program 5 times [2019-05-23 09:22:08,611 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,639 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,642 INFO L146 ILogger]: Trace formula consists of 50 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,644 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,678 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:08,678 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,686 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,687 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,687 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:08,800 INFO L146 ILogger]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,801 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,801 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:22:08,801 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:08,801 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:08,802 INFO L146 ILogger]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:08,802 INFO L146 ILogger]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2019-05-23 09:22:09,046 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,046 INFO L146 ILogger]: Finished difference Result 31 states and 31 transitions. [2019-05-23 09:22:09,047 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:09,047 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 25 [2019-05-23 09:22:09,048 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,049 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 09:22:09,049 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 09:22:09,050 INFO L146 ILogger]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:09,050 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 09:22:09,053 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-05-23 09:22:09,053 INFO L146 ILogger]: Start removeUnreachable. Operand 30 states. [2019-05-23 09:22:09,054 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-05-23 09:22:09,054 INFO L146 ILogger]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2019-05-23 09:22:09,054 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,054 INFO L146 ILogger]: Abstraction has 30 states and 30 transitions. [2019-05-23 09:22:09,054 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:09,055 INFO L146 ILogger]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-23 09:22:09,055 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 30 [2019-05-23 09:22:09,055 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,056 INFO L146 ILogger]: trace histogram [7, 7, 6, 6, 1, 1, 1] [2019-05-23 09:22:09,056 INFO L146 ILogger]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,056 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,056 INFO L146 ILogger]: Analyzing trace with hash 768943130, now seen corresponding path program 6 times [2019-05-23 09:22:09,057 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,096 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,103 INFO L146 ILogger]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,107 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,118 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:09,118 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,137 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,137 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,137 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:09,280 INFO L146 ILogger]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,280 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,281 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:22:09,281 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:22:09,281 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:22:09,282 INFO L146 ILogger]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:09,282 INFO L146 ILogger]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2019-05-23 09:22:09,460 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,460 INFO L146 ILogger]: Finished difference Result 35 states and 35 transitions. [2019-05-23 09:22:09,461 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:22:09,461 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 29 [2019-05-23 09:22:09,461 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,462 INFO L146 ILogger]: With dead ends: 35 [2019-05-23 09:22:09,462 INFO L146 ILogger]: Without dead ends: 35 [2019-05-23 09:22:09,463 INFO L146 ILogger]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:09,463 INFO L146 ILogger]: Start minimizeSevpa. Operand 35 states. [2019-05-23 09:22:09,466 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-05-23 09:22:09,466 INFO L146 ILogger]: Start removeUnreachable. Operand 34 states. [2019-05-23 09:22:09,467 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-05-23 09:22:09,467 INFO L146 ILogger]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 29 [2019-05-23 09:22:09,468 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,468 INFO L146 ILogger]: Abstraction has 34 states and 34 transitions. [2019-05-23 09:22:09,468 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:22:09,468 INFO L146 ILogger]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-23 09:22:09,469 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 34 [2019-05-23 09:22:09,469 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,469 INFO L146 ILogger]: trace histogram [8, 8, 7, 7, 1, 1, 1] [2019-05-23 09:22:09,470 INFO L146 ILogger]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,470 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,470 INFO L146 ILogger]: Analyzing trace with hash 942018451, now seen corresponding path program 7 times [2019-05-23 09:22:09,471 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,496 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,500 INFO L146 ILogger]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,504 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,508 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:09,509 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,519 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,519 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,520 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:09,678 INFO L146 ILogger]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,679 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,679 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:09,679 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:09,680 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:09,680 INFO L146 ILogger]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:09,680 INFO L146 ILogger]: Start difference. First operand 34 states and 34 transitions. Second operand 11 states. [2019-05-23 09:22:09,887 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,887 INFO L146 ILogger]: Finished difference Result 39 states and 39 transitions. [2019-05-23 09:22:09,889 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:22:09,889 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 33 [2019-05-23 09:22:09,890 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,891 INFO L146 ILogger]: With dead ends: 39 [2019-05-23 09:22:09,891 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 09:22:09,892 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:09,892 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 09:22:09,895 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-05-23 09:22:09,895 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 09:22:09,896 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-05-23 09:22:09,896 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 33 [2019-05-23 09:22:09,897 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,897 INFO L146 ILogger]: Abstraction has 38 states and 38 transitions. [2019-05-23 09:22:09,897 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:09,897 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-23 09:22:09,898 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:22:09,898 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,898 INFO L146 ILogger]: trace histogram [9, 9, 8, 8, 1, 1, 1] [2019-05-23 09:22:09,899 INFO L146 ILogger]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,899 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,899 INFO L146 ILogger]: Analyzing trace with hash -1867344244, now seen corresponding path program 8 times [2019-05-23 09:22:09,900 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,926 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,929 INFO L146 ILogger]: Trace formula consists of 71 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,931 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,953 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:09,954 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,963 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,964 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,964 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:10,253 INFO L146 ILogger]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:10,253 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,254 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:22:10,254 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:22:10,254 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:22:10,255 INFO L146 ILogger]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:10,255 INFO L146 ILogger]: Start difference. First operand 38 states and 38 transitions. Second operand 12 states. [2019-05-23 09:22:10,783 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,783 INFO L146 ILogger]: Finished difference Result 43 states and 43 transitions. [2019-05-23 09:22:10,785 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:10,785 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 37 [2019-05-23 09:22:10,785 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,786 INFO L146 ILogger]: With dead ends: 43 [2019-05-23 09:22:10,786 INFO L146 ILogger]: Without dead ends: 43 [2019-05-23 09:22:10,787 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:10,787 INFO L146 ILogger]: Start minimizeSevpa. Operand 43 states. [2019-05-23 09:22:10,789 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-05-23 09:22:10,790 INFO L146 ILogger]: Start removeUnreachable. Operand 42 states. [2019-05-23 09:22:10,790 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-05-23 09:22:10,790 INFO L146 ILogger]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 37 [2019-05-23 09:22:10,791 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,791 INFO L146 ILogger]: Abstraction has 42 states and 42 transitions. [2019-05-23 09:22:10,791 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:22:10,791 INFO L146 ILogger]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-23 09:22:10,792 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 42 [2019-05-23 09:22:10,792 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,792 INFO L146 ILogger]: trace histogram [10, 10, 9, 9, 1, 1, 1] [2019-05-23 09:22:10,792 INFO L146 ILogger]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,792 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,792 INFO L146 ILogger]: Analyzing trace with hash 826341637, now seen corresponding path program 9 times [2019-05-23 09:22:10,793 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,820 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,822 INFO L146 ILogger]: Trace formula consists of 78 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,825 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,865 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:10,865 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:10,939 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:10,940 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:10,940 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:11,386 INFO L146 ILogger]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,386 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,386 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:11,387 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:11,387 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:11,387 INFO L146 ILogger]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:11,387 INFO L146 ILogger]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2019-05-23 09:22:11,649 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,650 INFO L146 ILogger]: Finished difference Result 47 states and 47 transitions. [2019-05-23 09:22:11,650 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:22:11,650 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 41 [2019-05-23 09:22:11,651 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,652 INFO L146 ILogger]: With dead ends: 47 [2019-05-23 09:22:11,652 INFO L146 ILogger]: Without dead ends: 47 [2019-05-23 09:22:11,653 INFO L146 ILogger]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:11,653 INFO L146 ILogger]: Start minimizeSevpa. Operand 47 states. [2019-05-23 09:22:11,657 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-05-23 09:22:11,657 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 09:22:11,658 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-05-23 09:22:11,658 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 41 [2019-05-23 09:22:11,658 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,658 INFO L146 ILogger]: Abstraction has 46 states and 46 transitions. [2019-05-23 09:22:11,659 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:11,659 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-23 09:22:11,659 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 46 [2019-05-23 09:22:11,660 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,660 INFO L146 ILogger]: trace histogram [11, 11, 10, 10, 1, 1, 1] [2019-05-23 09:22:11,660 INFO L146 ILogger]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,660 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,660 INFO L146 ILogger]: Analyzing trace with hash 1182234366, now seen corresponding path program 10 times [2019-05-23 09:22:11,661 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,686 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,689 INFO L146 ILogger]: Trace formula consists of 85 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,691 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,702 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:11,703 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:11,714 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:11,715 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:11,715 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:11,902 INFO L146 ILogger]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,902 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,902 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:22:11,902 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:22:11,903 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:22:11,903 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:11,903 INFO L146 ILogger]: Start difference. First operand 46 states and 46 transitions. Second operand 14 states. [2019-05-23 09:22:12,319 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,319 INFO L146 ILogger]: Finished difference Result 51 states and 51 transitions. [2019-05-23 09:22:12,320 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:22:12,320 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 45 [2019-05-23 09:22:12,320 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,321 INFO L146 ILogger]: With dead ends: 51 [2019-05-23 09:22:12,321 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:22:12,324 INFO L146 ILogger]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:12,325 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:22:12,330 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-05-23 09:22:12,330 INFO L146 ILogger]: Start removeUnreachable. Operand 50 states. [2019-05-23 09:22:12,331 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-05-23 09:22:12,331 INFO L146 ILogger]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 45 [2019-05-23 09:22:12,331 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,331 INFO L146 ILogger]: Abstraction has 50 states and 50 transitions. [2019-05-23 09:22:12,331 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:22:12,332 INFO L146 ILogger]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-23 09:22:12,333 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:22:12,333 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,333 INFO L146 ILogger]: trace histogram [12, 12, 11, 11, 1, 1, 1] [2019-05-23 09:22:12,334 INFO L146 ILogger]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,334 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,334 INFO L146 ILogger]: Analyzing trace with hash -1076080521, now seen corresponding path program 11 times [2019-05-23 09:22:12,335 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,392 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,398 INFO L146 ILogger]: Trace formula consists of 92 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,403 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,410 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:12,410 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:12,418 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:12,419 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:12,419 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:12,779 INFO L146 ILogger]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,780 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,780 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:12,780 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:12,780 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:12,781 INFO L146 ILogger]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:12,781 INFO L146 ILogger]: Start difference. First operand 50 states and 50 transitions. Second operand 15 states. [2019-05-23 09:22:13,030 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,030 INFO L146 ILogger]: Finished difference Result 55 states and 55 transitions. [2019-05-23 09:22:13,030 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:13,031 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 49 [2019-05-23 09:22:13,031 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,032 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 09:22:13,032 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:22:13,033 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:13,034 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:22:13,036 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-05-23 09:22:13,037 INFO L146 ILogger]: Start removeUnreachable. Operand 54 states. [2019-05-23 09:22:13,037 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-05-23 09:22:13,038 INFO L146 ILogger]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 49 [2019-05-23 09:22:13,038 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,038 INFO L146 ILogger]: Abstraction has 54 states and 54 transitions. [2019-05-23 09:22:13,038 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:13,038 INFO L146 ILogger]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-23 09:22:13,039 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 54 [2019-05-23 09:22:13,039 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,039 INFO L146 ILogger]: trace histogram [13, 13, 12, 12, 1, 1, 1] [2019-05-23 09:22:13,039 INFO L146 ILogger]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,040 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,040 INFO L146 ILogger]: Analyzing trace with hash -539638416, now seen corresponding path program 12 times [2019-05-23 09:22:13,041 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,064 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,066 INFO L146 ILogger]: Trace formula consists of 99 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,069 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,108 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:13,109 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,178 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:13,178 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,179 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:13,555 INFO L146 ILogger]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,556 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,556 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:22:13,556 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:22:13,556 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:22:13,557 INFO L146 ILogger]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:13,557 INFO L146 ILogger]: Start difference. First operand 54 states and 54 transitions. Second operand 16 states. [2019-05-23 09:22:13,891 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,891 INFO L146 ILogger]: Finished difference Result 59 states and 59 transitions. [2019-05-23 09:22:13,891 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:22:13,891 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 53 [2019-05-23 09:22:13,892 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,893 INFO L146 ILogger]: With dead ends: 59 [2019-05-23 09:22:13,893 INFO L146 ILogger]: Without dead ends: 59 [2019-05-23 09:22:13,894 INFO L146 ILogger]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:13,894 INFO L146 ILogger]: Start minimizeSevpa. Operand 59 states. [2019-05-23 09:22:13,898 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-05-23 09:22:13,899 INFO L146 ILogger]: Start removeUnreachable. Operand 58 states. [2019-05-23 09:22:13,899 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-05-23 09:22:13,900 INFO L146 ILogger]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 53 [2019-05-23 09:22:13,900 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,900 INFO L146 ILogger]: Abstraction has 58 states and 58 transitions. [2019-05-23 09:22:13,900 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:22:13,900 INFO L146 ILogger]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-23 09:22:13,901 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:22:13,901 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,901 INFO L146 ILogger]: trace histogram [14, 14, 13, 13, 1, 1, 1] [2019-05-23 09:22:13,902 INFO L146 ILogger]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,902 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,902 INFO L146 ILogger]: Analyzing trace with hash -878045719, now seen corresponding path program 13 times [2019-05-23 09:22:13,903 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,926 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,928 INFO L146 ILogger]: Trace formula consists of 106 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,931 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,962 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:13,963 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,972 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:13,972 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,973 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:14,282 INFO L146 ILogger]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,282 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,283 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:14,283 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:14,283 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:14,284 INFO L146 ILogger]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:14,284 INFO L146 ILogger]: Start difference. First operand 58 states and 58 transitions. Second operand 17 states. [2019-05-23 09:22:14,613 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,613 INFO L146 ILogger]: Finished difference Result 63 states and 63 transitions. [2019-05-23 09:22:14,614 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:22:14,614 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 57 [2019-05-23 09:22:14,614 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,615 INFO L146 ILogger]: With dead ends: 63 [2019-05-23 09:22:14,615 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 09:22:14,616 INFO L146 ILogger]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:14,617 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 09:22:14,620 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-05-23 09:22:14,623 INFO L146 ILogger]: Start removeUnreachable. Operand 62 states. [2019-05-23 09:22:14,624 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-05-23 09:22:14,624 INFO L146 ILogger]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 57 [2019-05-23 09:22:14,624 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,624 INFO L146 ILogger]: Abstraction has 62 states and 62 transitions. [2019-05-23 09:22:14,624 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:14,625 INFO L146 ILogger]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-23 09:22:14,625 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 09:22:14,625 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,626 INFO L146 ILogger]: trace histogram [15, 15, 14, 14, 1, 1, 1] [2019-05-23 09:22:14,626 INFO L146 ILogger]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,626 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,626 INFO L146 ILogger]: Analyzing trace with hash 461341154, now seen corresponding path program 14 times [2019-05-23 09:22:14,627 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,651 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,654 INFO L146 ILogger]: Trace formula consists of 113 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,656 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,681 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:14,681 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,692 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:14,693 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,693 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:14,952 INFO L146 ILogger]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,952 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,952 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:22:14,953 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:22:14,953 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:22:14,954 INFO L146 ILogger]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:14,954 INFO L146 ILogger]: Start difference. First operand 62 states and 62 transitions. Second operand 18 states. [2019-05-23 09:22:15,371 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:15,372 INFO L146 ILogger]: Finished difference Result 67 states and 67 transitions. [2019-05-23 09:22:15,372 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:15,372 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 61 [2019-05-23 09:22:15,373 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:15,373 INFO L146 ILogger]: With dead ends: 67 [2019-05-23 09:22:15,374 INFO L146 ILogger]: Without dead ends: 67 [2019-05-23 09:22:15,375 INFO L146 ILogger]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:15,375 INFO L146 ILogger]: Start minimizeSevpa. Operand 67 states. [2019-05-23 09:22:15,379 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-05-23 09:22:15,379 INFO L146 ILogger]: Start removeUnreachable. Operand 66 states. [2019-05-23 09:22:15,380 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-05-23 09:22:15,380 INFO L146 ILogger]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 61 [2019-05-23 09:22:15,381 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:15,381 INFO L146 ILogger]: Abstraction has 66 states and 66 transitions. [2019-05-23 09:22:15,381 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:22:15,381 INFO L146 ILogger]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-23 09:22:15,382 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 66 [2019-05-23 09:22:15,382 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:15,382 INFO L146 ILogger]: trace histogram [16, 16, 15, 15, 1, 1, 1] [2019-05-23 09:22:15,382 INFO L146 ILogger]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:15,382 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:15,383 INFO L146 ILogger]: Analyzing trace with hash 1784432987, now seen corresponding path program 15 times [2019-05-23 09:22:15,383 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:15,409 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:15,412 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:22:15,415 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,454 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:15,455 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:15,526 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:15,527 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:15,527 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:15,963 INFO L146 ILogger]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,964 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,964 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:15,964 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:15,964 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:15,965 INFO L146 ILogger]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:15,965 INFO L146 ILogger]: Start difference. First operand 66 states and 66 transitions. Second operand 19 states. [2019-05-23 09:22:16,365 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,365 INFO L146 ILogger]: Finished difference Result 71 states and 71 transitions. [2019-05-23 09:22:16,365 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:22:16,366 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 65 [2019-05-23 09:22:16,366 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,366 INFO L146 ILogger]: With dead ends: 71 [2019-05-23 09:22:16,366 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 09:22:16,367 INFO L146 ILogger]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:16,367 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 09:22:16,371 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-05-23 09:22:16,371 INFO L146 ILogger]: Start removeUnreachable. Operand 70 states. [2019-05-23 09:22:16,372 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-05-23 09:22:16,372 INFO L146 ILogger]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 65 [2019-05-23 09:22:16,372 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,372 INFO L146 ILogger]: Abstraction has 70 states and 70 transitions. [2019-05-23 09:22:16,372 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:16,372 INFO L146 ILogger]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-23 09:22:16,373 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 70 [2019-05-23 09:22:16,373 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,373 INFO L146 ILogger]: trace histogram [17, 17, 16, 16, 1, 1, 1] [2019-05-23 09:22:16,373 INFO L146 ILogger]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,374 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,374 INFO L146 ILogger]: Analyzing trace with hash -433673132, now seen corresponding path program 16 times [2019-05-23 09:22:16,375 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,398 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,401 INFO L146 ILogger]: Trace formula consists of 127 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,404 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,417 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:16,418 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,425 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:16,425 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,425 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:16,746 INFO L146 ILogger]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,747 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,747 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:22:16,747 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:22:16,747 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:22:16,748 INFO L146 ILogger]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:16,748 INFO L146 ILogger]: Start difference. First operand 70 states and 70 transitions. Second operand 20 states. [2019-05-23 09:22:17,217 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,217 INFO L146 ILogger]: Finished difference Result 75 states and 75 transitions. [2019-05-23 09:22:17,217 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:22:17,217 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 69 [2019-05-23 09:22:17,217 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,218 INFO L146 ILogger]: With dead ends: 75 [2019-05-23 09:22:17,218 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:22:17,219 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:17,219 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:22:17,222 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-05-23 09:22:17,222 INFO L146 ILogger]: Start removeUnreachable. Operand 74 states. [2019-05-23 09:22:17,223 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-05-23 09:22:17,223 INFO L146 ILogger]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 69 [2019-05-23 09:22:17,223 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,223 INFO L146 ILogger]: Abstraction has 74 states and 74 transitions. [2019-05-23 09:22:17,223 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:22:17,224 INFO L146 ILogger]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-23 09:22:17,224 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 74 [2019-05-23 09:22:17,224 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,224 INFO L146 ILogger]: trace histogram [18, 18, 17, 17, 1, 1, 1] [2019-05-23 09:22:17,224 INFO L146 ILogger]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,225 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,225 INFO L146 ILogger]: Analyzing trace with hash -542840115, now seen corresponding path program 17 times [2019-05-23 09:22:17,225 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,250 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,252 INFO L146 ILogger]: Trace formula consists of 134 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,256 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,297 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:17,297 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,307 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:17,307 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,308 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:17,645 INFO L146 ILogger]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:17,645 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,646 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:17,646 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:17,646 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:17,647 INFO L146 ILogger]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:17,647 INFO L146 ILogger]: Start difference. First operand 74 states and 74 transitions. Second operand 21 states. [2019-05-23 09:22:18,065 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,066 INFO L146 ILogger]: Finished difference Result 79 states and 79 transitions. [2019-05-23 09:22:18,066 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:18,066 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 73 [2019-05-23 09:22:18,067 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,068 INFO L146 ILogger]: With dead ends: 79 [2019-05-23 09:22:18,068 INFO L146 ILogger]: Without dead ends: 79 [2019-05-23 09:22:18,069 INFO L146 ILogger]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:18,069 INFO L146 ILogger]: Start minimizeSevpa. Operand 79 states. [2019-05-23 09:22:18,073 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-05-23 09:22:18,073 INFO L146 ILogger]: Start removeUnreachable. Operand 78 states. [2019-05-23 09:22:18,074 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-05-23 09:22:18,074 INFO L146 ILogger]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 73 [2019-05-23 09:22:18,074 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,074 INFO L146 ILogger]: Abstraction has 78 states and 78 transitions. [2019-05-23 09:22:18,074 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:18,075 INFO L146 ILogger]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-23 09:22:18,075 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 09:22:18,075 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,075 INFO L146 ILogger]: trace histogram [19, 19, 18, 18, 1, 1, 1] [2019-05-23 09:22:18,076 INFO L146 ILogger]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,076 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,076 INFO L146 ILogger]: Analyzing trace with hash 1518159046, now seen corresponding path program 18 times [2019-05-23 09:22:18,077 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,105 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,109 INFO L146 ILogger]: Trace formula consists of 141 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,112 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,156 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:18,156 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:18,202 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:18,203 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:18,203 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:18,533 INFO L146 ILogger]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,533 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,533 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:22:18,534 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:22:18,534 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:22:18,534 INFO L146 ILogger]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:18,535 INFO L146 ILogger]: Start difference. First operand 78 states and 78 transitions. Second operand 22 states. [2019-05-23 09:22:19,229 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,229 INFO L146 ILogger]: Finished difference Result 83 states and 83 transitions. [2019-05-23 09:22:19,229 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:22:19,230 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 77 [2019-05-23 09:22:19,230 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,230 INFO L146 ILogger]: With dead ends: 83 [2019-05-23 09:22:19,231 INFO L146 ILogger]: Without dead ends: 83 [2019-05-23 09:22:19,232 INFO L146 ILogger]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:19,232 INFO L146 ILogger]: Start minimizeSevpa. Operand 83 states. [2019-05-23 09:22:19,236 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-05-23 09:22:19,236 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 09:22:19,237 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-05-23 09:22:19,237 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 77 [2019-05-23 09:22:19,237 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,237 INFO L146 ILogger]: Abstraction has 82 states and 82 transitions. [2019-05-23 09:22:19,237 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:22:19,237 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-23 09:22:19,238 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 82 [2019-05-23 09:22:19,238 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,238 INFO L146 ILogger]: trace histogram [20, 20, 19, 19, 1, 1, 1] [2019-05-23 09:22:19,239 INFO L146 ILogger]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,239 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,239 INFO L146 ILogger]: Analyzing trace with hash -1657406913, now seen corresponding path program 19 times [2019-05-23 09:22:19,240 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,264 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,267 INFO L146 ILogger]: Trace formula consists of 148 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,270 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,316 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:19,316 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,357 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:19,357 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,358 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:19,663 INFO L146 ILogger]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:19,664 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:19,664 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:19,664 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:19,665 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:19,665 INFO L146 ILogger]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:19,665 INFO L146 ILogger]: Start difference. First operand 82 states and 82 transitions. Second operand 23 states. [2019-05-23 09:22:20,454 WARN L146 ILogger]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:20,586 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:20,586 INFO L146 ILogger]: Finished difference Result 87 states and 87 transitions. [2019-05-23 09:22:20,586 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:22:20,587 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 81 [2019-05-23 09:22:20,587 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:20,588 INFO L146 ILogger]: With dead ends: 87 [2019-05-23 09:22:20,588 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 09:22:20,589 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:20,589 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 09:22:20,591 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-05-23 09:22:20,591 INFO L146 ILogger]: Start removeUnreachable. Operand 86 states. [2019-05-23 09:22:20,592 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-05-23 09:22:20,592 INFO L146 ILogger]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 81 [2019-05-23 09:22:20,592 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:20,592 INFO L146 ILogger]: Abstraction has 86 states and 86 transitions. [2019-05-23 09:22:20,592 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:20,593 INFO L146 ILogger]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-23 09:22:20,593 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:22:20,593 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:20,594 INFO L146 ILogger]: trace histogram [21, 21, 20, 20, 1, 1, 1] [2019-05-23 09:22:20,594 INFO L146 ILogger]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:20,594 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:20,594 INFO L146 ILogger]: Analyzing trace with hash -1053471944, now seen corresponding path program 20 times [2019-05-23 09:22:20,595 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:20,618 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:20,620 INFO L146 ILogger]: Trace formula consists of 155 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:20,622 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,653 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:20,654 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,660 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:20,660 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,661 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:21,345 INFO L146 ILogger]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:21,346 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:21,346 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:22:21,346 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:22:21,347 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:22:21,347 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:21,347 INFO L146 ILogger]: Start difference. First operand 86 states and 86 transitions. Second operand 24 states. [2019-05-23 09:22:21,872 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,872 INFO L146 ILogger]: Finished difference Result 91 states and 91 transitions. [2019-05-23 09:22:21,873 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:21,873 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 85 [2019-05-23 09:22:21,873 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,874 INFO L146 ILogger]: With dead ends: 91 [2019-05-23 09:22:21,874 INFO L146 ILogger]: Without dead ends: 91 [2019-05-23 09:22:21,875 INFO L146 ILogger]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:21,876 INFO L146 ILogger]: Start minimizeSevpa. Operand 91 states. [2019-05-23 09:22:21,877 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-05-23 09:22:21,878 INFO L146 ILogger]: Start removeUnreachable. Operand 90 states. [2019-05-23 09:22:21,878 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-05-23 09:22:21,878 INFO L146 ILogger]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 85 [2019-05-23 09:22:21,878 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,878 INFO L146 ILogger]: Abstraction has 90 states and 90 transitions. [2019-05-23 09:22:21,878 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:22:21,879 INFO L146 ILogger]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-23 09:22:21,879 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 90 [2019-05-23 09:22:21,879 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,879 INFO L146 ILogger]: trace histogram [22, 22, 21, 21, 1, 1, 1] [2019-05-23 09:22:21,879 INFO L146 ILogger]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,880 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,880 INFO L146 ILogger]: Analyzing trace with hash 1119975345, now seen corresponding path program 21 times [2019-05-23 09:22:21,880 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,912 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,916 INFO L146 ILogger]: Trace formula consists of 162 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,918 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:21,961 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:21,961 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:22,031 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:22,031 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:22,032 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:22,862 INFO L146 ILogger]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:22,863 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,863 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:22,863 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:22,863 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:22,863 INFO L146 ILogger]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:22,864 INFO L146 ILogger]: Start difference. First operand 90 states and 90 transitions. Second operand 25 states. [2019-05-23 09:22:23,429 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:23,430 INFO L146 ILogger]: Finished difference Result 95 states and 95 transitions. [2019-05-23 09:22:23,433 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:22:23,433 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 89 [2019-05-23 09:22:23,434 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:23,434 INFO L146 ILogger]: With dead ends: 95 [2019-05-23 09:22:23,435 INFO L146 ILogger]: Without dead ends: 95 [2019-05-23 09:22:23,435 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:23,436 INFO L146 ILogger]: Start minimizeSevpa. Operand 95 states. [2019-05-23 09:22:23,437 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-05-23 09:22:23,437 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:22:23,437 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-05-23 09:22:23,437 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 89 [2019-05-23 09:22:23,438 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:23,438 INFO L146 ILogger]: Abstraction has 94 states and 94 transitions. [2019-05-23 09:22:23,438 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:23,438 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-23 09:22:23,439 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 09:22:23,439 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:23,439 INFO L146 ILogger]: trace histogram [23, 23, 22, 22, 1, 1, 1] [2019-05-23 09:22:23,439 INFO L146 ILogger]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:23,439 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,440 INFO L146 ILogger]: Analyzing trace with hash -1862221910, now seen corresponding path program 22 times [2019-05-23 09:22:23,440 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,465 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:23,468 INFO L146 ILogger]: Trace formula consists of 169 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:22:23,470 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,509 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:23,509 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:23,584 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:23,584 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:23,584 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:23,961 INFO L146 ILogger]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:23,961 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,961 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:22:23,962 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:22:23,962 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:22:23,962 INFO L146 ILogger]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:23,962 INFO L146 ILogger]: Start difference. First operand 94 states and 94 transitions. Second operand 26 states. [2019-05-23 09:22:24,616 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:24,617 INFO L146 ILogger]: Finished difference Result 99 states and 99 transitions. [2019-05-23 09:22:24,617 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:22:24,617 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 93 [2019-05-23 09:22:24,618 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:24,618 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:22:24,618 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:22:24,620 INFO L146 ILogger]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:24,620 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:22:24,622 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-05-23 09:22:24,622 INFO L146 ILogger]: Start removeUnreachable. Operand 98 states. [2019-05-23 09:22:24,622 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-05-23 09:22:24,622 INFO L146 ILogger]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 93 [2019-05-23 09:22:24,622 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:24,623 INFO L146 ILogger]: Abstraction has 98 states and 98 transitions. [2019-05-23 09:22:24,623 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:22:24,623 INFO L146 ILogger]: Start isEmpty. Operand 98 states and 98 transitions. [2019-05-23 09:22:24,623 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:22:24,623 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:24,623 INFO L146 ILogger]: trace histogram [24, 24, 23, 23, 1, 1, 1] [2019-05-23 09:22:24,624 INFO L146 ILogger]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:24,624 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:24,624 INFO L146 ILogger]: Analyzing trace with hash -1644600541, now seen corresponding path program 23 times [2019-05-23 09:22:24,625 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:24,649 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,653 INFO L146 ILogger]: Trace formula consists of 176 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,655 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:24,693 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:24,694 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:24,708 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:24,709 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:24,709 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:25,203 INFO L146 ILogger]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:25,203 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,203 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:25,204 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:25,204 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:25,204 INFO L146 ILogger]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:25,204 INFO L146 ILogger]: Start difference. First operand 98 states and 98 transitions. Second operand 27 states. [2019-05-23 09:22:25,847 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,848 INFO L146 ILogger]: Finished difference Result 103 states and 103 transitions. [2019-05-23 09:22:25,848 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:25,848 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 97 [2019-05-23 09:22:25,848 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,849 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 09:22:25,849 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 09:22:25,850 INFO L146 ILogger]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:25,850 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 09:22:25,852 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-05-23 09:22:25,852 INFO L146 ILogger]: Start removeUnreachable. Operand 102 states. [2019-05-23 09:22:25,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-05-23 09:22:25,853 INFO L146 ILogger]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 97 [2019-05-23 09:22:25,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,853 INFO L146 ILogger]: Abstraction has 102 states and 102 transitions. [2019-05-23 09:22:25,853 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:25,853 INFO L146 ILogger]: Start isEmpty. Operand 102 states and 102 transitions. [2019-05-23 09:22:25,854 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 102 [2019-05-23 09:22:25,854 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,854 INFO L146 ILogger]: trace histogram [25, 25, 24, 24, 1, 1, 1] [2019-05-23 09:22:25,854 INFO L146 ILogger]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,855 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,855 INFO L146 ILogger]: Analyzing trace with hash 1855037980, now seen corresponding path program 24 times [2019-05-23 09:22:25,855 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,881 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,884 INFO L146 ILogger]: Trace formula consists of 183 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,887 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,925 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:25,926 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,937 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:25,938 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,938 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:26,655 INFO L146 ILogger]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:26,656 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:26,656 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:22:26,656 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:22:26,656 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:22:26,657 INFO L146 ILogger]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:26,657 INFO L146 ILogger]: Start difference. First operand 102 states and 102 transitions. Second operand 28 states. [2019-05-23 09:22:27,347 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:27,347 INFO L146 ILogger]: Finished difference Result 107 states and 107 transitions. [2019-05-23 09:22:27,348 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:22:27,348 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 101 [2019-05-23 09:22:27,348 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:27,349 INFO L146 ILogger]: With dead ends: 107 [2019-05-23 09:22:27,349 INFO L146 ILogger]: Without dead ends: 107 [2019-05-23 09:22:27,351 INFO L146 ILogger]: 0 DeclaredPredicates, 125 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:27,351 INFO L146 ILogger]: Start minimizeSevpa. Operand 107 states. [2019-05-23 09:22:27,353 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-05-23 09:22:27,353 INFO L146 ILogger]: Start removeUnreachable. Operand 106 states. [2019-05-23 09:22:27,353 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-05-23 09:22:27,353 INFO L146 ILogger]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 101 [2019-05-23 09:22:27,354 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:27,354 INFO L146 ILogger]: Abstraction has 106 states and 106 transitions. [2019-05-23 09:22:27,354 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:22:27,354 INFO L146 ILogger]: Start isEmpty. Operand 106 states and 106 transitions. [2019-05-23 09:22:27,355 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 106 [2019-05-23 09:22:27,355 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:27,355 INFO L146 ILogger]: trace histogram [26, 26, 25, 25, 1, 1, 1] [2019-05-23 09:22:27,355 INFO L146 ILogger]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:27,355 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:27,356 INFO L146 ILogger]: Analyzing trace with hash -1433420651, now seen corresponding path program 25 times [2019-05-23 09:22:27,356 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:27,383 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:27,387 INFO L146 ILogger]: Trace formula consists of 190 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:22:27,389 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:27,429 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:27,429 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:27,504 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:27,504 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:27,504 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:28,876 INFO L146 ILogger]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:28,877 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:28,877 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:28,877 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:28,878 INFO L146 ILogger]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:28,878 INFO L146 ILogger]: Start difference. First operand 106 states and 106 transitions. Second operand 29 states. [2019-05-23 09:22:29,637 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:29,637 INFO L146 ILogger]: Finished difference Result 111 states and 111 transitions. [2019-05-23 09:22:29,637 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:22:29,637 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 105 [2019-05-23 09:22:29,638 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:29,639 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:22:29,639 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:22:29,641 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:29,641 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:22:29,643 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-05-23 09:22:29,643 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 09:22:29,643 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-05-23 09:22:29,643 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 105 [2019-05-23 09:22:29,644 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:29,644 INFO L146 ILogger]: Abstraction has 110 states and 110 transitions. [2019-05-23 09:22:29,644 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:29,644 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 110 transitions. [2019-05-23 09:22:29,644 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 09:22:29,644 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:29,644 INFO L146 ILogger]: trace histogram [27, 27, 26, 26, 1, 1, 1] [2019-05-23 09:22:29,645 INFO L146 ILogger]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:29,645 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:29,645 INFO L146 ILogger]: Analyzing trace with hash 748286606, now seen corresponding path program 26 times [2019-05-23 09:22:29,645 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:29,674 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:29,678 INFO L146 ILogger]: Trace formula consists of 197 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:22:29,680 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,727 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:29,728 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:29,766 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:29,767 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:29,767 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:30,291 INFO L146 ILogger]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:30,291 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,291 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:22:30,291 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:22:30,292 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:22:30,292 INFO L146 ILogger]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:30,292 INFO L146 ILogger]: Start difference. First operand 110 states and 110 transitions. Second operand 30 states. [2019-05-23 09:22:31,067 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:31,068 INFO L146 ILogger]: Finished difference Result 115 states and 115 transitions. [2019-05-23 09:22:31,068 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:31,068 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 109 [2019-05-23 09:22:31,069 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:31,070 INFO L146 ILogger]: With dead ends: 115 [2019-05-23 09:22:31,070 INFO L146 ILogger]: Without dead ends: 115 [2019-05-23 09:22:31,072 INFO L146 ILogger]: 0 DeclaredPredicates, 135 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:31,072 INFO L146 ILogger]: Start minimizeSevpa. Operand 115 states. [2019-05-23 09:22:31,076 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-05-23 09:22:31,076 INFO L146 ILogger]: Start removeUnreachable. Operand 114 states. [2019-05-23 09:22:31,076 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-05-23 09:22:31,076 INFO L146 ILogger]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 109 [2019-05-23 09:22:31,077 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:31,077 INFO L146 ILogger]: Abstraction has 114 states and 114 transitions. [2019-05-23 09:22:31,077 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:22:31,077 INFO L146 ILogger]: Start isEmpty. Operand 114 states and 114 transitions. [2019-05-23 09:22:31,078 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 114 [2019-05-23 09:22:31,078 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:31,078 INFO L146 ILogger]: trace histogram [28, 28, 27, 27, 1, 1, 1] [2019-05-23 09:22:31,078 INFO L146 ILogger]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:31,079 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:31,079 INFO L146 ILogger]: Analyzing trace with hash -1841921017, now seen corresponding path program 27 times [2019-05-23 09:22:31,080 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:31,108 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:31,112 INFO L146 ILogger]: Trace formula consists of 204 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:22:31,115 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:31,156 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:31,156 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:31,231 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:31,231 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:31,231 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:31,975 INFO L146 ILogger]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:31,975 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:31,975 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:31,975 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:31,976 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:31,976 INFO L146 ILogger]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:31,976 INFO L146 ILogger]: Start difference. First operand 114 states and 114 transitions. Second operand 31 states. [2019-05-23 09:22:32,834 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,834 INFO L146 ILogger]: Finished difference Result 119 states and 119 transitions. [2019-05-23 09:22:32,834 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:22:32,835 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 113 [2019-05-23 09:22:32,835 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,836 INFO L146 ILogger]: With dead ends: 119 [2019-05-23 09:22:32,836 INFO L146 ILogger]: Without dead ends: 119 [2019-05-23 09:22:32,838 INFO L146 ILogger]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:32,838 INFO L146 ILogger]: Start minimizeSevpa. Operand 119 states. [2019-05-23 09:22:32,840 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-05-23 09:22:32,840 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 09:22:32,840 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-05-23 09:22:32,840 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 113 [2019-05-23 09:22:32,841 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,841 INFO L146 ILogger]: Abstraction has 118 states and 118 transitions. [2019-05-23 09:22:32,841 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:32,841 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 118 transitions. [2019-05-23 09:22:32,842 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 09:22:32,842 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,842 INFO L146 ILogger]: trace histogram [29, 29, 28, 28, 1, 1, 1] [2019-05-23 09:22:32,842 INFO L146 ILogger]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,842 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,843 INFO L146 ILogger]: Analyzing trace with hash -875843328, now seen corresponding path program 28 times [2019-05-23 09:22:32,843 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,873 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,877 INFO L146 ILogger]: Trace formula consists of 211 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,880 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:32,917 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:32,917 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:32,968 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:32,968 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:32,968 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:33,521 INFO L146 ILogger]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:33,521 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,521 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:22:33,521 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:22:33,522 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:22:33,522 INFO L146 ILogger]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:33,522 INFO L146 ILogger]: Start difference. First operand 118 states and 118 transitions. Second operand 32 states. [2019-05-23 09:22:34,397 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:34,398 INFO L146 ILogger]: Finished difference Result 123 states and 123 transitions. [2019-05-23 09:22:34,398 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:22:34,398 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 117 [2019-05-23 09:22:34,399 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:34,400 INFO L146 ILogger]: With dead ends: 123 [2019-05-23 09:22:34,400 INFO L146 ILogger]: Without dead ends: 123 [2019-05-23 09:22:34,402 INFO L146 ILogger]: 0 DeclaredPredicates, 145 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:34,402 INFO L146 ILogger]: Start minimizeSevpa. Operand 123 states. [2019-05-23 09:22:34,404 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-05-23 09:22:34,404 INFO L146 ILogger]: Start removeUnreachable. Operand 122 states. [2019-05-23 09:22:34,405 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-05-23 09:22:34,405 INFO L146 ILogger]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 117 [2019-05-23 09:22:34,405 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:34,405 INFO L146 ILogger]: Abstraction has 122 states and 122 transitions. [2019-05-23 09:22:34,405 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:22:34,405 INFO L146 ILogger]: Start isEmpty. Operand 122 states and 122 transitions. [2019-05-23 09:22:34,406 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 122 [2019-05-23 09:22:34,406 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:34,406 INFO L146 ILogger]: trace histogram [30, 30, 29, 29, 1, 1, 1] [2019-05-23 09:22:34,406 INFO L146 ILogger]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:34,407 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:34,407 INFO L146 ILogger]: Analyzing trace with hash -1398818439, now seen corresponding path program 29 times [2019-05-23 09:22:34,407 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:34,438 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:34,443 INFO L146 ILogger]: Trace formula consists of 218 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:22:34,445 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:34,484 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:34,484 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:34,562 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:34,563 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:34,563 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:35,283 INFO L146 ILogger]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:35,284 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:35,284 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:35,284 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:35,285 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:35,285 INFO L146 ILogger]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:35,285 INFO L146 ILogger]: Start difference. First operand 122 states and 122 transitions. Second operand 33 states. [2019-05-23 09:22:36,186 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:36,186 INFO L146 ILogger]: Finished difference Result 127 states and 127 transitions. [2019-05-23 09:22:36,189 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:36,190 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 121 [2019-05-23 09:22:36,190 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:36,191 INFO L146 ILogger]: With dead ends: 127 [2019-05-23 09:22:36,191 INFO L146 ILogger]: Without dead ends: 127 [2019-05-23 09:22:36,193 INFO L146 ILogger]: 0 DeclaredPredicates, 150 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:36,193 INFO L146 ILogger]: Start minimizeSevpa. Operand 127 states. [2019-05-23 09:22:36,195 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-05-23 09:22:36,195 INFO L146 ILogger]: Start removeUnreachable. Operand 126 states. [2019-05-23 09:22:36,195 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-05-23 09:22:36,195 INFO L146 ILogger]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 121 [2019-05-23 09:22:36,195 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:36,195 INFO L146 ILogger]: Abstraction has 126 states and 126 transitions. [2019-05-23 09:22:36,196 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:36,196 INFO L146 ILogger]: Start isEmpty. Operand 126 states and 126 transitions. [2019-05-23 09:22:36,196 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 126 [2019-05-23 09:22:36,196 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:36,196 INFO L146 ILogger]: trace histogram [31, 31, 30, 30, 1, 1, 1] [2019-05-23 09:22:36,197 INFO L146 ILogger]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:36,197 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:36,197 INFO L146 ILogger]: Analyzing trace with hash 2061032818, now seen corresponding path program 30 times [2019-05-23 09:22:36,198 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:36,237 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:36,241 INFO L146 ILogger]: Trace formula consists of 225 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:22:36,244 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,289 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:36,290 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,368 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:36,369 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,369 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:37,232 INFO L146 ILogger]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:37,232 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:37,233 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:22:37,233 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:22:37,233 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:22:37,234 INFO L146 ILogger]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:37,234 INFO L146 ILogger]: Start difference. First operand 126 states and 126 transitions. Second operand 34 states. [2019-05-23 09:22:38,182 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:38,182 INFO L146 ILogger]: Finished difference Result 131 states and 131 transitions. [2019-05-23 09:22:38,182 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:22:38,183 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 125 [2019-05-23 09:22:38,183 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:38,184 INFO L146 ILogger]: With dead ends: 131 [2019-05-23 09:22:38,184 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:22:38,186 INFO L146 ILogger]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:22:38,187 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:22:38,189 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-05-23 09:22:38,189 INFO L146 ILogger]: Start removeUnreachable. Operand 130 states. [2019-05-23 09:22:38,189 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-05-23 09:22:38,189 INFO L146 ILogger]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 125 [2019-05-23 09:22:38,190 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:38,190 INFO L146 ILogger]: Abstraction has 130 states and 130 transitions. [2019-05-23 09:22:38,190 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:22:38,190 INFO L146 ILogger]: Start isEmpty. Operand 130 states and 130 transitions. [2019-05-23 09:22:38,190 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 130 [2019-05-23 09:22:38,190 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:38,191 INFO L146 ILogger]: trace histogram [32, 32, 31, 31, 1, 1, 1] [2019-05-23 09:22:38,191 INFO L146 ILogger]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:38,191 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:38,191 INFO L146 ILogger]: Analyzing trace with hash 2138922219, now seen corresponding path program 31 times [2019-05-23 09:22:38,192 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:38,226 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:38,233 INFO L146 ILogger]: Trace formula consists of 232 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:22:38,236 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:38,276 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:38,276 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:38,352 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:38,352 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:38,353 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:39,474 INFO L146 ILogger]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:39,474 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:39,474 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:39,475 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:39,475 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:39,476 INFO L146 ILogger]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:39,476 INFO L146 ILogger]: Start difference. First operand 130 states and 130 transitions. Second operand 35 states. [2019-05-23 09:22:40,480 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:40,481 INFO L146 ILogger]: Finished difference Result 135 states and 135 transitions. [2019-05-23 09:22:40,481 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:22:40,481 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 129 [2019-05-23 09:22:40,482 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:40,483 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 09:22:40,483 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 09:22:40,484 INFO L146 ILogger]: 0 DeclaredPredicates, 160 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:40,485 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 09:22:40,487 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-05-23 09:22:40,487 INFO L146 ILogger]: Start removeUnreachable. Operand 134 states. [2019-05-23 09:22:40,487 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-05-23 09:22:40,488 INFO L146 ILogger]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 129 [2019-05-23 09:22:40,488 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:40,488 INFO L146 ILogger]: Abstraction has 134 states and 134 transitions. [2019-05-23 09:22:40,488 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:40,488 INFO L146 ILogger]: Start isEmpty. Operand 134 states and 134 transitions. [2019-05-23 09:22:40,489 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:22:40,489 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:40,489 INFO L146 ILogger]: trace histogram [33, 33, 32, 32, 1, 1, 1] [2019-05-23 09:22:40,489 INFO L146 ILogger]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:40,490 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:40,490 INFO L146 ILogger]: Analyzing trace with hash -1770817564, now seen corresponding path program 32 times [2019-05-23 09:22:40,490 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:40,523 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:40,529 INFO L146 ILogger]: Trace formula consists of 239 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:22:40,532 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:40,573 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:40,574 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:40,645 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:40,645 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:40,645 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:41,428 INFO L146 ILogger]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:41,428 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:41,428 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:22:41,429 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:22:41,429 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:22:41,430 INFO L146 ILogger]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:41,430 INFO L146 ILogger]: Start difference. First operand 134 states and 134 transitions. Second operand 36 states. [2019-05-23 09:22:42,761 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:42,762 INFO L146 ILogger]: Finished difference Result 139 states and 139 transitions. [2019-05-23 09:22:42,762 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:42,762 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 133 [2019-05-23 09:22:42,763 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:42,764 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 09:22:42,764 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:22:42,766 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:22:42,766 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:22:42,768 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-05-23 09:22:42,768 INFO L146 ILogger]: Start removeUnreachable. Operand 138 states. [2019-05-23 09:22:42,769 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-05-23 09:22:42,769 INFO L146 ILogger]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 133 [2019-05-23 09:22:42,769 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:42,769 INFO L146 ILogger]: Abstraction has 138 states and 138 transitions. [2019-05-23 09:22:42,770 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:22:42,770 INFO L146 ILogger]: Start isEmpty. Operand 138 states and 138 transitions. [2019-05-23 09:22:42,770 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 138 [2019-05-23 09:22:42,770 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:42,771 INFO L146 ILogger]: trace histogram [34, 34, 33, 33, 1, 1, 1] [2019-05-23 09:22:42,771 INFO L146 ILogger]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:42,771 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:42,771 INFO L146 ILogger]: Analyzing trace with hash -1098813859, now seen corresponding path program 33 times [2019-05-23 09:22:42,772 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:42,803 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:42,810 INFO L146 ILogger]: Trace formula consists of 246 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:22:42,813 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,851 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:42,851 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:42,921 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:42,922 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:42,922 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:44,368 INFO L146 ILogger]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:44,369 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:44,369 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:44,369 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:44,369 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:44,370 INFO L146 ILogger]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:44,370 INFO L146 ILogger]: Start difference. First operand 138 states and 138 transitions. Second operand 37 states. [2019-05-23 09:22:45,420 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:45,420 INFO L146 ILogger]: Finished difference Result 143 states and 143 transitions. [2019-05-23 09:22:45,420 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:22:45,421 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 137 [2019-05-23 09:22:45,421 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:45,422 INFO L146 ILogger]: With dead ends: 143 [2019-05-23 09:22:45,422 INFO L146 ILogger]: Without dead ends: 143 [2019-05-23 09:22:45,423 INFO L146 ILogger]: 0 DeclaredPredicates, 170 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:22:45,424 INFO L146 ILogger]: Start minimizeSevpa. Operand 143 states. [2019-05-23 09:22:45,426 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-05-23 09:22:45,426 INFO L146 ILogger]: Start removeUnreachable. Operand 142 states. [2019-05-23 09:22:45,426 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-05-23 09:22:45,426 INFO L146 ILogger]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 137 [2019-05-23 09:22:45,427 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:45,427 INFO L146 ILogger]: Abstraction has 142 states and 142 transitions. [2019-05-23 09:22:45,427 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:45,427 INFO L146 ILogger]: Start isEmpty. Operand 142 states and 142 transitions. [2019-05-23 09:22:45,428 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 09:22:45,428 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:45,428 INFO L146 ILogger]: trace histogram [35, 35, 34, 34, 1, 1, 1] [2019-05-23 09:22:45,428 INFO L146 ILogger]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:45,428 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:45,429 INFO L146 ILogger]: Analyzing trace with hash -1454538666, now seen corresponding path program 34 times [2019-05-23 09:22:45,429 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:45,463 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:45,468 INFO L146 ILogger]: Trace formula consists of 253 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:22:45,471 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:45,509 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:45,509 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:45,560 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:45,560 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:45,560 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:46,266 INFO L146 ILogger]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:46,266 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:46,266 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:22:46,267 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:22:46,267 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:22:46,267 INFO L146 ILogger]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:46,267 INFO L146 ILogger]: Start difference. First operand 142 states and 142 transitions. Second operand 38 states. [2019-05-23 09:22:47,580 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:47,580 INFO L146 ILogger]: Finished difference Result 147 states and 147 transitions. [2019-05-23 09:22:47,581 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:22:47,581 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 141 [2019-05-23 09:22:47,582 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:47,582 INFO L146 ILogger]: With dead ends: 147 [2019-05-23 09:22:47,583 INFO L146 ILogger]: Without dead ends: 147 [2019-05-23 09:22:47,584 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:22:47,584 INFO L146 ILogger]: Start minimizeSevpa. Operand 147 states. [2019-05-23 09:22:47,587 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-05-23 09:22:47,587 INFO L146 ILogger]: Start removeUnreachable. Operand 146 states. [2019-05-23 09:22:47,588 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-05-23 09:22:47,588 INFO L146 ILogger]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 141 [2019-05-23 09:22:47,588 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:47,588 INFO L146 ILogger]: Abstraction has 146 states and 146 transitions. [2019-05-23 09:22:47,588 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:22:47,588 INFO L146 ILogger]: Start isEmpty. Operand 146 states and 146 transitions. [2019-05-23 09:22:47,589 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 146 [2019-05-23 09:22:47,589 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:47,589 INFO L146 ILogger]: trace histogram [36, 36, 35, 35, 1, 1, 1] [2019-05-23 09:22:47,590 INFO L146 ILogger]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:47,590 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:47,590 INFO L146 ILogger]: Analyzing trace with hash 1264446927, now seen corresponding path program 35 times [2019-05-23 09:22:47,590 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:47,624 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:47,630 INFO L146 ILogger]: Trace formula consists of 260 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 09:22:47,633 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:47,674 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:47,675 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:47,760 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:47,761 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:47,761 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:48,806 INFO L146 ILogger]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:48,806 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:48,806 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:48,806 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:48,807 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:48,807 INFO L146 ILogger]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:48,807 INFO L146 ILogger]: Start difference. First operand 146 states and 146 transitions. Second operand 39 states. [2019-05-23 09:22:49,173 WARN L146 ILogger]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:49,487 WARN L146 ILogger]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:51,310 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:51,310 INFO L146 ILogger]: Finished difference Result 151 states and 151 transitions. [2019-05-23 09:22:51,310 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:51,310 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 145 [2019-05-23 09:22:51,311 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:51,312 INFO L146 ILogger]: With dead ends: 151 [2019-05-23 09:22:51,312 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 09:22:51,314 INFO L146 ILogger]: 0 DeclaredPredicates, 180 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:22:51,314 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 09:22:51,316 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-05-23 09:22:51,316 INFO L146 ILogger]: Start removeUnreachable. Operand 150 states. [2019-05-23 09:22:51,317 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-05-23 09:22:51,317 INFO L146 ILogger]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 145 [2019-05-23 09:22:51,317 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:51,317 INFO L146 ILogger]: Abstraction has 150 states and 150 transitions. [2019-05-23 09:22:51,318 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:51,318 INFO L146 ILogger]: Start isEmpty. Operand 150 states and 150 transitions. [2019-05-23 09:22:51,318 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 150 [2019-05-23 09:22:51,318 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:51,319 INFO L146 ILogger]: trace histogram [37, 37, 36, 36, 1, 1, 1] [2019-05-23 09:22:51,319 INFO L146 ILogger]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:51,319 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:51,319 INFO L146 ILogger]: Analyzing trace with hash 1813575368, now seen corresponding path program 36 times [2019-05-23 09:22:51,320 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:51,369 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:51,375 INFO L146 ILogger]: Trace formula consists of 267 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:22:51,378 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:51,419 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:51,419 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:51,441 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:51,442 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:51,442 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:52,288 INFO L146 ILogger]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:52,289 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:52,289 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:22:52,289 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:22:52,290 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:22:52,290 INFO L146 ILogger]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:52,290 INFO L146 ILogger]: Start difference. First operand 150 states and 150 transitions. Second operand 40 states. [2019-05-23 09:22:53,479 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:53,479 INFO L146 ILogger]: Finished difference Result 155 states and 155 transitions. [2019-05-23 09:22:53,480 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:22:53,480 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 149 [2019-05-23 09:22:53,480 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:53,481 INFO L146 ILogger]: With dead ends: 155 [2019-05-23 09:22:53,482 INFO L146 ILogger]: Without dead ends: 155 [2019-05-23 09:22:53,483 INFO L146 ILogger]: 0 DeclaredPredicates, 185 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:22:53,483 INFO L146 ILogger]: Start minimizeSevpa. Operand 155 states. [2019-05-23 09:22:53,486 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-05-23 09:22:53,486 INFO L146 ILogger]: Start removeUnreachable. Operand 154 states. [2019-05-23 09:22:53,486 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-05-23 09:22:53,486 INFO L146 ILogger]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 149 [2019-05-23 09:22:53,486 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:53,486 INFO L146 ILogger]: Abstraction has 154 states and 154 transitions. [2019-05-23 09:22:53,487 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:22:53,487 INFO L146 ILogger]: Start isEmpty. Operand 154 states and 154 transitions. [2019-05-23 09:22:53,487 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 154 [2019-05-23 09:22:53,488 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:53,488 INFO L146 ILogger]: trace histogram [38, 38, 37, 37, 1, 1, 1] [2019-05-23 09:22:53,488 INFO L146 ILogger]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:53,488 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:53,488 INFO L146 ILogger]: Analyzing trace with hash 902093633, now seen corresponding path program 37 times [2019-05-23 09:22:53,489 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:53,524 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:53,531 INFO L146 ILogger]: Trace formula consists of 274 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 09:22:53,534 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:53,562 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:53,563 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:53,574 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:53,574 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:53,574 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:54,413 INFO L146 ILogger]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:54,413 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,413 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:54,413 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:54,414 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:54,414 INFO L146 ILogger]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:54,414 INFO L146 ILogger]: Start difference. First operand 154 states and 154 transitions. Second operand 41 states. [2019-05-23 09:22:55,678 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:55,678 INFO L146 ILogger]: Finished difference Result 159 states and 159 transitions. [2019-05-23 09:22:55,679 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:22:55,679 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 153 [2019-05-23 09:22:55,680 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:55,680 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 09:22:55,681 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:22:55,682 INFO L146 ILogger]: 0 DeclaredPredicates, 190 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:22:55,682 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:22:55,684 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-05-23 09:22:55,684 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:22:55,685 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-05-23 09:22:55,685 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 153 [2019-05-23 09:22:55,685 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:55,685 INFO L146 ILogger]: Abstraction has 158 states and 158 transitions. [2019-05-23 09:22:55,685 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:55,686 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 158 transitions. [2019-05-23 09:22:55,686 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:22:55,686 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:55,687 INFO L146 ILogger]: trace histogram [39, 39, 38, 38, 1, 1, 1] [2019-05-23 09:22:55,687 INFO L146 ILogger]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:55,687 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:55,687 INFO L146 ILogger]: Analyzing trace with hash -980952262, now seen corresponding path program 38 times [2019-05-23 09:22:55,688 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:55,724 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:55,731 INFO L146 ILogger]: Trace formula consists of 281 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:22:55,734 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:55,775 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:55,775 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:55,855 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:55,856 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:55,856 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:56,998 INFO L146 ILogger]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:56,998 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:56,998 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:22:56,998 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:22:56,999 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:22:56,999 INFO L146 ILogger]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:56,999 INFO L146 ILogger]: Start difference. First operand 158 states and 158 transitions. Second operand 42 states. [2019-05-23 09:22:58,414 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:58,414 INFO L146 ILogger]: Finished difference Result 163 states and 163 transitions. [2019-05-23 09:22:58,414 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:58,415 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 157 [2019-05-23 09:22:58,415 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:58,416 INFO L146 ILogger]: With dead ends: 163 [2019-05-23 09:22:58,416 INFO L146 ILogger]: Without dead ends: 163 [2019-05-23 09:22:58,418 INFO L146 ILogger]: 0 DeclaredPredicates, 195 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:22:58,418 INFO L146 ILogger]: Start minimizeSevpa. Operand 163 states. [2019-05-23 09:22:58,420 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-05-23 09:22:58,420 INFO L146 ILogger]: Start removeUnreachable. Operand 162 states. [2019-05-23 09:22:58,421 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-05-23 09:22:58,421 INFO L146 ILogger]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 157 [2019-05-23 09:22:58,421 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:58,422 INFO L146 ILogger]: Abstraction has 162 states and 162 transitions. [2019-05-23 09:22:58,422 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:22:58,422 INFO L146 ILogger]: Start isEmpty. Operand 162 states and 162 transitions. [2019-05-23 09:22:58,422 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 162 [2019-05-23 09:22:58,423 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:58,423 INFO L146 ILogger]: trace histogram [40, 40, 39, 39, 1, 1, 1] [2019-05-23 09:22:58,423 INFO L146 ILogger]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:58,423 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:58,423 INFO L146 ILogger]: Analyzing trace with hash -1150798157, now seen corresponding path program 39 times [2019-05-23 09:22:58,424 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:58,461 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:58,469 INFO L146 ILogger]: Trace formula consists of 288 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 09:22:58,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:58,501 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:22:58,501 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:58,507 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:58,507 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:58,508 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:22:59,457 INFO L146 ILogger]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:59,457 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:59,457 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:59,457 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:59,458 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:59,458 INFO L146 ILogger]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:59,458 INFO L146 ILogger]: Start difference. First operand 162 states and 162 transitions. Second operand 43 states. [2019-05-23 09:23:01,571 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:01,571 INFO L146 ILogger]: Finished difference Result 167 states and 167 transitions. [2019-05-23 09:23:01,571 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:23:01,571 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 161 [2019-05-23 09:23:01,572 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:01,573 INFO L146 ILogger]: With dead ends: 167 [2019-05-23 09:23:01,573 INFO L146 ILogger]: Without dead ends: 167 [2019-05-23 09:23:01,575 INFO L146 ILogger]: 0 DeclaredPredicates, 200 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:01,575 INFO L146 ILogger]: Start minimizeSevpa. Operand 167 states. [2019-05-23 09:23:01,577 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-05-23 09:23:01,577 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 09:23:01,578 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-05-23 09:23:01,578 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 161 [2019-05-23 09:23:01,578 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:01,578 INFO L146 ILogger]: Abstraction has 166 states and 166 transitions. [2019-05-23 09:23:01,579 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:23:01,579 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 166 transitions. [2019-05-23 09:23:01,579 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 166 [2019-05-23 09:23:01,579 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:01,580 INFO L146 ILogger]: trace histogram [41, 41, 40, 40, 1, 1, 1] [2019-05-23 09:23:01,580 INFO L146 ILogger]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:01,580 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:01,580 INFO L146 ILogger]: Analyzing trace with hash -900977236, now seen corresponding path program 40 times [2019-05-23 09:23:01,581 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:01,618 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:01,626 INFO L146 ILogger]: Trace formula consists of 295 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:23:01,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:01,673 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:01,674 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:01,736 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:01,736 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:01,736 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:02,990 INFO L146 ILogger]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:02,990 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:02,991 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:23:02,991 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:23:02,991 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:23:02,991 INFO L146 ILogger]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:23:02,991 INFO L146 ILogger]: Start difference. First operand 166 states and 166 transitions. Second operand 44 states. [2019-05-23 09:23:04,407 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:04,407 INFO L146 ILogger]: Finished difference Result 171 states and 171 transitions. [2019-05-23 09:23:04,408 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:23:04,408 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 165 [2019-05-23 09:23:04,408 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:04,409 INFO L146 ILogger]: With dead ends: 171 [2019-05-23 09:23:04,409 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:23:04,410 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:04,410 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:23:04,413 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-05-23 09:23:04,413 INFO L146 ILogger]: Start removeUnreachable. Operand 170 states. [2019-05-23 09:23:04,414 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-05-23 09:23:04,414 INFO L146 ILogger]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 165 [2019-05-23 09:23:04,414 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:04,414 INFO L146 ILogger]: Abstraction has 170 states and 170 transitions. [2019-05-23 09:23:04,414 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:23:04,414 INFO L146 ILogger]: Start isEmpty. Operand 170 states and 170 transitions. [2019-05-23 09:23:04,415 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:23:04,415 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:04,415 INFO L146 ILogger]: trace histogram [42, 42, 41, 41, 1, 1, 1] [2019-05-23 09:23:04,416 INFO L146 ILogger]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:04,416 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:04,416 INFO L146 ILogger]: Analyzing trace with hash 1207566373, now seen corresponding path program 41 times [2019-05-23 09:23:04,417 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:04,454 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:04,463 INFO L146 ILogger]: Trace formula consists of 302 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 09:23:04,466 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:04,506 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:04,507 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:04,525 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:04,526 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:04,526 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:05,523 INFO L146 ILogger]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:05,524 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:05,524 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:23:05,524 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:23:05,524 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:23:05,525 INFO L146 ILogger]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:23:05,525 INFO L146 ILogger]: Start difference. First operand 170 states and 170 transitions. Second operand 45 states. [2019-05-23 09:23:07,162 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:07,162 INFO L146 ILogger]: Finished difference Result 175 states and 175 transitions. [2019-05-23 09:23:07,162 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:23:07,162 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 169 [2019-05-23 09:23:07,163 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:07,163 INFO L146 ILogger]: With dead ends: 175 [2019-05-23 09:23:07,163 INFO L146 ILogger]: Without dead ends: 175 [2019-05-23 09:23:07,164 INFO L146 ILogger]: 0 DeclaredPredicates, 210 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:23:07,164 INFO L146 ILogger]: Start minimizeSevpa. Operand 175 states. [2019-05-23 09:23:07,169 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-05-23 09:23:07,169 INFO L146 ILogger]: Start removeUnreachable. Operand 174 states. [2019-05-23 09:23:07,169 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-05-23 09:23:07,170 INFO L146 ILogger]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 169 [2019-05-23 09:23:07,170 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:07,170 INFO L146 ILogger]: Abstraction has 174 states and 174 transitions. [2019-05-23 09:23:07,170 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:23:07,170 INFO L146 ILogger]: Start isEmpty. Operand 174 states and 174 transitions. [2019-05-23 09:23:07,171 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 174 [2019-05-23 09:23:07,171 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:07,171 INFO L146 ILogger]: trace histogram [43, 43, 42, 42, 1, 1, 1] [2019-05-23 09:23:07,171 INFO L146 ILogger]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:07,171 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:07,172 INFO L146 ILogger]: Analyzing trace with hash -1122505186, now seen corresponding path program 42 times [2019-05-23 09:23:07,173 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:07,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:07,229 INFO L146 ILogger]: Trace formula consists of 309 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:23:07,232 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:07,276 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:07,276 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:07,278 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:07,279 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:07,279 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:08,280 INFO L146 ILogger]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:08,280 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:08,280 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:23:08,280 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:23:08,281 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:23:08,281 INFO L146 ILogger]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:23:08,281 INFO L146 ILogger]: Start difference. First operand 174 states and 174 transitions. Second operand 46 states. [2019-05-23 09:23:09,939 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:09,940 INFO L146 ILogger]: Finished difference Result 179 states and 179 transitions. [2019-05-23 09:23:09,940 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:23:09,940 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 173 [2019-05-23 09:23:09,940 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:09,941 INFO L146 ILogger]: With dead ends: 179 [2019-05-23 09:23:09,942 INFO L146 ILogger]: Without dead ends: 179 [2019-05-23 09:23:09,943 INFO L146 ILogger]: 0 DeclaredPredicates, 215 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:23:09,943 INFO L146 ILogger]: Start minimizeSevpa. Operand 179 states. [2019-05-23 09:23:09,945 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-05-23 09:23:09,946 INFO L146 ILogger]: Start removeUnreachable. Operand 178 states. [2019-05-23 09:23:09,946 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-05-23 09:23:09,946 INFO L146 ILogger]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 173 [2019-05-23 09:23:09,946 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:09,947 INFO L146 ILogger]: Abstraction has 178 states and 178 transitions. [2019-05-23 09:23:09,947 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:23:09,947 INFO L146 ILogger]: Start isEmpty. Operand 178 states and 178 transitions. [2019-05-23 09:23:09,947 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 178 [2019-05-23 09:23:09,948 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:09,948 INFO L146 ILogger]: trace histogram [44, 44, 43, 43, 1, 1, 1] [2019-05-23 09:23:09,948 INFO L146 ILogger]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:09,948 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:09,948 INFO L146 ILogger]: Analyzing trace with hash 1965832087, now seen corresponding path program 43 times [2019-05-23 09:23:09,949 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:09,993 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:10,002 INFO L146 ILogger]: Trace formula consists of 316 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 09:23:10,005 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:10,043 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:10,043 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:10,103 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:10,104 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:10,104 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:11,224 INFO L146 ILogger]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:11,224 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:11,224 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:23:11,225 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:23:11,225 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:23:11,225 INFO L146 ILogger]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:23:11,225 INFO L146 ILogger]: Start difference. First operand 178 states and 178 transitions. Second operand 47 states. [2019-05-23 09:23:13,084 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:13,084 INFO L146 ILogger]: Finished difference Result 183 states and 183 transitions. [2019-05-23 09:23:13,085 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:23:13,085 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 177 [2019-05-23 09:23:13,085 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:13,086 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 09:23:13,086 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 09:23:13,087 INFO L146 ILogger]: 0 DeclaredPredicates, 220 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:23:13,088 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 09:23:13,090 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-05-23 09:23:13,090 INFO L146 ILogger]: Start removeUnreachable. Operand 182 states. [2019-05-23 09:23:13,091 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-05-23 09:23:13,091 INFO L146 ILogger]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 177 [2019-05-23 09:23:13,091 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:13,091 INFO L146 ILogger]: Abstraction has 182 states and 182 transitions. [2019-05-23 09:23:13,091 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:23:13,091 INFO L146 ILogger]: Start isEmpty. Operand 182 states and 182 transitions. [2019-05-23 09:23:13,092 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 09:23:13,092 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:13,092 INFO L146 ILogger]: trace histogram [45, 45, 44, 44, 1, 1, 1] [2019-05-23 09:23:13,093 INFO L146 ILogger]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:13,093 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:13,093 INFO L146 ILogger]: Analyzing trace with hash 245177488, now seen corresponding path program 44 times [2019-05-23 09:23:13,094 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:13,139 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:13,149 INFO L146 ILogger]: Trace formula consists of 323 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:23:13,152 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:13,191 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:13,191 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:13,259 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:13,260 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:13,260 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:14,513 INFO L146 ILogger]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:14,514 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:14,514 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:23:14,514 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:23:14,515 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:23:14,515 INFO L146 ILogger]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:23:14,515 INFO L146 ILogger]: Start difference. First operand 182 states and 182 transitions. Second operand 48 states. [2019-05-23 09:23:16,204 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:16,205 INFO L146 ILogger]: Finished difference Result 187 states and 187 transitions. [2019-05-23 09:23:16,205 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:23:16,205 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 181 [2019-05-23 09:23:16,206 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:16,207 INFO L146 ILogger]: With dead ends: 187 [2019-05-23 09:23:16,207 INFO L146 ILogger]: Without dead ends: 187 [2019-05-23 09:23:16,207 INFO L146 ILogger]: 0 DeclaredPredicates, 225 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:23:16,208 INFO L146 ILogger]: Start minimizeSevpa. Operand 187 states. [2019-05-23 09:23:16,209 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-05-23 09:23:16,209 INFO L146 ILogger]: Start removeUnreachable. Operand 186 states. [2019-05-23 09:23:16,210 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-05-23 09:23:16,210 INFO L146 ILogger]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 181 [2019-05-23 09:23:16,210 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:16,210 INFO L146 ILogger]: Abstraction has 186 states and 186 transitions. [2019-05-23 09:23:16,210 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:23:16,210 INFO L146 ILogger]: Start isEmpty. Operand 186 states and 186 transitions. [2019-05-23 09:23:16,211 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 186 [2019-05-23 09:23:16,211 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:16,211 INFO L146 ILogger]: trace histogram [46, 46, 45, 45, 1, 1, 1] [2019-05-23 09:23:16,211 INFO L146 ILogger]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:16,212 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:16,212 INFO L146 ILogger]: Analyzing trace with hash 179363081, now seen corresponding path program 45 times [2019-05-23 09:23:16,212 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:16,254 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:16,264 INFO L146 ILogger]: Trace formula consists of 330 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 09:23:16,268 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,308 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:16,309 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,347 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:16,347 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,347 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:17,884 INFO L146 ILogger]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:17,884 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:17,884 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:23:17,885 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:23:17,885 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:23:17,886 INFO L146 ILogger]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:23:17,886 INFO L146 ILogger]: Start difference. First operand 186 states and 186 transitions. Second operand 49 states. [2019-05-23 09:23:19,833 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:19,833 INFO L146 ILogger]: Finished difference Result 191 states and 191 transitions. [2019-05-23 09:23:19,833 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:23:19,833 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 185 [2019-05-23 09:23:19,834 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:19,835 INFO L146 ILogger]: With dead ends: 191 [2019-05-23 09:23:19,835 INFO L146 ILogger]: Without dead ends: 191 [2019-05-23 09:23:19,836 INFO L146 ILogger]: 0 DeclaredPredicates, 230 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:23:19,836 INFO L146 ILogger]: Start minimizeSevpa. Operand 191 states. [2019-05-23 09:23:19,838 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-05-23 09:23:19,838 INFO L146 ILogger]: Start removeUnreachable. Operand 190 states. [2019-05-23 09:23:19,839 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-05-23 09:23:19,839 INFO L146 ILogger]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 185 [2019-05-23 09:23:19,839 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:19,839 INFO L146 ILogger]: Abstraction has 190 states and 190 transitions. [2019-05-23 09:23:19,839 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:23:19,840 INFO L146 ILogger]: Start isEmpty. Operand 190 states and 190 transitions. [2019-05-23 09:23:19,840 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 190 [2019-05-23 09:23:19,840 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:19,840 INFO L146 ILogger]: trace histogram [47, 47, 46, 46, 1, 1, 1] [2019-05-23 09:23:19,841 INFO L146 ILogger]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:19,841 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:19,841 INFO L146 ILogger]: Analyzing trace with hash 1569569026, now seen corresponding path program 46 times [2019-05-23 09:23:19,841 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:19,886 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:19,896 INFO L146 ILogger]: Trace formula consists of 337 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:23:19,899 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:19,935 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:19,935 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:19,964 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:19,964 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:19,964 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:23,692 INFO L146 ILogger]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:23,692 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:23,692 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:23:23,692 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:23:23,693 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:23:23,693 INFO L146 ILogger]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:23:23,693 INFO L146 ILogger]: Start difference. First operand 190 states and 190 transitions. Second operand 50 states. [2019-05-23 09:23:25,502 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:25,502 INFO L146 ILogger]: Finished difference Result 195 states and 195 transitions. [2019-05-23 09:23:25,502 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:23:25,503 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 189 [2019-05-23 09:23:25,503 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:25,504 INFO L146 ILogger]: With dead ends: 195 [2019-05-23 09:23:25,504 INFO L146 ILogger]: Without dead ends: 195 [2019-05-23 09:23:25,506 INFO L146 ILogger]: 0 DeclaredPredicates, 235 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:23:25,506 INFO L146 ILogger]: Start minimizeSevpa. Operand 195 states. [2019-05-23 09:23:25,508 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-05-23 09:23:25,508 INFO L146 ILogger]: Start removeUnreachable. Operand 194 states. [2019-05-23 09:23:25,509 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-05-23 09:23:25,509 INFO L146 ILogger]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 189 [2019-05-23 09:23:25,509 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:25,509 INFO L146 ILogger]: Abstraction has 194 states and 194 transitions. [2019-05-23 09:23:25,509 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:23:25,509 INFO L146 ILogger]: Start isEmpty. Operand 194 states and 194 transitions. [2019-05-23 09:23:25,510 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 194 [2019-05-23 09:23:25,510 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:25,511 INFO L146 ILogger]: trace histogram [48, 48, 47, 47, 1, 1, 1] [2019-05-23 09:23:25,511 INFO L146 ILogger]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:25,511 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:25,511 INFO L146 ILogger]: Analyzing trace with hash -29757317, now seen corresponding path program 47 times [2019-05-23 09:23:25,512 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:25,563 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:25,577 INFO L146 ILogger]: Trace formula consists of 344 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 09:23:25,581 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:25,619 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:25,619 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:25,708 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:25,709 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:25,709 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:27,414 INFO L146 ILogger]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:27,414 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:27,414 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:23:27,414 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:23:27,415 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:23:27,415 INFO L146 ILogger]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:23:27,415 INFO L146 ILogger]: Start difference. First operand 194 states and 194 transitions. Second operand 51 states. [2019-05-23 09:23:27,655 WARN L146 ILogger]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:23:29,627 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:29,627 INFO L146 ILogger]: Finished difference Result 199 states and 199 transitions. [2019-05-23 09:23:29,628 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:23:29,628 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 193 [2019-05-23 09:23:29,628 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:29,629 INFO L146 ILogger]: With dead ends: 199 [2019-05-23 09:23:29,629 INFO L146 ILogger]: Without dead ends: 199 [2019-05-23 09:23:29,630 INFO L146 ILogger]: 0 DeclaredPredicates, 240 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:23:29,631 INFO L146 ILogger]: Start minimizeSevpa. Operand 199 states. [2019-05-23 09:23:29,633 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-05-23 09:23:29,633 INFO L146 ILogger]: Start removeUnreachable. Operand 198 states. [2019-05-23 09:23:29,634 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-05-23 09:23:29,634 INFO L146 ILogger]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 193 [2019-05-23 09:23:29,634 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:29,634 INFO L146 ILogger]: Abstraction has 198 states and 198 transitions. [2019-05-23 09:23:29,634 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:23:29,634 INFO L146 ILogger]: Start isEmpty. Operand 198 states and 198 transitions. [2019-05-23 09:23:29,635 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 198 [2019-05-23 09:23:29,635 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:29,636 INFO L146 ILogger]: trace histogram [49, 49, 48, 48, 1, 1, 1] [2019-05-23 09:23:29,636 INFO L146 ILogger]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:29,636 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:29,636 INFO L146 ILogger]: Analyzing trace with hash 1989919604, now seen corresponding path program 48 times [2019-05-23 09:23:29,637 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:29,685 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:29,697 INFO L146 ILogger]: Trace formula consists of 351 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:23:29,701 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:29,739 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:29,740 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:29,746 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:29,746 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:29,747 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:31,035 INFO L146 ILogger]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:31,035 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:31,035 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:23:31,036 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:23:31,036 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:23:31,036 INFO L146 ILogger]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:23:31,037 INFO L146 ILogger]: Start difference. First operand 198 states and 198 transitions. Second operand 52 states. [2019-05-23 09:23:33,246 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:33,247 INFO L146 ILogger]: Finished difference Result 203 states and 203 transitions. [2019-05-23 09:23:33,247 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:23:33,247 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 197 [2019-05-23 09:23:33,248 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:33,249 INFO L146 ILogger]: With dead ends: 203 [2019-05-23 09:23:33,249 INFO L146 ILogger]: Without dead ends: 203 [2019-05-23 09:23:33,250 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:23:33,250 INFO L146 ILogger]: Start minimizeSevpa. Operand 203 states. [2019-05-23 09:23:33,253 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-05-23 09:23:33,253 INFO L146 ILogger]: Start removeUnreachable. Operand 202 states. [2019-05-23 09:23:33,253 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-05-23 09:23:33,253 INFO L146 ILogger]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 197 [2019-05-23 09:23:33,253 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:33,254 INFO L146 ILogger]: Abstraction has 202 states and 202 transitions. [2019-05-23 09:23:33,254 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:23:33,254 INFO L146 ILogger]: Start isEmpty. Operand 202 states and 202 transitions. [2019-05-23 09:23:33,254 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 202 [2019-05-23 09:23:33,254 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:33,255 INFO L146 ILogger]: trace histogram [50, 50, 49, 49, 1, 1, 1] [2019-05-23 09:23:33,255 INFO L146 ILogger]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:33,255 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:33,255 INFO L146 ILogger]: Analyzing trace with hash 1937338861, now seen corresponding path program 49 times [2019-05-23 09:23:33,256 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:33,304 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:33,315 INFO L146 ILogger]: Trace formula consists of 358 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 09:23:33,319 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:33,356 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:33,357 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:33,421 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:33,421 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:33,421 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:34,774 INFO L146 ILogger]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:34,775 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:34,775 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:23:34,775 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:23:34,775 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:23:34,776 INFO L146 ILogger]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:23:34,776 INFO L146 ILogger]: Start difference. First operand 202 states and 202 transitions. Second operand 53 states. [2019-05-23 09:23:36,772 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:36,772 INFO L146 ILogger]: Finished difference Result 207 states and 207 transitions. [2019-05-23 09:23:36,773 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:23:36,773 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 201 [2019-05-23 09:23:36,773 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:36,775 INFO L146 ILogger]: With dead ends: 207 [2019-05-23 09:23:36,775 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 09:23:36,776 INFO L146 ILogger]: 0 DeclaredPredicates, 250 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:23:36,776 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 09:23:36,778 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-05-23 09:23:36,778 INFO L146 ILogger]: Start removeUnreachable. Operand 206 states. [2019-05-23 09:23:36,778 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-05-23 09:23:36,779 INFO L146 ILogger]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 201 [2019-05-23 09:23:36,779 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:36,779 INFO L146 ILogger]: Abstraction has 206 states and 206 transitions. [2019-05-23 09:23:36,779 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:23:36,779 INFO L146 ILogger]: Start isEmpty. Operand 206 states and 206 transitions. [2019-05-23 09:23:36,780 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 206 [2019-05-23 09:23:36,780 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:36,780 INFO L146 ILogger]: trace histogram [51, 51, 50, 50, 1, 1, 1] [2019-05-23 09:23:36,780 INFO L146 ILogger]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:36,781 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:36,781 INFO L146 ILogger]: Analyzing trace with hash 1417231334, now seen corresponding path program 50 times [2019-05-23 09:23:36,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:36,831 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:36,843 INFO L146 ILogger]: Trace formula consists of 365 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:23:36,847 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:36,887 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:36,887 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:36,934 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:36,935 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:36,935 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:38,612 INFO L146 ILogger]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:38,612 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:38,613 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:23:38,613 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:23:38,614 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:23:38,614 INFO L146 ILogger]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:23:38,614 INFO L146 ILogger]: Start difference. First operand 206 states and 206 transitions. Second operand 54 states. [2019-05-23 09:23:40,676 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:40,676 INFO L146 ILogger]: Finished difference Result 211 states and 211 transitions. [2019-05-23 09:23:40,676 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:23:40,677 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 205 [2019-05-23 09:23:40,677 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:40,679 INFO L146 ILogger]: With dead ends: 211 [2019-05-23 09:23:40,679 INFO L146 ILogger]: Without dead ends: 211 [2019-05-23 09:23:40,680 INFO L146 ILogger]: 0 DeclaredPredicates, 255 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:23:40,680 INFO L146 ILogger]: Start minimizeSevpa. Operand 211 states. [2019-05-23 09:23:40,682 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-05-23 09:23:40,683 INFO L146 ILogger]: Start removeUnreachable. Operand 210 states. [2019-05-23 09:23:40,683 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-05-23 09:23:40,683 INFO L146 ILogger]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 205 [2019-05-23 09:23:40,684 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:40,684 INFO L146 ILogger]: Abstraction has 210 states and 210 transitions. [2019-05-23 09:23:40,684 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:23:40,684 INFO L146 ILogger]: Start isEmpty. Operand 210 states and 210 transitions. [2019-05-23 09:23:40,685 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 210 [2019-05-23 09:23:40,685 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:40,685 INFO L146 ILogger]: trace histogram [52, 52, 51, 51, 1, 1, 1] [2019-05-23 09:23:40,685 INFO L146 ILogger]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:40,686 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:40,686 INFO L146 ILogger]: Analyzing trace with hash -1138663073, now seen corresponding path program 51 times [2019-05-23 09:23:40,686 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:40,746 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:40,757 INFO L146 ILogger]: Trace formula consists of 372 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 09:23:40,760 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:40,802 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:40,803 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:40,856 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:40,857 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:40,857 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:42,534 INFO L146 ILogger]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:42,534 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:42,534 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:23:42,535 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:23:42,535 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:23:42,535 INFO L146 ILogger]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:23:42,536 INFO L146 ILogger]: Start difference. First operand 210 states and 210 transitions. Second operand 55 states. [2019-05-23 09:23:44,927 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:44,928 INFO L146 ILogger]: Finished difference Result 215 states and 215 transitions. [2019-05-23 09:23:44,928 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:23:44,928 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 209 [2019-05-23 09:23:44,929 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:44,930 INFO L146 ILogger]: With dead ends: 215 [2019-05-23 09:23:44,930 INFO L146 ILogger]: Without dead ends: 215 [2019-05-23 09:23:44,931 INFO L146 ILogger]: 0 DeclaredPredicates, 260 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:23:44,931 INFO L146 ILogger]: Start minimizeSevpa. Operand 215 states. [2019-05-23 09:23:44,936 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-05-23 09:23:44,936 INFO L146 ILogger]: Start removeUnreachable. Operand 214 states. [2019-05-23 09:23:44,936 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-05-23 09:23:44,936 INFO L146 ILogger]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 209 [2019-05-23 09:23:44,937 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:44,937 INFO L146 ILogger]: Abstraction has 214 states and 214 transitions. [2019-05-23 09:23:44,937 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:23:44,937 INFO L146 ILogger]: Start isEmpty. Operand 214 states and 214 transitions. [2019-05-23 09:23:44,938 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 214 [2019-05-23 09:23:44,938 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:44,938 INFO L146 ILogger]: trace histogram [53, 53, 52, 52, 1, 1, 1] [2019-05-23 09:23:44,938 INFO L146 ILogger]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:44,939 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:44,939 INFO L146 ILogger]: Analyzing trace with hash 534258264, now seen corresponding path program 52 times [2019-05-23 09:23:44,939 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:44,990 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:45,000 INFO L146 ILogger]: Trace formula consists of 379 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:23:45,004 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:45,144 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:45,145 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:45,209 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:45,210 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:45,210 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:47,231 INFO L146 ILogger]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:47,231 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:47,232 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:23:47,232 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:23:47,233 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:23:47,233 INFO L146 ILogger]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:23:47,233 INFO L146 ILogger]: Start difference. First operand 214 states and 214 transitions. Second operand 56 states. [2019-05-23 09:23:49,652 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:49,653 INFO L146 ILogger]: Finished difference Result 219 states and 219 transitions. [2019-05-23 09:23:49,653 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:23:49,653 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 213 [2019-05-23 09:23:49,654 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:49,655 INFO L146 ILogger]: With dead ends: 219 [2019-05-23 09:23:49,655 INFO L146 ILogger]: Without dead ends: 219 [2019-05-23 09:23:49,656 INFO L146 ILogger]: 0 DeclaredPredicates, 265 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:23:49,657 INFO L146 ILogger]: Start minimizeSevpa. Operand 219 states. [2019-05-23 09:23:49,659 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-05-23 09:23:49,659 INFO L146 ILogger]: Start removeUnreachable. Operand 218 states. [2019-05-23 09:23:49,660 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-05-23 09:23:49,660 INFO L146 ILogger]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 213 [2019-05-23 09:23:49,660 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:49,660 INFO L146 ILogger]: Abstraction has 218 states and 218 transitions. [2019-05-23 09:23:49,660 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:23:49,660 INFO L146 ILogger]: Start isEmpty. Operand 218 states and 218 transitions. [2019-05-23 09:23:49,661 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 218 [2019-05-23 09:23:49,661 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:49,661 INFO L146 ILogger]: trace histogram [54, 54, 53, 53, 1, 1, 1] [2019-05-23 09:23:49,661 INFO L146 ILogger]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:49,661 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:49,661 INFO L146 ILogger]: Analyzing trace with hash 1474543313, now seen corresponding path program 53 times [2019-05-23 09:23:49,662 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:49,720 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:49,734 INFO L146 ILogger]: Trace formula consists of 386 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 09:23:49,738 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:49,776 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:49,777 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:49,846 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:49,847 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:49,847 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:51,408 INFO L146 ILogger]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:51,409 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:51,409 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:23:51,409 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:23:51,410 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:23:51,410 INFO L146 ILogger]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:23:51,410 INFO L146 ILogger]: Start difference. First operand 218 states and 218 transitions. Second operand 57 states. [2019-05-23 09:23:51,878 WARN L146 ILogger]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:23:54,439 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:54,440 INFO L146 ILogger]: Finished difference Result 223 states and 223 transitions. [2019-05-23 09:23:54,440 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:23:54,440 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 217 [2019-05-23 09:23:54,441 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:54,442 INFO L146 ILogger]: With dead ends: 223 [2019-05-23 09:23:54,442 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 09:23:54,443 INFO L146 ILogger]: 0 DeclaredPredicates, 270 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:23:54,443 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 09:23:54,445 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-05-23 09:23:54,445 INFO L146 ILogger]: Start removeUnreachable. Operand 222 states. [2019-05-23 09:23:54,445 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-05-23 09:23:54,445 INFO L146 ILogger]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 217 [2019-05-23 09:23:54,445 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:54,445 INFO L146 ILogger]: Abstraction has 222 states and 222 transitions. [2019-05-23 09:23:54,445 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:23:54,446 INFO L146 ILogger]: Start isEmpty. Operand 222 states and 222 transitions. [2019-05-23 09:23:54,446 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 222 [2019-05-23 09:23:54,446 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:54,446 INFO L146 ILogger]: trace histogram [55, 55, 54, 54, 1, 1, 1] [2019-05-23 09:23:54,447 INFO L146 ILogger]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:54,447 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:54,447 INFO L146 ILogger]: Analyzing trace with hash 795506378, now seen corresponding path program 54 times [2019-05-23 09:23:54,447 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:54,502 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:54,514 INFO L146 ILogger]: Trace formula consists of 393 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:23:54,516 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:54,555 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:54,556 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:54,608 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:54,608 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:54,608 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:23:56,180 INFO L146 ILogger]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:56,180 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:56,180 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:23:56,180 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:23:56,181 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:23:56,181 INFO L146 ILogger]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:23:56,181 INFO L146 ILogger]: Start difference. First operand 222 states and 222 transitions. Second operand 58 states. [2019-05-23 09:23:58,598 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:58,598 INFO L146 ILogger]: Finished difference Result 227 states and 227 transitions. [2019-05-23 09:23:58,599 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:23:58,599 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 221 [2019-05-23 09:23:58,599 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:58,601 INFO L146 ILogger]: With dead ends: 227 [2019-05-23 09:23:58,601 INFO L146 ILogger]: Without dead ends: 227 [2019-05-23 09:23:58,602 INFO L146 ILogger]: 0 DeclaredPredicates, 275 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:23:58,602 INFO L146 ILogger]: Start minimizeSevpa. Operand 227 states. [2019-05-23 09:23:58,604 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-05-23 09:23:58,604 INFO L146 ILogger]: Start removeUnreachable. Operand 226 states. [2019-05-23 09:23:58,605 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-05-23 09:23:58,605 INFO L146 ILogger]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 221 [2019-05-23 09:23:58,605 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:58,605 INFO L146 ILogger]: Abstraction has 226 states and 226 transitions. [2019-05-23 09:23:58,605 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:23:58,605 INFO L146 ILogger]: Start isEmpty. Operand 226 states and 226 transitions. [2019-05-23 09:23:58,606 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 226 [2019-05-23 09:23:58,606 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:58,607 INFO L146 ILogger]: trace histogram [56, 56, 55, 55, 1, 1, 1] [2019-05-23 09:23:58,607 INFO L146 ILogger]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:58,607 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:58,607 INFO L146 ILogger]: Analyzing trace with hash -193820093, now seen corresponding path program 55 times [2019-05-23 09:23:58,608 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:58,666 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:58,682 INFO L146 ILogger]: Trace formula consists of 400 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 09:23:58,686 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:58,727 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:23:58,728 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:58,787 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:58,787 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:58,788 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:00,493 INFO L146 ILogger]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:00,493 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:00,493 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:24:00,494 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:24:00,494 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:24:00,494 INFO L146 ILogger]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:24:00,494 INFO L146 ILogger]: Start difference. First operand 226 states and 226 transitions. Second operand 59 states. [2019-05-23 09:24:02,834 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:02,834 INFO L146 ILogger]: Finished difference Result 231 states and 231 transitions. [2019-05-23 09:24:02,835 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:24:02,835 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 225 [2019-05-23 09:24:02,835 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:02,836 INFO L146 ILogger]: With dead ends: 231 [2019-05-23 09:24:02,836 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:24:02,837 INFO L146 ILogger]: 0 DeclaredPredicates, 280 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4959, Invalid=8151, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:24:02,838 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:24:02,840 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-05-23 09:24:02,840 INFO L146 ILogger]: Start removeUnreachable. Operand 230 states. [2019-05-23 09:24:02,840 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-05-23 09:24:02,840 INFO L146 ILogger]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 225 [2019-05-23 09:24:02,840 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:02,840 INFO L146 ILogger]: Abstraction has 230 states and 230 transitions. [2019-05-23 09:24:02,840 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:24:02,841 INFO L146 ILogger]: Start isEmpty. Operand 230 states and 230 transitions. [2019-05-23 09:24:02,842 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 230 [2019-05-23 09:24:02,842 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:02,842 INFO L146 ILogger]: trace histogram [57, 57, 56, 56, 1, 1, 1] [2019-05-23 09:24:02,842 INFO L146 ILogger]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:02,842 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:02,843 INFO L146 ILogger]: Analyzing trace with hash 132266300, now seen corresponding path program 56 times [2019-05-23 09:24:02,843 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:02,904 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:02,921 INFO L146 ILogger]: Trace formula consists of 407 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:24:02,924 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:02,964 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:02,964 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:03,027 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:03,028 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:03,028 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:05,263 INFO L146 ILogger]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:05,263 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:05,263 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:24:05,263 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:24:05,264 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:24:05,264 INFO L146 ILogger]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:24:05,264 INFO L146 ILogger]: Start difference. First operand 230 states and 230 transitions. Second operand 60 states. [2019-05-23 09:24:07,796 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:07,796 INFO L146 ILogger]: Finished difference Result 235 states and 235 transitions. [2019-05-23 09:24:07,797 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:24:07,797 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 229 [2019-05-23 09:24:07,797 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:07,798 INFO L146 ILogger]: With dead ends: 235 [2019-05-23 09:24:07,798 INFO L146 ILogger]: Without dead ends: 235 [2019-05-23 09:24:07,799 INFO L146 ILogger]: 0 DeclaredPredicates, 285 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:24:07,799 INFO L146 ILogger]: Start minimizeSevpa. Operand 235 states. [2019-05-23 09:24:07,802 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-05-23 09:24:07,802 INFO L146 ILogger]: Start removeUnreachable. Operand 234 states. [2019-05-23 09:24:07,802 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2019-05-23 09:24:07,803 INFO L146 ILogger]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 229 [2019-05-23 09:24:07,803 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:07,803 INFO L146 ILogger]: Abstraction has 234 states and 234 transitions. [2019-05-23 09:24:07,803 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:24:07,803 INFO L146 ILogger]: Start isEmpty. Operand 234 states and 234 transitions. [2019-05-23 09:24:07,804 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 234 [2019-05-23 09:24:07,804 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:07,804 INFO L146 ILogger]: trace histogram [58, 58, 57, 57, 1, 1, 1] [2019-05-23 09:24:07,805 INFO L146 ILogger]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:07,805 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:07,805 INFO L146 ILogger]: Analyzing trace with hash 1837089717, now seen corresponding path program 57 times [2019-05-23 09:24:07,806 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:07,855 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:07,871 INFO L146 ILogger]: Trace formula consists of 414 conjuncts, 177 conjunts are in the unsatisfiable core [2019-05-23 09:24:07,874 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:07,914 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:07,915 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:07,980 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:07,981 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:07,981 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:10,018 INFO L146 ILogger]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:10,019 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:10,019 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:24:10,019 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:24:10,019 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:24:10,020 INFO L146 ILogger]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:24:10,020 INFO L146 ILogger]: Start difference. First operand 234 states and 234 transitions. Second operand 61 states. [2019-05-23 09:24:12,577 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:12,578 INFO L146 ILogger]: Finished difference Result 239 states and 239 transitions. [2019-05-23 09:24:12,578 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:24:12,578 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 233 [2019-05-23 09:24:12,578 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:12,580 INFO L146 ILogger]: With dead ends: 239 [2019-05-23 09:24:12,580 INFO L146 ILogger]: Without dead ends: 239 [2019-05-23 09:24:12,581 INFO L146 ILogger]: 0 DeclaredPredicates, 290 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5310, Invalid=8732, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:24:12,581 INFO L146 ILogger]: Start minimizeSevpa. Operand 239 states. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Start removeUnreachable. Operand 238 states. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 233 [2019-05-23 09:24:12,584 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Abstraction has 238 states and 238 transitions. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:24:12,584 INFO L146 ILogger]: Start isEmpty. Operand 238 states and 238 transitions. [2019-05-23 09:24:12,585 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 238 [2019-05-23 09:24:12,585 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:12,585 INFO L146 ILogger]: trace histogram [59, 59, 58, 58, 1, 1, 1] [2019-05-23 09:24:12,586 INFO L146 ILogger]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:12,586 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:12,586 INFO L146 ILogger]: Analyzing trace with hash 1542547886, now seen corresponding path program 58 times [2019-05-23 09:24:12,586 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:12,651 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:12,668 INFO L146 ILogger]: Trace formula consists of 421 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 09:24:12,672 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:12,709 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:12,709 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:12,783 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:12,783 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:12,784 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:14,986 INFO L146 ILogger]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:14,986 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:14,986 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:24:14,987 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:24:14,987 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:24:14,987 INFO L146 ILogger]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:24:14,988 INFO L146 ILogger]: Start difference. First operand 238 states and 238 transitions. Second operand 62 states. [2019-05-23 09:24:17,645 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:17,645 INFO L146 ILogger]: Finished difference Result 243 states and 243 transitions. [2019-05-23 09:24:17,645 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:24:17,645 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 237 [2019-05-23 09:24:17,646 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:17,647 INFO L146 ILogger]: With dead ends: 243 [2019-05-23 09:24:17,647 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 09:24:17,648 INFO L146 ILogger]: 0 DeclaredPredicates, 295 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:24:17,648 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 09:24:17,650 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-05-23 09:24:17,650 INFO L146 ILogger]: Start removeUnreachable. Operand 242 states. [2019-05-23 09:24:17,650 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-05-23 09:24:17,650 INFO L146 ILogger]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 237 [2019-05-23 09:24:17,651 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:17,651 INFO L146 ILogger]: Abstraction has 242 states and 242 transitions. [2019-05-23 09:24:17,651 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:24:17,651 INFO L146 ILogger]: Start isEmpty. Operand 242 states and 242 transitions. [2019-05-23 09:24:17,652 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 242 [2019-05-23 09:24:17,652 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:17,652 INFO L146 ILogger]: trace histogram [60, 60, 59, 59, 1, 1, 1] [2019-05-23 09:24:17,652 INFO L146 ILogger]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:17,652 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:17,652 INFO L146 ILogger]: Analyzing trace with hash -860001497, now seen corresponding path program 59 times [2019-05-23 09:24:17,653 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:17,710 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:17,727 INFO L146 ILogger]: Trace formula consists of 428 conjuncts, 183 conjunts are in the unsatisfiable core [2019-05-23 09:24:17,730 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:17,740 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:17,740 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:17,748 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:17,748 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:17,748 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:19,825 INFO L146 ILogger]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:19,826 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:19,826 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:24:19,826 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:24:19,827 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:24:19,827 INFO L146 ILogger]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:24:19,827 INFO L146 ILogger]: Start difference. First operand 242 states and 242 transitions. Second operand 63 states. [2019-05-23 09:24:22,544 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:22,545 INFO L146 ILogger]: Finished difference Result 247 states and 247 transitions. [2019-05-23 09:24:22,545 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:24:22,545 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 241 [2019-05-23 09:24:22,545 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:22,547 INFO L146 ILogger]: With dead ends: 247 [2019-05-23 09:24:22,547 INFO L146 ILogger]: Without dead ends: 247 [2019-05-23 09:24:22,548 INFO L146 ILogger]: 0 DeclaredPredicates, 300 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5673, Invalid=9333, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:24:22,548 INFO L146 ILogger]: Start minimizeSevpa. Operand 247 states. [2019-05-23 09:24:22,551 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 247 to 246. [2019-05-23 09:24:22,551 INFO L146 ILogger]: Start removeUnreachable. Operand 246 states. [2019-05-23 09:24:22,551 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-05-23 09:24:22,551 INFO L146 ILogger]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 241 [2019-05-23 09:24:22,551 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:22,552 INFO L146 ILogger]: Abstraction has 246 states and 246 transitions. [2019-05-23 09:24:22,552 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:24:22,552 INFO L146 ILogger]: Start isEmpty. Operand 246 states and 246 transitions. [2019-05-23 09:24:22,553 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 246 [2019-05-23 09:24:22,553 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:22,553 INFO L146 ILogger]: trace histogram [61, 61, 60, 60, 1, 1, 1] [2019-05-23 09:24:22,553 INFO L146 ILogger]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:22,553 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:22,554 INFO L146 ILogger]: Analyzing trace with hash 206178336, now seen corresponding path program 60 times [2019-05-23 09:24:22,554 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:22,607 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:22,636 INFO L146 ILogger]: Trace formula consists of 435 conjuncts, 186 conjunts are in the unsatisfiable core [2019-05-23 09:24:22,638 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:22,672 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:22,672 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:22,677 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:22,677 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:22,678 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:24,633 INFO L146 ILogger]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:24,633 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:24,633 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:24:24,634 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:24:24,634 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:24:24,634 INFO L146 ILogger]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:24:24,634 INFO L146 ILogger]: Start difference. First operand 246 states and 246 transitions. Second operand 64 states. [2019-05-23 09:24:27,405 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:27,405 INFO L146 ILogger]: Finished difference Result 251 states and 251 transitions. [2019-05-23 09:24:27,406 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:24:27,406 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 245 [2019-05-23 09:24:27,406 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:27,407 INFO L146 ILogger]: With dead ends: 251 [2019-05-23 09:24:27,408 INFO L146 ILogger]: Without dead ends: 251 [2019-05-23 09:24:27,409 INFO L146 ILogger]: 0 DeclaredPredicates, 305 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5859, Invalid=9641, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:24:27,409 INFO L146 ILogger]: Start minimizeSevpa. Operand 251 states. [2019-05-23 09:24:27,411 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-05-23 09:24:27,412 INFO L146 ILogger]: Start removeUnreachable. Operand 250 states. [2019-05-23 09:24:27,412 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-05-23 09:24:27,412 INFO L146 ILogger]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 245 [2019-05-23 09:24:27,412 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:27,412 INFO L146 ILogger]: Abstraction has 250 states and 250 transitions. [2019-05-23 09:24:27,412 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:24:27,412 INFO L146 ILogger]: Start isEmpty. Operand 250 states and 250 transitions. [2019-05-23 09:24:27,413 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 250 [2019-05-23 09:24:27,413 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:27,414 INFO L146 ILogger]: trace histogram [62, 62, 61, 61, 1, 1, 1] [2019-05-23 09:24:27,414 INFO L146 ILogger]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:27,414 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:27,414 INFO L146 ILogger]: Analyzing trace with hash 1239253145, now seen corresponding path program 61 times [2019-05-23 09:24:27,415 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:27,489 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:27,508 INFO L146 ILogger]: Trace formula consists of 442 conjuncts, 189 conjunts are in the unsatisfiable core [2019-05-23 09:24:27,512 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:27,552 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:27,553 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:27,622 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:27,622 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:27,622 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:29,839 INFO L146 ILogger]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:29,839 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:29,839 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:24:29,839 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:24:29,840 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:24:29,840 INFO L146 ILogger]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:24:29,840 INFO L146 ILogger]: Start difference. First operand 250 states and 250 transitions. Second operand 65 states. [2019-05-23 09:24:32,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:32,766 INFO L146 ILogger]: Finished difference Result 255 states and 255 transitions. [2019-05-23 09:24:32,766 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:24:32,766 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 249 [2019-05-23 09:24:32,767 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:32,768 INFO L146 ILogger]: With dead ends: 255 [2019-05-23 09:24:32,768 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 09:24:32,769 INFO L146 ILogger]: 0 DeclaredPredicates, 310 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:24:32,769 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 09:24:32,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-05-23 09:24:32,771 INFO L146 ILogger]: Start removeUnreachable. Operand 254 states. [2019-05-23 09:24:32,771 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-05-23 09:24:32,771 INFO L146 ILogger]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 249 [2019-05-23 09:24:32,771 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:32,771 INFO L146 ILogger]: Abstraction has 254 states and 254 transitions. [2019-05-23 09:24:32,772 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:24:32,772 INFO L146 ILogger]: Start isEmpty. Operand 254 states and 254 transitions. [2019-05-23 09:24:32,772 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 254 [2019-05-23 09:24:32,772 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:32,773 INFO L146 ILogger]: trace histogram [63, 63, 62, 62, 1, 1, 1] [2019-05-23 09:24:32,773 INFO L146 ILogger]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:32,773 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:32,773 INFO L146 ILogger]: Analyzing trace with hash 664671378, now seen corresponding path program 62 times [2019-05-23 09:24:32,774 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:32,824 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:32,844 INFO L146 ILogger]: Trace formula consists of 449 conjuncts, 192 conjunts are in the unsatisfiable core [2019-05-23 09:24:32,847 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:32,886 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:32,886 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:32,956 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:32,956 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:32,956 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:35,168 INFO L146 ILogger]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:35,169 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:35,169 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:24:35,169 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:24:35,170 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:24:35,170 INFO L146 ILogger]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:24:35,170 INFO L146 ILogger]: Start difference. First operand 254 states and 254 transitions. Second operand 66 states. [2019-05-23 09:24:38,114 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:38,114 INFO L146 ILogger]: Finished difference Result 259 states and 259 transitions. [2019-05-23 09:24:38,114 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:24:38,115 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 253 [2019-05-23 09:24:38,115 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:38,116 INFO L146 ILogger]: With dead ends: 259 [2019-05-23 09:24:38,116 INFO L146 ILogger]: Without dead ends: 259 [2019-05-23 09:24:38,118 INFO L146 ILogger]: 0 DeclaredPredicates, 315 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6240, Invalid=10272, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:24:38,118 INFO L146 ILogger]: Start minimizeSevpa. Operand 259 states. [2019-05-23 09:24:38,121 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 259 to 258. [2019-05-23 09:24:38,121 INFO L146 ILogger]: Start removeUnreachable. Operand 258 states. [2019-05-23 09:24:38,121 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2019-05-23 09:24:38,122 INFO L146 ILogger]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 253 [2019-05-23 09:24:38,122 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:38,122 INFO L146 ILogger]: Abstraction has 258 states and 258 transitions. [2019-05-23 09:24:38,122 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:24:38,122 INFO L146 ILogger]: Start isEmpty. Operand 258 states and 258 transitions. [2019-05-23 09:24:38,123 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 258 [2019-05-23 09:24:38,123 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:38,123 INFO L146 ILogger]: trace histogram [64, 64, 63, 63, 1, 1, 1] [2019-05-23 09:24:38,124 INFO L146 ILogger]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:38,124 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:38,124 INFO L146 ILogger]: Analyzing trace with hash 1251083275, now seen corresponding path program 63 times [2019-05-23 09:24:38,125 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:38,190 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:38,208 INFO L146 ILogger]: Trace formula consists of 456 conjuncts, 195 conjunts are in the unsatisfiable core [2019-05-23 09:24:38,211 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:38,219 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:38,219 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:38,224 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:38,224 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:38,225 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:40,541 INFO L146 ILogger]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:40,541 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:40,541 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:24:40,542 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:24:40,543 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:24:40,543 INFO L146 ILogger]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:24:40,543 INFO L146 ILogger]: Start difference. First operand 258 states and 258 transitions. Second operand 67 states. [2019-05-23 09:24:43,582 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:43,582 INFO L146 ILogger]: Finished difference Result 263 states and 263 transitions. [2019-05-23 09:24:43,582 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:24:43,583 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 257 [2019-05-23 09:24:43,583 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:43,584 INFO L146 ILogger]: With dead ends: 263 [2019-05-23 09:24:43,584 INFO L146 ILogger]: Without dead ends: 263 [2019-05-23 09:24:43,586 INFO L146 ILogger]: 0 DeclaredPredicates, 320 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:24:43,586 INFO L146 ILogger]: Start minimizeSevpa. Operand 263 states. [2019-05-23 09:24:43,588 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-05-23 09:24:43,589 INFO L146 ILogger]: Start removeUnreachable. Operand 262 states. [2019-05-23 09:24:43,589 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-05-23 09:24:43,589 INFO L146 ILogger]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 257 [2019-05-23 09:24:43,589 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:43,590 INFO L146 ILogger]: Abstraction has 262 states and 262 transitions. [2019-05-23 09:24:43,590 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:24:43,590 INFO L146 ILogger]: Start isEmpty. Operand 262 states and 262 transitions. [2019-05-23 09:24:43,591 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 262 [2019-05-23 09:24:43,591 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:43,591 INFO L146 ILogger]: trace histogram [65, 65, 64, 64, 1, 1, 1] [2019-05-23 09:24:43,591 INFO L146 ILogger]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:43,592 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:43,592 INFO L146 ILogger]: Analyzing trace with hash -358641916, now seen corresponding path program 64 times [2019-05-23 09:24:43,592 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:43,655 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:43,670 INFO L146 ILogger]: Trace formula consists of 463 conjuncts, 198 conjunts are in the unsatisfiable core [2019-05-23 09:24:43,673 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:43,679 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:43,680 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:43,692 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:43,692 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:43,693 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:46,030 INFO L146 ILogger]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:46,031 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:46,031 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:24:46,031 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:24:46,032 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:24:46,032 INFO L146 ILogger]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:24:46,032 INFO L146 ILogger]: Start difference. First operand 262 states and 262 transitions. Second operand 68 states. [2019-05-23 09:24:49,217 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:49,218 INFO L146 ILogger]: Finished difference Result 267 states and 267 transitions. [2019-05-23 09:24:49,218 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:24:49,218 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 261 [2019-05-23 09:24:49,219 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:49,220 INFO L146 ILogger]: With dead ends: 267 [2019-05-23 09:24:49,220 INFO L146 ILogger]: Without dead ends: 267 [2019-05-23 09:24:49,221 INFO L146 ILogger]: 0 DeclaredPredicates, 325 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6633, Invalid=10923, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:24:49,221 INFO L146 ILogger]: Start minimizeSevpa. Operand 267 states. [2019-05-23 09:24:49,224 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-05-23 09:24:49,224 INFO L146 ILogger]: Start removeUnreachable. Operand 266 states. [2019-05-23 09:24:49,224 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-05-23 09:24:49,224 INFO L146 ILogger]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 261 [2019-05-23 09:24:49,225 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:49,225 INFO L146 ILogger]: Abstraction has 266 states and 266 transitions. [2019-05-23 09:24:49,225 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:24:49,225 INFO L146 ILogger]: Start isEmpty. Operand 266 states and 266 transitions. [2019-05-23 09:24:49,226 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 266 [2019-05-23 09:24:49,226 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:49,226 INFO L146 ILogger]: trace histogram [66, 66, 65, 65, 1, 1, 1] [2019-05-23 09:24:49,227 INFO L146 ILogger]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:49,227 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:49,227 INFO L146 ILogger]: Analyzing trace with hash 1653405053, now seen corresponding path program 65 times [2019-05-23 09:24:49,227 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:49,291 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:49,313 INFO L146 ILogger]: Trace formula consists of 470 conjuncts, 201 conjunts are in the unsatisfiable core [2019-05-23 09:24:49,316 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:49,357 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:49,357 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:49,426 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:49,427 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:49,427 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:51,621 INFO L146 ILogger]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:51,621 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:51,621 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:24:51,622 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:24:51,622 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:24:51,622 INFO L146 ILogger]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:24:51,622 INFO L146 ILogger]: Start difference. First operand 266 states and 266 transitions. Second operand 69 states. [2019-05-23 09:24:54,936 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:54,937 INFO L146 ILogger]: Finished difference Result 271 states and 271 transitions. [2019-05-23 09:24:54,937 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:24:54,937 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 265 [2019-05-23 09:24:54,938 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:54,939 INFO L146 ILogger]: With dead ends: 271 [2019-05-23 09:24:54,939 INFO L146 ILogger]: Without dead ends: 271 [2019-05-23 09:24:54,941 INFO L146 ILogger]: 0 DeclaredPredicates, 330 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6834, Invalid=11256, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:24:54,941 INFO L146 ILogger]: Start minimizeSevpa. Operand 271 states. [2019-05-23 09:24:54,944 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 271 to 270. [2019-05-23 09:24:54,944 INFO L146 ILogger]: Start removeUnreachable. Operand 270 states. [2019-05-23 09:24:54,945 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2019-05-23 09:24:54,945 INFO L146 ILogger]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 265 [2019-05-23 09:24:54,945 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:54,945 INFO L146 ILogger]: Abstraction has 270 states and 270 transitions. [2019-05-23 09:24:54,945 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:24:54,945 INFO L146 ILogger]: Start isEmpty. Operand 270 states and 270 transitions. [2019-05-23 09:24:54,947 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 270 [2019-05-23 09:24:54,947 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:54,947 INFO L146 ILogger]: trace histogram [67, 67, 66, 66, 1, 1, 1] [2019-05-23 09:24:54,947 INFO L146 ILogger]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:54,947 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:54,948 INFO L146 ILogger]: Analyzing trace with hash -1073711242, now seen corresponding path program 66 times [2019-05-23 09:24:54,948 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:55,031 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:55,053 INFO L146 ILogger]: Trace formula consists of 477 conjuncts, 204 conjunts are in the unsatisfiable core [2019-05-23 09:24:55,057 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:55,093 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:24:55,093 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:55,102 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:55,102 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:55,103 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:24:57,576 INFO L146 ILogger]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:57,576 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:57,576 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:24:57,577 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:24:57,577 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:24:57,578 INFO L146 ILogger]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:24:57,578 INFO L146 ILogger]: Start difference. First operand 270 states and 270 transitions. Second operand 70 states. [2019-05-23 09:25:01,123 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:01,123 INFO L146 ILogger]: Finished difference Result 275 states and 275 transitions. [2019-05-23 09:25:01,124 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:25:01,124 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 269 [2019-05-23 09:25:01,124 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:01,126 INFO L146 ILogger]: With dead ends: 275 [2019-05-23 09:25:01,126 INFO L146 ILogger]: Without dead ends: 275 [2019-05-23 09:25:01,127 INFO L146 ILogger]: 0 DeclaredPredicates, 335 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7038, Invalid=11594, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:25:01,127 INFO L146 ILogger]: Start minimizeSevpa. Operand 275 states. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Start removeUnreachable. Operand 274 states. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 269 [2019-05-23 09:25:01,130 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Abstraction has 274 states and 274 transitions. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:25:01,130 INFO L146 ILogger]: Start isEmpty. Operand 274 states and 274 transitions. [2019-05-23 09:25:01,131 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 274 [2019-05-23 09:25:01,131 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:01,132 INFO L146 ILogger]: trace histogram [68, 68, 67, 67, 1, 1, 1] [2019-05-23 09:25:01,132 INFO L146 ILogger]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:01,132 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:01,132 INFO L146 ILogger]: Analyzing trace with hash 1400919279, now seen corresponding path program 67 times [2019-05-23 09:25:01,132 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:01,200 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:01,224 INFO L146 ILogger]: Trace formula consists of 484 conjuncts, 207 conjunts are in the unsatisfiable core [2019-05-23 09:25:01,228 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:01,265 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:01,266 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:01,285 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:01,285 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:01,285 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:03,599 INFO L146 ILogger]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:03,600 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:03,600 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:25:03,600 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:25:03,601 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:25:03,601 INFO L146 ILogger]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:25:03,601 INFO L146 ILogger]: Start difference. First operand 274 states and 274 transitions. Second operand 71 states. [2019-05-23 09:25:07,250 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:07,250 INFO L146 ILogger]: Finished difference Result 279 states and 279 transitions. [2019-05-23 09:25:07,251 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:25:07,251 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 273 [2019-05-23 09:25:07,251 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:07,253 INFO L146 ILogger]: With dead ends: 279 [2019-05-23 09:25:07,253 INFO L146 ILogger]: Without dead ends: 279 [2019-05-23 09:25:07,254 INFO L146 ILogger]: 0 DeclaredPredicates, 340 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:25:07,254 INFO L146 ILogger]: Start minimizeSevpa. Operand 279 states. [2019-05-23 09:25:07,257 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 279 to 278. [2019-05-23 09:25:07,257 INFO L146 ILogger]: Start removeUnreachable. Operand 278 states. [2019-05-23 09:25:07,257 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2019-05-23 09:25:07,258 INFO L146 ILogger]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 273 [2019-05-23 09:25:07,258 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:07,258 INFO L146 ILogger]: Abstraction has 278 states and 278 transitions. [2019-05-23 09:25:07,258 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:25:07,258 INFO L146 ILogger]: Start isEmpty. Operand 278 states and 278 transitions. [2019-05-23 09:25:07,259 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 278 [2019-05-23 09:25:07,260 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:07,260 INFO L146 ILogger]: trace histogram [69, 69, 68, 68, 1, 1, 1] [2019-05-23 09:25:07,260 INFO L146 ILogger]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:07,260 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:07,260 INFO L146 ILogger]: Analyzing trace with hash 1081265640, now seen corresponding path program 68 times [2019-05-23 09:25:07,261 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:07,322 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:07,343 INFO L146 ILogger]: Trace formula consists of 491 conjuncts, 210 conjunts are in the unsatisfiable core [2019-05-23 09:25:07,346 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:07,352 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:07,353 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:07,363 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:07,363 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:07,363 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:09,781 INFO L146 ILogger]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:09,781 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:09,781 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:25:09,782 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:25:09,782 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:25:09,783 INFO L146 ILogger]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:25:09,783 INFO L146 ILogger]: Start difference. First operand 278 states and 278 transitions. Second operand 72 states. [2019-05-23 09:25:13,432 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:13,432 INFO L146 ILogger]: Finished difference Result 283 states and 283 transitions. [2019-05-23 09:25:13,432 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:25:13,433 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 277 [2019-05-23 09:25:13,433 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:13,434 INFO L146 ILogger]: With dead ends: 283 [2019-05-23 09:25:13,434 INFO L146 ILogger]: Without dead ends: 283 [2019-05-23 09:25:13,436 INFO L146 ILogger]: 0 DeclaredPredicates, 345 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7455, Invalid=12285, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:25:13,436 INFO L146 ILogger]: Start minimizeSevpa. Operand 283 states. [2019-05-23 09:25:13,439 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 283 to 282. [2019-05-23 09:25:13,439 INFO L146 ILogger]: Start removeUnreachable. Operand 282 states. [2019-05-23 09:25:13,439 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-05-23 09:25:13,439 INFO L146 ILogger]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 277 [2019-05-23 09:25:13,439 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:13,439 INFO L146 ILogger]: Abstraction has 282 states and 282 transitions. [2019-05-23 09:25:13,439 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:25:13,440 INFO L146 ILogger]: Start isEmpty. Operand 282 states and 282 transitions. [2019-05-23 09:25:13,440 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 282 [2019-05-23 09:25:13,441 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:13,441 INFO L146 ILogger]: trace histogram [70, 70, 69, 69, 1, 1, 1] [2019-05-23 09:25:13,441 INFO L146 ILogger]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:13,441 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:13,441 INFO L146 ILogger]: Analyzing trace with hash 220078689, now seen corresponding path program 69 times [2019-05-23 09:25:13,442 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:13,512 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:13,536 INFO L146 ILogger]: Trace formula consists of 498 conjuncts, 213 conjunts are in the unsatisfiable core [2019-05-23 09:25:13,539 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:13,576 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:13,576 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:13,587 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:13,587 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:13,588 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:16,171 INFO L146 ILogger]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:16,171 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:16,171 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:25:16,172 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:25:16,172 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:25:16,172 INFO L146 ILogger]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:25:16,172 INFO L146 ILogger]: Start difference. First operand 282 states and 282 transitions. Second operand 73 states. [2019-05-23 09:25:19,810 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:19,811 INFO L146 ILogger]: Finished difference Result 287 states and 287 transitions. [2019-05-23 09:25:19,811 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:25:19,811 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 281 [2019-05-23 09:25:19,811 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:19,813 INFO L146 ILogger]: With dead ends: 287 [2019-05-23 09:25:19,813 INFO L146 ILogger]: Without dead ends: 287 [2019-05-23 09:25:19,814 INFO L146 ILogger]: 0 DeclaredPredicates, 350 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7668, Invalid=12638, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:25:19,815 INFO L146 ILogger]: Start minimizeSevpa. Operand 287 states. [2019-05-23 09:25:19,817 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-05-23 09:25:19,817 INFO L146 ILogger]: Start removeUnreachable. Operand 286 states. [2019-05-23 09:25:19,817 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-05-23 09:25:19,817 INFO L146 ILogger]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 281 [2019-05-23 09:25:19,817 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:19,818 INFO L146 ILogger]: Abstraction has 286 states and 286 transitions. [2019-05-23 09:25:19,818 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:25:19,818 INFO L146 ILogger]: Start isEmpty. Operand 286 states and 286 transitions. [2019-05-23 09:25:19,819 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 286 [2019-05-23 09:25:19,819 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:19,819 INFO L146 ILogger]: trace histogram [71, 71, 70, 70, 1, 1, 1] [2019-05-23 09:25:19,820 INFO L146 ILogger]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:19,820 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:19,820 INFO L146 ILogger]: Analyzing trace with hash 849908314, now seen corresponding path program 70 times [2019-05-23 09:25:19,820 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:19,895 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:19,920 INFO L146 ILogger]: Trace formula consists of 505 conjuncts, 216 conjunts are in the unsatisfiable core [2019-05-23 09:25:19,924 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:19,931 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:19,931 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:19,938 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:19,938 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:19,939 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:22,647 INFO L146 ILogger]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:22,647 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:22,647 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:25:22,647 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:25:22,648 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:25:22,648 INFO L146 ILogger]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:25:22,648 INFO L146 ILogger]: Start difference. First operand 286 states and 286 transitions. Second operand 74 states. [2019-05-23 09:25:26,561 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:26,561 INFO L146 ILogger]: Finished difference Result 291 states and 291 transitions. [2019-05-23 09:25:26,562 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:25:26,562 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 285 [2019-05-23 09:25:26,562 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:26,564 INFO L146 ILogger]: With dead ends: 291 [2019-05-23 09:25:26,564 INFO L146 ILogger]: Without dead ends: 291 [2019-05-23 09:25:26,565 INFO L146 ILogger]: 0 DeclaredPredicates, 355 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7884, Invalid=12996, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:25:26,565 INFO L146 ILogger]: Start minimizeSevpa. Operand 291 states. [2019-05-23 09:25:26,567 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-05-23 09:25:26,567 INFO L146 ILogger]: Start removeUnreachable. Operand 290 states. [2019-05-23 09:25:26,567 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2019-05-23 09:25:26,568 INFO L146 ILogger]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 285 [2019-05-23 09:25:26,568 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:26,568 INFO L146 ILogger]: Abstraction has 290 states and 290 transitions. [2019-05-23 09:25:26,568 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:25:26,568 INFO L146 ILogger]: Start isEmpty. Operand 290 states and 290 transitions. [2019-05-23 09:25:26,569 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 290 [2019-05-23 09:25:26,569 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:26,569 INFO L146 ILogger]: trace histogram [72, 72, 71, 71, 1, 1, 1] [2019-05-23 09:25:26,570 INFO L146 ILogger]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:26,570 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:26,570 INFO L146 ILogger]: Analyzing trace with hash -1390912045, now seen corresponding path program 71 times [2019-05-23 09:25:26,571 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:26,643 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:26,665 INFO L146 ILogger]: Trace formula consists of 512 conjuncts, 219 conjunts are in the unsatisfiable core [2019-05-23 09:25:26,667 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:26,674 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:26,674 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:26,687 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:26,687 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:26,688 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:29,257 INFO L146 ILogger]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:29,257 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:29,258 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:25:29,258 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:25:29,258 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:25:29,258 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:25:29,259 INFO L146 ILogger]: Start difference. First operand 290 states and 290 transitions. Second operand 75 states. [2019-05-23 09:25:33,169 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:33,170 INFO L146 ILogger]: Finished difference Result 295 states and 295 transitions. [2019-05-23 09:25:33,170 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:25:33,170 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 289 [2019-05-23 09:25:33,171 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:33,172 INFO L146 ILogger]: With dead ends: 295 [2019-05-23 09:25:33,172 INFO L146 ILogger]: Without dead ends: 295 [2019-05-23 09:25:33,174 INFO L146 ILogger]: 0 DeclaredPredicates, 360 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8103, Invalid=13359, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:25:33,174 INFO L146 ILogger]: Start minimizeSevpa. Operand 295 states. [2019-05-23 09:25:33,176 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-05-23 09:25:33,176 INFO L146 ILogger]: Start removeUnreachable. Operand 294 states. [2019-05-23 09:25:33,176 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2019-05-23 09:25:33,176 INFO L146 ILogger]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 289 [2019-05-23 09:25:33,177 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:33,177 INFO L146 ILogger]: Abstraction has 294 states and 294 transitions. [2019-05-23 09:25:33,177 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:25:33,177 INFO L146 ILogger]: Start isEmpty. Operand 294 states and 294 transitions. [2019-05-23 09:25:33,178 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 294 [2019-05-23 09:25:33,178 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:33,179 INFO L146 ILogger]: trace histogram [73, 73, 72, 72, 1, 1, 1] [2019-05-23 09:25:33,179 INFO L146 ILogger]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:33,179 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:33,179 INFO L146 ILogger]: Analyzing trace with hash -1957444404, now seen corresponding path program 72 times [2019-05-23 09:25:33,180 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:33,258 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:33,277 INFO L146 ILogger]: Trace formula consists of 519 conjuncts, 222 conjunts are in the unsatisfiable core [2019-05-23 09:25:33,279 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:33,283 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:33,284 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:33,296 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:33,296 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:33,297 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:36,312 INFO L146 ILogger]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:36,312 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:36,312 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:25:36,313 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:25:36,313 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:25:36,313 INFO L146 ILogger]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:25:36,313 INFO L146 ILogger]: Start difference. First operand 294 states and 294 transitions. Second operand 76 states. [2019-05-23 09:25:40,144 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:40,144 INFO L146 ILogger]: Finished difference Result 299 states and 299 transitions. [2019-05-23 09:25:40,145 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:25:40,145 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 293 [2019-05-23 09:25:40,145 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:40,147 INFO L146 ILogger]: With dead ends: 299 [2019-05-23 09:25:40,147 INFO L146 ILogger]: Without dead ends: 299 [2019-05-23 09:25:40,148 INFO L146 ILogger]: 0 DeclaredPredicates, 365 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8325, Invalid=13727, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:25:40,149 INFO L146 ILogger]: Start minimizeSevpa. Operand 299 states. [2019-05-23 09:25:40,151 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-05-23 09:25:40,151 INFO L146 ILogger]: Start removeUnreachable. Operand 298 states. [2019-05-23 09:25:40,151 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-05-23 09:25:40,151 INFO L146 ILogger]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 293 [2019-05-23 09:25:40,151 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:40,151 INFO L146 ILogger]: Abstraction has 298 states and 298 transitions. [2019-05-23 09:25:40,152 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:25:40,152 INFO L146 ILogger]: Start isEmpty. Operand 298 states and 298 transitions. [2019-05-23 09:25:40,153 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 298 [2019-05-23 09:25:40,153 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:40,153 INFO L146 ILogger]: trace histogram [74, 74, 73, 73, 1, 1, 1] [2019-05-23 09:25:40,153 INFO L146 ILogger]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:40,153 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:40,153 INFO L146 ILogger]: Analyzing trace with hash 2132870981, now seen corresponding path program 73 times [2019-05-23 09:25:40,154 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:40,245 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:40,274 INFO L146 ILogger]: Trace formula consists of 526 conjuncts, 225 conjunts are in the unsatisfiable core [2019-05-23 09:25:40,277 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:40,319 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:40,319 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:40,328 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:40,328 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:40,328 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:43,198 INFO L146 ILogger]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:43,199 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:43,199 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:25:43,199 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:25:43,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:25:43,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:25:43,200 INFO L146 ILogger]: Start difference. First operand 298 states and 298 transitions. Second operand 77 states. [2019-05-23 09:25:47,322 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:47,322 INFO L146 ILogger]: Finished difference Result 303 states and 303 transitions. [2019-05-23 09:25:47,322 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:25:47,323 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 297 [2019-05-23 09:25:47,323 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:47,324 INFO L146 ILogger]: With dead ends: 303 [2019-05-23 09:25:47,324 INFO L146 ILogger]: Without dead ends: 303 [2019-05-23 09:25:47,325 INFO L146 ILogger]: 0 DeclaredPredicates, 370 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8550, Invalid=14100, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:25:47,326 INFO L146 ILogger]: Start minimizeSevpa. Operand 303 states. [2019-05-23 09:25:47,328 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 303 to 302. [2019-05-23 09:25:47,328 INFO L146 ILogger]: Start removeUnreachable. Operand 302 states. [2019-05-23 09:25:47,328 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-05-23 09:25:47,329 INFO L146 ILogger]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 297 [2019-05-23 09:25:47,329 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:47,329 INFO L146 ILogger]: Abstraction has 302 states and 302 transitions. [2019-05-23 09:25:47,329 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:25:47,329 INFO L146 ILogger]: Start isEmpty. Operand 302 states and 302 transitions. [2019-05-23 09:25:47,330 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 302 [2019-05-23 09:25:47,330 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:47,330 INFO L146 ILogger]: trace histogram [75, 75, 74, 74, 1, 1, 1] [2019-05-23 09:25:47,330 INFO L146 ILogger]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:47,330 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:47,331 INFO L146 ILogger]: Analyzing trace with hash 1831232830, now seen corresponding path program 74 times [2019-05-23 09:25:47,331 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:47,433 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:47,452 INFO L146 ILogger]: Trace formula consists of 533 conjuncts, 228 conjunts are in the unsatisfiable core [2019-05-23 09:25:47,454 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:47,460 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:47,461 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:47,469 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:47,469 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:47,470 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:50,248 INFO L146 ILogger]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:50,248 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:50,248 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:25:50,248 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:25:50,249 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:25:50,249 INFO L146 ILogger]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:25:50,249 INFO L146 ILogger]: Start difference. First operand 302 states and 302 transitions. Second operand 78 states. [2019-05-23 09:25:54,537 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:54,538 INFO L146 ILogger]: Finished difference Result 307 states and 307 transitions. [2019-05-23 09:25:54,538 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:25:54,538 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 301 [2019-05-23 09:25:54,539 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:54,540 INFO L146 ILogger]: With dead ends: 307 [2019-05-23 09:25:54,540 INFO L146 ILogger]: Without dead ends: 307 [2019-05-23 09:25:54,542 INFO L146 ILogger]: 0 DeclaredPredicates, 375 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8778, Invalid=14478, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:25:54,542 INFO L146 ILogger]: Start minimizeSevpa. Operand 307 states. [2019-05-23 09:25:54,545 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 307 to 306. [2019-05-23 09:25:54,545 INFO L146 ILogger]: Start removeUnreachable. Operand 306 states. [2019-05-23 09:25:54,545 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-05-23 09:25:54,545 INFO L146 ILogger]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 301 [2019-05-23 09:25:54,545 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:54,545 INFO L146 ILogger]: Abstraction has 306 states and 306 transitions. [2019-05-23 09:25:54,545 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:25:54,546 INFO L146 ILogger]: Start isEmpty. Operand 306 states and 306 transitions. [2019-05-23 09:25:54,547 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 306 [2019-05-23 09:25:54,547 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:54,547 INFO L146 ILogger]: trace histogram [76, 76, 75, 75, 1, 1, 1] [2019-05-23 09:25:54,547 INFO L146 ILogger]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:54,547 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:54,548 INFO L146 ILogger]: Analyzing trace with hash -51765577, now seen corresponding path program 75 times [2019-05-23 09:25:54,548 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:54,646 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:54,674 INFO L146 ILogger]: Trace formula consists of 540 conjuncts, 231 conjunts are in the unsatisfiable core [2019-05-23 09:25:54,676 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:54,681 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:25:54,681 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:54,692 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:54,692 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:54,692 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:25:57,776 INFO L146 ILogger]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:57,777 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:57,777 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:25:57,777 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:25:57,778 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:25:57,778 INFO L146 ILogger]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:25:57,778 INFO L146 ILogger]: Start difference. First operand 306 states and 306 transitions. Second operand 79 states. [2019-05-23 09:26:02,144 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:02,145 INFO L146 ILogger]: Finished difference Result 311 states and 311 transitions. [2019-05-23 09:26:02,145 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:26:02,145 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 305 [2019-05-23 09:26:02,146 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:02,147 INFO L146 ILogger]: With dead ends: 311 [2019-05-23 09:26:02,147 INFO L146 ILogger]: Without dead ends: 311 [2019-05-23 09:26:02,148 INFO L146 ILogger]: 0 DeclaredPredicates, 380 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9009, Invalid=14861, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:26:02,149 INFO L146 ILogger]: Start minimizeSevpa. Operand 311 states. [2019-05-23 09:26:02,151 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 311 to 310. [2019-05-23 09:26:02,151 INFO L146 ILogger]: Start removeUnreachable. Operand 310 states. [2019-05-23 09:26:02,152 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2019-05-23 09:26:02,152 INFO L146 ILogger]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 305 [2019-05-23 09:26:02,152 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:02,152 INFO L146 ILogger]: Abstraction has 310 states and 310 transitions. [2019-05-23 09:26:02,152 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:26:02,152 INFO L146 ILogger]: Start isEmpty. Operand 310 states and 310 transitions. [2019-05-23 09:26:02,154 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 310 [2019-05-23 09:26:02,154 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:02,154 INFO L146 ILogger]: trace histogram [77, 77, 76, 76, 1, 1, 1] [2019-05-23 09:26:02,154 INFO L146 ILogger]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:02,154 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:02,155 INFO L146 ILogger]: Analyzing trace with hash 684880816, now seen corresponding path program 76 times [2019-05-23 09:26:02,155 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:02,239 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:02,261 INFO L146 ILogger]: Trace formula consists of 547 conjuncts, 234 conjunts are in the unsatisfiable core [2019-05-23 09:26:02,263 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:02,268 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:02,269 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:02,277 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:02,277 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:02,278 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:05,214 INFO L146 ILogger]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:05,214 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:05,214 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:26:05,214 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:26:05,215 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:26:05,215 INFO L146 ILogger]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:26:05,216 INFO L146 ILogger]: Start difference. First operand 310 states and 310 transitions. Second operand 80 states. [2019-05-23 09:26:09,671 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:09,671 INFO L146 ILogger]: Finished difference Result 315 states and 315 transitions. [2019-05-23 09:26:09,671 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:26:09,672 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 309 [2019-05-23 09:26:09,672 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:09,673 INFO L146 ILogger]: With dead ends: 315 [2019-05-23 09:26:09,674 INFO L146 ILogger]: Without dead ends: 315 [2019-05-23 09:26:09,675 INFO L146 ILogger]: 0 DeclaredPredicates, 385 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9243, Invalid=15249, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:26:09,675 INFO L146 ILogger]: Start minimizeSevpa. Operand 315 states. [2019-05-23 09:26:09,677 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-05-23 09:26:09,677 INFO L146 ILogger]: Start removeUnreachable. Operand 314 states. [2019-05-23 09:26:09,677 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2019-05-23 09:26:09,678 INFO L146 ILogger]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 309 [2019-05-23 09:26:09,678 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:09,678 INFO L146 ILogger]: Abstraction has 314 states and 314 transitions. [2019-05-23 09:26:09,678 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:26:09,678 INFO L146 ILogger]: Start isEmpty. Operand 314 states and 314 transitions. [2019-05-23 09:26:09,679 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 314 [2019-05-23 09:26:09,679 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:09,679 INFO L146 ILogger]: trace histogram [78, 78, 77, 77, 1, 1, 1] [2019-05-23 09:26:09,679 INFO L146 ILogger]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:09,680 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:09,680 INFO L146 ILogger]: Analyzing trace with hash -836393943, now seen corresponding path program 77 times [2019-05-23 09:26:09,680 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:09,745 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:09,766 INFO L146 ILogger]: Trace formula consists of 554 conjuncts, 237 conjunts are in the unsatisfiable core [2019-05-23 09:26:09,768 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:09,774 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:09,774 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:09,782 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:09,782 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:09,783 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:12,988 INFO L146 ILogger]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:12,988 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:12,988 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:26:12,989 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:26:12,989 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:26:12,990 INFO L146 ILogger]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:26:12,990 INFO L146 ILogger]: Start difference. First operand 314 states and 314 transitions. Second operand 81 states. [2019-05-23 09:26:17,503 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:17,503 INFO L146 ILogger]: Finished difference Result 319 states and 319 transitions. [2019-05-23 09:26:17,504 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:26:17,504 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 313 [2019-05-23 09:26:17,504 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:17,506 INFO L146 ILogger]: With dead ends: 319 [2019-05-23 09:26:17,506 INFO L146 ILogger]: Without dead ends: 319 [2019-05-23 09:26:17,508 INFO L146 ILogger]: 0 DeclaredPredicates, 390 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:26:17,508 INFO L146 ILogger]: Start minimizeSevpa. Operand 319 states. [2019-05-23 09:26:17,510 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 319 to 318. [2019-05-23 09:26:17,510 INFO L146 ILogger]: Start removeUnreachable. Operand 318 states. [2019-05-23 09:26:17,510 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2019-05-23 09:26:17,510 INFO L146 ILogger]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 313 [2019-05-23 09:26:17,510 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:17,510 INFO L146 ILogger]: Abstraction has 318 states and 318 transitions. [2019-05-23 09:26:17,511 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:26:17,511 INFO L146 ILogger]: Start isEmpty. Operand 318 states and 318 transitions. [2019-05-23 09:26:17,512 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 318 [2019-05-23 09:26:17,512 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:17,512 INFO L146 ILogger]: trace histogram [79, 79, 78, 78, 1, 1, 1] [2019-05-23 09:26:17,512 INFO L146 ILogger]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:17,512 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:17,512 INFO L146 ILogger]: Analyzing trace with hash 1024061474, now seen corresponding path program 78 times [2019-05-23 09:26:17,513 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:17,606 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:17,627 INFO L146 ILogger]: Trace formula consists of 561 conjuncts, 240 conjunts are in the unsatisfiable core [2019-05-23 09:26:17,630 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:17,636 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:17,636 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:17,645 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:17,645 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:17,646 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:20,648 INFO L146 ILogger]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:20,648 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:20,649 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:26:20,649 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:26:20,649 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:26:20,650 INFO L146 ILogger]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:26:20,650 INFO L146 ILogger]: Start difference. First operand 318 states and 318 transitions. Second operand 82 states. [2019-05-23 09:26:25,297 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:25,297 INFO L146 ILogger]: Finished difference Result 323 states and 323 transitions. [2019-05-23 09:26:25,298 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:26:25,298 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 317 [2019-05-23 09:26:25,298 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:25,300 INFO L146 ILogger]: With dead ends: 323 [2019-05-23 09:26:25,300 INFO L146 ILogger]: Without dead ends: 323 [2019-05-23 09:26:25,301 INFO L146 ILogger]: 0 DeclaredPredicates, 395 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9720, Invalid=16040, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:26:25,302 INFO L146 ILogger]: Start minimizeSevpa. Operand 323 states. [2019-05-23 09:26:25,304 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-05-23 09:26:25,304 INFO L146 ILogger]: Start removeUnreachable. Operand 322 states. [2019-05-23 09:26:25,304 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-05-23 09:26:25,304 INFO L146 ILogger]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 317 [2019-05-23 09:26:25,305 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:25,305 INFO L146 ILogger]: Abstraction has 322 states and 322 transitions. [2019-05-23 09:26:25,305 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:26:25,305 INFO L146 ILogger]: Start isEmpty. Operand 322 states and 322 transitions. [2019-05-23 09:26:25,306 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 322 [2019-05-23 09:26:25,306 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:25,306 INFO L146 ILogger]: trace histogram [80, 80, 79, 79, 1, 1, 1] [2019-05-23 09:26:25,307 INFO L146 ILogger]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:25,307 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:25,307 INFO L146 ILogger]: Analyzing trace with hash -930768997, now seen corresponding path program 79 times [2019-05-23 09:26:25,307 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:25,385 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:25,419 INFO L146 ILogger]: Trace formula consists of 568 conjuncts, 243 conjunts are in the unsatisfiable core [2019-05-23 09:26:25,423 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:25,460 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:25,460 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:25,478 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:25,478 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:25,478 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:28,879 INFO L146 ILogger]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:28,880 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:28,880 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:26:28,880 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:26:28,881 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:26:28,881 INFO L146 ILogger]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:26:28,881 INFO L146 ILogger]: Start difference. First operand 322 states and 322 transitions. Second operand 83 states. [2019-05-23 09:26:33,659 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:33,660 INFO L146 ILogger]: Finished difference Result 327 states and 327 transitions. [2019-05-23 09:26:33,660 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:26:33,660 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 321 [2019-05-23 09:26:33,661 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:33,662 INFO L146 ILogger]: With dead ends: 327 [2019-05-23 09:26:33,662 INFO L146 ILogger]: Without dead ends: 327 [2019-05-23 09:26:33,663 INFO L146 ILogger]: 0 DeclaredPredicates, 400 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9963, Invalid=16443, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:26:33,664 INFO L146 ILogger]: Start minimizeSevpa. Operand 327 states. [2019-05-23 09:26:33,666 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 327 to 326. [2019-05-23 09:26:33,666 INFO L146 ILogger]: Start removeUnreachable. Operand 326 states. [2019-05-23 09:26:33,666 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-05-23 09:26:33,666 INFO L146 ILogger]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 321 [2019-05-23 09:26:33,666 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:33,667 INFO L146 ILogger]: Abstraction has 326 states and 326 transitions. [2019-05-23 09:26:33,667 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:26:33,667 INFO L146 ILogger]: Start isEmpty. Operand 326 states and 326 transitions. [2019-05-23 09:26:33,668 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 326 [2019-05-23 09:26:33,668 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:33,668 INFO L146 ILogger]: trace histogram [81, 81, 80, 80, 1, 1, 1] [2019-05-23 09:26:33,668 INFO L146 ILogger]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:33,668 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:33,668 INFO L146 ILogger]: Analyzing trace with hash 1451154068, now seen corresponding path program 80 times [2019-05-23 09:26:33,669 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:33,789 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:33,822 INFO L146 ILogger]: Trace formula consists of 575 conjuncts, 246 conjunts are in the unsatisfiable core [2019-05-23 09:26:33,825 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:33,831 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:33,831 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:33,843 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:33,843 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:33,844 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:37,324 INFO L146 ILogger]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:37,325 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:37,325 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:26:37,325 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:26:37,326 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:26:37,326 INFO L146 ILogger]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:26:37,326 INFO L146 ILogger]: Start difference. First operand 326 states and 326 transitions. Second operand 84 states. [2019-05-23 09:26:42,002 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:42,002 INFO L146 ILogger]: Finished difference Result 331 states and 331 transitions. [2019-05-23 09:26:42,002 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:26:42,002 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 325 [2019-05-23 09:26:42,003 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:42,004 INFO L146 ILogger]: With dead ends: 331 [2019-05-23 09:26:42,004 INFO L146 ILogger]: Without dead ends: 331 [2019-05-23 09:26:42,005 INFO L146 ILogger]: 0 DeclaredPredicates, 405 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10209, Invalid=16851, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:26:42,006 INFO L146 ILogger]: Start minimizeSevpa. Operand 331 states. [2019-05-23 09:26:42,008 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 331 to 330. [2019-05-23 09:26:42,008 INFO L146 ILogger]: Start removeUnreachable. Operand 330 states. [2019-05-23 09:26:42,008 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2019-05-23 09:26:42,008 INFO L146 ILogger]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 325 [2019-05-23 09:26:42,009 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:42,009 INFO L146 ILogger]: Abstraction has 330 states and 330 transitions. [2019-05-23 09:26:42,009 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:26:42,009 INFO L146 ILogger]: Start isEmpty. Operand 330 states and 330 transitions. [2019-05-23 09:26:42,010 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 330 [2019-05-23 09:26:42,010 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:42,010 INFO L146 ILogger]: trace histogram [82, 82, 81, 81, 1, 1, 1] [2019-05-23 09:26:42,010 INFO L146 ILogger]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:42,010 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:42,011 INFO L146 ILogger]: Analyzing trace with hash -272893683, now seen corresponding path program 81 times [2019-05-23 09:26:42,011 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:42,084 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:42,106 INFO L146 ILogger]: Trace formula consists of 582 conjuncts, 249 conjunts are in the unsatisfiable core [2019-05-23 09:26:42,110 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:42,118 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:42,119 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:42,124 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:42,124 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:42,124 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:45,367 INFO L146 ILogger]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:45,367 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:45,367 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:26:45,368 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:26:45,368 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:26:45,369 INFO L146 ILogger]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:26:45,369 INFO L146 ILogger]: Start difference. First operand 330 states and 330 transitions. Second operand 85 states. [2019-05-23 09:26:50,198 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:50,198 INFO L146 ILogger]: Finished difference Result 335 states and 335 transitions. [2019-05-23 09:26:50,199 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:26:50,199 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 329 [2019-05-23 09:26:50,199 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:50,201 INFO L146 ILogger]: With dead ends: 335 [2019-05-23 09:26:50,201 INFO L146 ILogger]: Without dead ends: 335 [2019-05-23 09:26:50,202 INFO L146 ILogger]: 0 DeclaredPredicates, 410 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10458, Invalid=17264, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:26:50,203 INFO L146 ILogger]: Start minimizeSevpa. Operand 335 states. [2019-05-23 09:26:50,204 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 335 to 334. [2019-05-23 09:26:50,204 INFO L146 ILogger]: Start removeUnreachable. Operand 334 states. [2019-05-23 09:26:50,205 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2019-05-23 09:26:50,205 INFO L146 ILogger]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 329 [2019-05-23 09:26:50,205 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:50,205 INFO L146 ILogger]: Abstraction has 334 states and 334 transitions. [2019-05-23 09:26:50,205 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:26:50,205 INFO L146 ILogger]: Start isEmpty. Operand 334 states and 334 transitions. [2019-05-23 09:26:50,206 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 334 [2019-05-23 09:26:50,206 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:50,207 INFO L146 ILogger]: trace histogram [83, 83, 82, 82, 1, 1, 1] [2019-05-23 09:26:50,207 INFO L146 ILogger]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:50,207 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:50,207 INFO L146 ILogger]: Analyzing trace with hash 1340289798, now seen corresponding path program 82 times [2019-05-23 09:26:50,208 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:50,286 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:50,310 INFO L146 ILogger]: Trace formula consists of 589 conjuncts, 252 conjunts are in the unsatisfiable core [2019-05-23 09:26:50,312 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:50,317 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:50,317 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:50,326 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:50,326 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:50,327 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:26:53,830 INFO L146 ILogger]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:53,830 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:53,830 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:26:53,831 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:26:53,831 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:26:53,832 INFO L146 ILogger]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:26:53,832 INFO L146 ILogger]: Start difference. First operand 334 states and 334 transitions. Second operand 86 states. [2019-05-23 09:26:58,736 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:58,737 INFO L146 ILogger]: Finished difference Result 339 states and 339 transitions. [2019-05-23 09:26:58,737 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:26:58,737 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 333 [2019-05-23 09:26:58,738 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:58,739 INFO L146 ILogger]: With dead ends: 339 [2019-05-23 09:26:58,739 INFO L146 ILogger]: Without dead ends: 339 [2019-05-23 09:26:58,741 INFO L146 ILogger]: 0 DeclaredPredicates, 415 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10710, Invalid=17682, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:26:58,741 INFO L146 ILogger]: Start minimizeSevpa. Operand 339 states. [2019-05-23 09:26:58,743 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 339 to 338. [2019-05-23 09:26:58,743 INFO L146 ILogger]: Start removeUnreachable. Operand 338 states. [2019-05-23 09:26:58,743 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2019-05-23 09:26:58,744 INFO L146 ILogger]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 333 [2019-05-23 09:26:58,744 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:58,744 INFO L146 ILogger]: Abstraction has 338 states and 338 transitions. [2019-05-23 09:26:58,744 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:26:58,744 INFO L146 ILogger]: Start isEmpty. Operand 338 states and 338 transitions. [2019-05-23 09:26:58,745 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 338 [2019-05-23 09:26:58,745 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:58,746 INFO L146 ILogger]: trace histogram [84, 84, 83, 83, 1, 1, 1] [2019-05-23 09:26:58,746 INFO L146 ILogger]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:58,746 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:58,746 INFO L146 ILogger]: Analyzing trace with hash 1970980991, now seen corresponding path program 83 times [2019-05-23 09:26:58,747 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:58,879 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:58,915 INFO L146 ILogger]: Trace formula consists of 596 conjuncts, 255 conjunts are in the unsatisfiable core [2019-05-23 09:26:58,918 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:58,922 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:26:58,923 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:58,933 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:58,933 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:58,934 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:02,327 INFO L146 ILogger]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:02,328 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:02,328 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:27:02,328 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:27:02,329 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:27:02,329 INFO L146 ILogger]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:27:02,329 INFO L146 ILogger]: Start difference. First operand 338 states and 338 transitions. Second operand 87 states. [2019-05-23 09:27:07,520 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:07,520 INFO L146 ILogger]: Finished difference Result 343 states and 343 transitions. [2019-05-23 09:27:07,521 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:27:07,521 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 337 [2019-05-23 09:27:07,521 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:07,523 INFO L146 ILogger]: With dead ends: 343 [2019-05-23 09:27:07,523 INFO L146 ILogger]: Without dead ends: 343 [2019-05-23 09:27:07,525 INFO L146 ILogger]: 0 DeclaredPredicates, 420 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10965, Invalid=18105, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:27:07,525 INFO L146 ILogger]: Start minimizeSevpa. Operand 343 states. [2019-05-23 09:27:07,527 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 343 to 342. [2019-05-23 09:27:07,527 INFO L146 ILogger]: Start removeUnreachable. Operand 342 states. [2019-05-23 09:27:07,528 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-05-23 09:27:07,528 INFO L146 ILogger]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 337 [2019-05-23 09:27:07,528 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:07,528 INFO L146 ILogger]: Abstraction has 342 states and 342 transitions. [2019-05-23 09:27:07,528 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:27:07,528 INFO L146 ILogger]: Start isEmpty. Operand 342 states and 342 transitions. [2019-05-23 09:27:07,529 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 342 [2019-05-23 09:27:07,529 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:07,529 INFO L146 ILogger]: trace histogram [85, 85, 84, 84, 1, 1, 1] [2019-05-23 09:27:07,530 INFO L146 ILogger]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:07,530 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:07,530 INFO L146 ILogger]: Analyzing trace with hash 837351800, now seen corresponding path program 84 times [2019-05-23 09:27:07,530 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:07,620 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:07,645 INFO L146 ILogger]: Trace formula consists of 603 conjuncts, 258 conjunts are in the unsatisfiable core [2019-05-23 09:27:07,648 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:07,654 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:07,654 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:07,665 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:07,665 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:07,666 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:11,171 INFO L146 ILogger]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:11,172 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:11,172 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:27:11,172 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:27:11,173 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:27:11,174 INFO L146 ILogger]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:27:11,174 INFO L146 ILogger]: Start difference. First operand 342 states and 342 transitions. Second operand 88 states. [2019-05-23 09:27:16,179 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:16,179 INFO L146 ILogger]: Finished difference Result 347 states and 347 transitions. [2019-05-23 09:27:16,179 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:27:16,179 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 341 [2019-05-23 09:27:16,180 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:16,181 INFO L146 ILogger]: With dead ends: 347 [2019-05-23 09:27:16,182 INFO L146 ILogger]: Without dead ends: 347 [2019-05-23 09:27:16,183 INFO L146 ILogger]: 0 DeclaredPredicates, 425 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11223, Invalid=18533, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:27:16,183 INFO L146 ILogger]: Start minimizeSevpa. Operand 347 states. [2019-05-23 09:27:16,185 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 347 to 346. [2019-05-23 09:27:16,185 INFO L146 ILogger]: Start removeUnreachable. Operand 346 states. [2019-05-23 09:27:16,186 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-05-23 09:27:16,186 INFO L146 ILogger]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 341 [2019-05-23 09:27:16,186 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:16,187 INFO L146 ILogger]: Abstraction has 346 states and 346 transitions. [2019-05-23 09:27:16,187 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:27:16,187 INFO L146 ILogger]: Start isEmpty. Operand 346 states and 346 transitions. [2019-05-23 09:27:16,188 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 346 [2019-05-23 09:27:16,188 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:16,188 INFO L146 ILogger]: trace histogram [86, 86, 85, 85, 1, 1, 1] [2019-05-23 09:27:16,189 INFO L146 ILogger]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:16,189 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:16,189 INFO L146 ILogger]: Analyzing trace with hash -1183578639, now seen corresponding path program 85 times [2019-05-23 09:27:16,189 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:16,273 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:16,299 INFO L146 ILogger]: Trace formula consists of 610 conjuncts, 261 conjunts are in the unsatisfiable core [2019-05-23 09:27:16,302 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:16,314 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:16,315 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:16,327 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:16,327 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:16,327 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:20,115 INFO L146 ILogger]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:20,116 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:20,116 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:27:20,116 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:27:20,117 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:27:20,117 INFO L146 ILogger]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:27:20,118 INFO L146 ILogger]: Start difference. First operand 346 states and 346 transitions. Second operand 89 states. [2019-05-23 09:27:25,380 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:25,381 INFO L146 ILogger]: Finished difference Result 351 states and 351 transitions. [2019-05-23 09:27:25,381 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:27:25,381 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 345 [2019-05-23 09:27:25,382 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:25,383 INFO L146 ILogger]: With dead ends: 351 [2019-05-23 09:27:25,383 INFO L146 ILogger]: Without dead ends: 351 [2019-05-23 09:27:25,385 INFO L146 ILogger]: 0 DeclaredPredicates, 430 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11484, Invalid=18966, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:27:25,385 INFO L146 ILogger]: Start minimizeSevpa. Operand 351 states. [2019-05-23 09:27:25,387 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 351 to 350. [2019-05-23 09:27:25,387 INFO L146 ILogger]: Start removeUnreachable. Operand 350 states. [2019-05-23 09:27:25,388 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2019-05-23 09:27:25,388 INFO L146 ILogger]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 345 [2019-05-23 09:27:25,388 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:25,388 INFO L146 ILogger]: Abstraction has 350 states and 350 transitions. [2019-05-23 09:27:25,388 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:27:25,388 INFO L146 ILogger]: Start isEmpty. Operand 350 states and 350 transitions. [2019-05-23 09:27:25,390 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 350 [2019-05-23 09:27:25,390 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:25,390 INFO L146 ILogger]: trace histogram [87, 87, 86, 86, 1, 1, 1] [2019-05-23 09:27:25,390 INFO L146 ILogger]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:25,391 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:25,391 INFO L146 ILogger]: Analyzing trace with hash 859975146, now seen corresponding path program 86 times [2019-05-23 09:27:25,391 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:25,478 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:25,506 INFO L146 ILogger]: Trace formula consists of 617 conjuncts, 264 conjunts are in the unsatisfiable core [2019-05-23 09:27:25,509 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:25,516 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:25,516 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:25,535 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:25,535 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:25,536 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:29,537 INFO L146 ILogger]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:29,537 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:29,537 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:27:29,538 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:27:29,538 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:27:29,539 INFO L146 ILogger]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:27:29,539 INFO L146 ILogger]: Start difference. First operand 350 states and 350 transitions. Second operand 90 states. [2019-05-23 09:27:34,986 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:34,987 INFO L146 ILogger]: Finished difference Result 355 states and 355 transitions. [2019-05-23 09:27:34,987 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:27:34,987 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 349 [2019-05-23 09:27:34,988 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:34,989 INFO L146 ILogger]: With dead ends: 355 [2019-05-23 09:27:34,990 INFO L146 ILogger]: Without dead ends: 355 [2019-05-23 09:27:34,991 INFO L146 ILogger]: 0 DeclaredPredicates, 435 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11748, Invalid=19404, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 09:27:34,992 INFO L146 ILogger]: Start minimizeSevpa. Operand 355 states. [2019-05-23 09:27:34,994 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 355 to 354. [2019-05-23 09:27:34,994 INFO L146 ILogger]: Start removeUnreachable. Operand 354 states. [2019-05-23 09:27:34,994 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 354 states to 354 states and 354 transitions. [2019-05-23 09:27:34,994 INFO L146 ILogger]: Start accepts. Automaton has 354 states and 354 transitions. Word has length 349 [2019-05-23 09:27:34,994 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:34,995 INFO L146 ILogger]: Abstraction has 354 states and 354 transitions. [2019-05-23 09:27:34,995 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:27:34,995 INFO L146 ILogger]: Start isEmpty. Operand 354 states and 354 transitions. [2019-05-23 09:27:34,996 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 354 [2019-05-23 09:27:34,996 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:34,996 INFO L146 ILogger]: trace histogram [88, 88, 87, 87, 1, 1, 1] [2019-05-23 09:27:34,996 INFO L146 ILogger]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:34,996 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:34,996 INFO L146 ILogger]: Analyzing trace with hash 1230614883, now seen corresponding path program 87 times [2019-05-23 09:27:34,997 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:35,085 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:35,114 INFO L146 ILogger]: Trace formula consists of 624 conjuncts, 267 conjunts are in the unsatisfiable core [2019-05-23 09:27:35,117 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:35,121 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:35,121 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:35,128 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:35,128 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:35,128 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:39,014 INFO L146 ILogger]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:39,014 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:39,015 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:27:39,015 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:27:39,016 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:27:39,016 INFO L146 ILogger]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:27:39,016 INFO L146 ILogger]: Start difference. First operand 354 states and 354 transitions. Second operand 91 states. [2019-05-23 09:27:44,336 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:44,336 INFO L146 ILogger]: Finished difference Result 359 states and 359 transitions. [2019-05-23 09:27:44,336 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:27:44,336 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 353 [2019-05-23 09:27:44,337 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:44,339 INFO L146 ILogger]: With dead ends: 359 [2019-05-23 09:27:44,339 INFO L146 ILogger]: Without dead ends: 359 [2019-05-23 09:27:44,340 INFO L146 ILogger]: 0 DeclaredPredicates, 440 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12015, Invalid=19847, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:27:44,341 INFO L146 ILogger]: Start minimizeSevpa. Operand 359 states. [2019-05-23 09:27:44,343 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 359 to 358. [2019-05-23 09:27:44,343 INFO L146 ILogger]: Start removeUnreachable. Operand 358 states. [2019-05-23 09:27:44,343 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2019-05-23 09:27:44,343 INFO L146 ILogger]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 353 [2019-05-23 09:27:44,343 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:44,343 INFO L146 ILogger]: Abstraction has 358 states and 358 transitions. [2019-05-23 09:27:44,344 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:27:44,344 INFO L146 ILogger]: Start isEmpty. Operand 358 states and 358 transitions. [2019-05-23 09:27:44,345 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 358 [2019-05-23 09:27:44,345 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:44,345 INFO L146 ILogger]: trace histogram [89, 89, 88, 88, 1, 1, 1] [2019-05-23 09:27:44,345 INFO L146 ILogger]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:44,345 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:44,345 INFO L146 ILogger]: Analyzing trace with hash -1197420452, now seen corresponding path program 88 times [2019-05-23 09:27:44,346 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:44,439 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:44,465 INFO L146 ILogger]: Trace formula consists of 631 conjuncts, 270 conjunts are in the unsatisfiable core [2019-05-23 09:27:44,468 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:44,473 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:44,473 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:44,483 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:44,483 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:44,483 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:48,283 INFO L146 ILogger]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:48,283 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:48,284 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:27:48,284 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:27:48,284 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:27:48,285 INFO L146 ILogger]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:27:48,285 INFO L146 ILogger]: Start difference. First operand 358 states and 358 transitions. Second operand 92 states. [2019-05-23 09:27:54,126 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:54,127 INFO L146 ILogger]: Finished difference Result 363 states and 363 transitions. [2019-05-23 09:27:54,127 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:27:54,127 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 357 [2019-05-23 09:27:54,128 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:54,129 INFO L146 ILogger]: With dead ends: 363 [2019-05-23 09:27:54,129 INFO L146 ILogger]: Without dead ends: 363 [2019-05-23 09:27:54,131 INFO L146 ILogger]: 0 DeclaredPredicates, 445 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12285, Invalid=20295, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 09:27:54,131 INFO L146 ILogger]: Start minimizeSevpa. Operand 363 states. [2019-05-23 09:27:54,133 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 363 to 362. [2019-05-23 09:27:54,134 INFO L146 ILogger]: Start removeUnreachable. Operand 362 states. [2019-05-23 09:27:54,134 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-05-23 09:27:54,134 INFO L146 ILogger]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 357 [2019-05-23 09:27:54,134 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:54,134 INFO L146 ILogger]: Abstraction has 362 states and 362 transitions. [2019-05-23 09:27:54,134 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:27:54,134 INFO L146 ILogger]: Start isEmpty. Operand 362 states and 362 transitions. [2019-05-23 09:27:54,136 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 362 [2019-05-23 09:27:54,136 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:54,136 INFO L146 ILogger]: trace histogram [90, 90, 89, 89, 1, 1, 1] [2019-05-23 09:27:54,136 INFO L146 ILogger]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:54,136 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:54,136 INFO L146 ILogger]: Analyzing trace with hash -522335531, now seen corresponding path program 89 times [2019-05-23 09:27:54,137 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:54,224 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:54,259 INFO L146 ILogger]: Trace formula consists of 638 conjuncts, 273 conjunts are in the unsatisfiable core [2019-05-23 09:27:54,262 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:54,267 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:27:54,267 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:54,279 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:54,279 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:54,279 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:27:58,238 INFO L146 ILogger]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:58,238 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:58,238 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:27:58,238 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:27:58,239 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:27:58,239 INFO L146 ILogger]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:27:58,239 INFO L146 ILogger]: Start difference. First operand 362 states and 362 transitions. Second operand 93 states. [2019-05-23 09:28:04,134 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:04,135 INFO L146 ILogger]: Finished difference Result 367 states and 367 transitions. [2019-05-23 09:28:04,135 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:28:04,135 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 361 [2019-05-23 09:28:04,136 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:04,137 INFO L146 ILogger]: With dead ends: 367 [2019-05-23 09:28:04,137 INFO L146 ILogger]: Without dead ends: 367 [2019-05-23 09:28:04,139 INFO L146 ILogger]: 0 DeclaredPredicates, 450 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12558, Invalid=20748, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 09:28:04,140 INFO L146 ILogger]: Start minimizeSevpa. Operand 367 states. [2019-05-23 09:28:04,142 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 367 to 366. [2019-05-23 09:28:04,142 INFO L146 ILogger]: Start removeUnreachable. Operand 366 states. [2019-05-23 09:28:04,142 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-05-23 09:28:04,142 INFO L146 ILogger]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 361 [2019-05-23 09:28:04,143 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:04,143 INFO L146 ILogger]: Abstraction has 366 states and 366 transitions. [2019-05-23 09:28:04,143 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:28:04,143 INFO L146 ILogger]: Start isEmpty. Operand 366 states and 366 transitions. [2019-05-23 09:28:04,144 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 366 [2019-05-23 09:28:04,144 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:04,144 INFO L146 ILogger]: trace histogram [91, 91, 90, 90, 1, 1, 1] [2019-05-23 09:28:04,144 INFO L146 ILogger]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:04,144 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:04,145 INFO L146 ILogger]: Analyzing trace with hash 1421271246, now seen corresponding path program 90 times [2019-05-23 09:28:04,145 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:04,238 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:04,267 INFO L146 ILogger]: Trace formula consists of 645 conjuncts, 276 conjunts are in the unsatisfiable core [2019-05-23 09:28:04,269 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:04,274 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:04,274 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:04,283 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:04,283 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:04,284 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:08,328 INFO L146 ILogger]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:08,329 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:08,329 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:28:08,329 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:28:08,330 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:28:08,330 INFO L146 ILogger]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:28:08,330 INFO L146 ILogger]: Start difference. First operand 366 states and 366 transitions. Second operand 94 states. [2019-05-23 09:28:14,472 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:14,472 INFO L146 ILogger]: Finished difference Result 371 states and 371 transitions. [2019-05-23 09:28:14,473 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:28:14,473 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 365 [2019-05-23 09:28:14,473 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:14,475 INFO L146 ILogger]: With dead ends: 371 [2019-05-23 09:28:14,475 INFO L146 ILogger]: Without dead ends: 371 [2019-05-23 09:28:14,477 INFO L146 ILogger]: 0 DeclaredPredicates, 455 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12834, Invalid=21206, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 09:28:14,477 INFO L146 ILogger]: Start minimizeSevpa. Operand 371 states. [2019-05-23 09:28:14,479 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 371 to 370. [2019-05-23 09:28:14,479 INFO L146 ILogger]: Start removeUnreachable. Operand 370 states. [2019-05-23 09:28:14,480 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2019-05-23 09:28:14,480 INFO L146 ILogger]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 365 [2019-05-23 09:28:14,480 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:14,480 INFO L146 ILogger]: Abstraction has 370 states and 370 transitions. [2019-05-23 09:28:14,480 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:28:14,480 INFO L146 ILogger]: Start isEmpty. Operand 370 states and 370 transitions. [2019-05-23 09:28:14,481 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 370 [2019-05-23 09:28:14,481 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:14,481 INFO L146 ILogger]: trace histogram [92, 92, 91, 91, 1, 1, 1] [2019-05-23 09:28:14,482 INFO L146 ILogger]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:14,482 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:14,482 INFO L146 ILogger]: Analyzing trace with hash 1773294151, now seen corresponding path program 91 times [2019-05-23 09:28:14,482 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:14,648 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:14,692 INFO L146 ILogger]: Trace formula consists of 652 conjuncts, 279 conjunts are in the unsatisfiable core [2019-05-23 09:28:14,695 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:14,700 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:14,700 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:14,710 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:14,710 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:14,711 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:18,835 INFO L146 ILogger]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:18,836 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:18,836 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:28:18,836 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:28:18,837 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:28:18,837 INFO L146 ILogger]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:28:18,837 INFO L146 ILogger]: Start difference. First operand 370 states and 370 transitions. Second operand 95 states. [2019-05-23 09:28:25,030 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:25,031 INFO L146 ILogger]: Finished difference Result 375 states and 375 transitions. [2019-05-23 09:28:25,031 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:28:25,031 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 369 [2019-05-23 09:28:25,032 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:25,033 INFO L146 ILogger]: With dead ends: 375 [2019-05-23 09:28:25,033 INFO L146 ILogger]: Without dead ends: 375 [2019-05-23 09:28:25,034 INFO L146 ILogger]: 0 DeclaredPredicates, 460 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13113, Invalid=21669, Unknown=0, NotChecked=0, Total=34782 [2019-05-23 09:28:25,035 INFO L146 ILogger]: Start minimizeSevpa. Operand 375 states. [2019-05-23 09:28:25,036 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 375 to 374. [2019-05-23 09:28:25,037 INFO L146 ILogger]: Start removeUnreachable. Operand 374 states. [2019-05-23 09:28:25,037 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2019-05-23 09:28:25,037 INFO L146 ILogger]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 369 [2019-05-23 09:28:25,037 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:25,037 INFO L146 ILogger]: Abstraction has 374 states and 374 transitions. [2019-05-23 09:28:25,037 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:28:25,038 INFO L146 ILogger]: Start isEmpty. Operand 374 states and 374 transitions. [2019-05-23 09:28:25,039 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 374 [2019-05-23 09:28:25,039 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:25,039 INFO L146 ILogger]: trace histogram [93, 93, 92, 92, 1, 1, 1] [2019-05-23 09:28:25,039 INFO L146 ILogger]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:25,039 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:25,039 INFO L146 ILogger]: Analyzing trace with hash -935960768, now seen corresponding path program 92 times [2019-05-23 09:28:25,040 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:25,137 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:25,168 INFO L146 ILogger]: Trace formula consists of 659 conjuncts, 282 conjunts are in the unsatisfiable core [2019-05-23 09:28:25,171 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:25,177 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:25,177 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:25,191 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:25,191 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:25,192 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:29,333 INFO L146 ILogger]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:29,333 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:29,333 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:28:29,334 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:28:29,334 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:28:29,335 INFO L146 ILogger]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:28:29,335 INFO L146 ILogger]: Start difference. First operand 374 states and 374 transitions. Second operand 96 states. [2019-05-23 09:28:35,547 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:35,547 INFO L146 ILogger]: Finished difference Result 379 states and 379 transitions. [2019-05-23 09:28:35,547 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:28:35,547 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 373 [2019-05-23 09:28:35,548 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:35,550 INFO L146 ILogger]: With dead ends: 379 [2019-05-23 09:28:35,550 INFO L146 ILogger]: Without dead ends: 379 [2019-05-23 09:28:35,552 INFO L146 ILogger]: 0 DeclaredPredicates, 465 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13395, Invalid=22137, Unknown=0, NotChecked=0, Total=35532 [2019-05-23 09:28:35,552 INFO L146 ILogger]: Start minimizeSevpa. Operand 379 states. [2019-05-23 09:28:35,554 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 379 to 378. [2019-05-23 09:28:35,554 INFO L146 ILogger]: Start removeUnreachable. Operand 378 states. [2019-05-23 09:28:35,555 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2019-05-23 09:28:35,555 INFO L146 ILogger]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 373 [2019-05-23 09:28:35,555 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:35,555 INFO L146 ILogger]: Abstraction has 378 states and 378 transitions. [2019-05-23 09:28:35,555 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:28:35,555 INFO L146 ILogger]: Start isEmpty. Operand 378 states and 378 transitions. [2019-05-23 09:28:35,557 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 378 [2019-05-23 09:28:35,557 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:35,557 INFO L146 ILogger]: trace histogram [94, 94, 93, 93, 1, 1, 1] [2019-05-23 09:28:35,557 INFO L146 ILogger]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:35,557 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:35,557 INFO L146 ILogger]: Analyzing trace with hash -74889287, now seen corresponding path program 93 times [2019-05-23 09:28:35,558 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:35,653 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:35,684 INFO L146 ILogger]: Trace formula consists of 666 conjuncts, 285 conjunts are in the unsatisfiable core [2019-05-23 09:28:35,687 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:35,692 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:35,693 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:35,704 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:35,704 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:35,705 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:40,053 INFO L146 ILogger]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:40,054 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:40,054 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:28:40,054 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:28:40,055 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:28:40,055 INFO L146 ILogger]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:28:40,055 INFO L146 ILogger]: Start difference. First operand 378 states and 378 transitions. Second operand 97 states. [2019-05-23 09:28:46,168 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:46,168 INFO L146 ILogger]: Finished difference Result 383 states and 383 transitions. [2019-05-23 09:28:46,168 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:28:46,168 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 377 [2019-05-23 09:28:46,169 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:46,171 INFO L146 ILogger]: With dead ends: 383 [2019-05-23 09:28:46,171 INFO L146 ILogger]: Without dead ends: 383 [2019-05-23 09:28:46,172 INFO L146 ILogger]: 0 DeclaredPredicates, 470 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13680, Invalid=22610, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 09:28:46,173 INFO L146 ILogger]: Start minimizeSevpa. Operand 383 states. [2019-05-23 09:28:46,175 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 383 to 382. [2019-05-23 09:28:46,175 INFO L146 ILogger]: Start removeUnreachable. Operand 382 states. [2019-05-23 09:28:46,175 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-05-23 09:28:46,175 INFO L146 ILogger]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 377 [2019-05-23 09:28:46,176 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:46,176 INFO L146 ILogger]: Abstraction has 382 states and 382 transitions. [2019-05-23 09:28:46,176 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:28:46,176 INFO L146 ILogger]: Start isEmpty. Operand 382 states and 382 transitions. [2019-05-23 09:28:46,177 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 382 [2019-05-23 09:28:46,177 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:46,177 INFO L146 ILogger]: trace histogram [95, 95, 94, 94, 1, 1, 1] [2019-05-23 09:28:46,178 INFO L146 ILogger]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:46,178 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:46,178 INFO L146 ILogger]: Analyzing trace with hash 30493618, now seen corresponding path program 94 times [2019-05-23 09:28:46,178 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:46,284 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:46,318 INFO L146 ILogger]: Trace formula consists of 673 conjuncts, 288 conjunts are in the unsatisfiable core [2019-05-23 09:28:46,321 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:46,326 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:46,326 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:46,334 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:46,334 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:46,335 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:28:50,906 INFO L146 ILogger]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:50,906 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:50,906 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:28:50,907 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:28:50,907 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:28:50,908 INFO L146 ILogger]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:28:50,908 INFO L146 ILogger]: Start difference. First operand 382 states and 382 transitions. Second operand 98 states. [2019-05-23 09:28:57,245 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:57,245 INFO L146 ILogger]: Finished difference Result 387 states and 387 transitions. [2019-05-23 09:28:57,246 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:28:57,246 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 381 [2019-05-23 09:28:57,246 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:57,248 INFO L146 ILogger]: With dead ends: 387 [2019-05-23 09:28:57,248 INFO L146 ILogger]: Without dead ends: 387 [2019-05-23 09:28:57,249 INFO L146 ILogger]: 0 DeclaredPredicates, 475 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4465 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13968, Invalid=23088, Unknown=0, NotChecked=0, Total=37056 [2019-05-23 09:28:57,250 INFO L146 ILogger]: Start minimizeSevpa. Operand 387 states. [2019-05-23 09:28:57,252 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 387 to 386. [2019-05-23 09:28:57,252 INFO L146 ILogger]: Start removeUnreachable. Operand 386 states. [2019-05-23 09:28:57,253 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-05-23 09:28:57,253 INFO L146 ILogger]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 381 [2019-05-23 09:28:57,253 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:57,253 INFO L146 ILogger]: Abstraction has 386 states and 386 transitions. [2019-05-23 09:28:57,253 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:28:57,253 INFO L146 ILogger]: Start isEmpty. Operand 386 states and 386 transitions. [2019-05-23 09:28:57,254 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 386 [2019-05-23 09:28:57,254 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:57,255 INFO L146 ILogger]: trace histogram [96, 96, 95, 95, 1, 1, 1] [2019-05-23 09:28:57,255 INFO L146 ILogger]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:57,255 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:57,255 INFO L146 ILogger]: Analyzing trace with hash -602625237, now seen corresponding path program 95 times [2019-05-23 09:28:57,256 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:57,366 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:57,400 INFO L146 ILogger]: Trace formula consists of 680 conjuncts, 291 conjunts are in the unsatisfiable core [2019-05-23 09:28:57,404 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:57,414 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:28:57,414 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:57,423 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:57,423 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:57,423 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:02,061 INFO L146 ILogger]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:02,061 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:02,061 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:29:02,062 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:29:02,062 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:29:02,063 INFO L146 ILogger]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:29:02,063 INFO L146 ILogger]: Start difference. First operand 386 states and 386 transitions. Second operand 99 states. [2019-05-23 09:29:08,529 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:08,529 INFO L146 ILogger]: Finished difference Result 391 states and 391 transitions. [2019-05-23 09:29:08,529 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:29:08,529 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 385 [2019-05-23 09:29:08,530 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:08,531 INFO L146 ILogger]: With dead ends: 391 [2019-05-23 09:29:08,531 INFO L146 ILogger]: Without dead ends: 391 [2019-05-23 09:29:08,533 INFO L146 ILogger]: 0 DeclaredPredicates, 480 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14259, Invalid=23571, Unknown=0, NotChecked=0, Total=37830 [2019-05-23 09:29:08,533 INFO L146 ILogger]: Start minimizeSevpa. Operand 391 states. [2019-05-23 09:29:08,535 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 391 to 390. [2019-05-23 09:29:08,535 INFO L146 ILogger]: Start removeUnreachable. Operand 390 states. [2019-05-23 09:29:08,536 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2019-05-23 09:29:08,536 INFO L146 ILogger]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 385 [2019-05-23 09:29:08,536 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:08,536 INFO L146 ILogger]: Abstraction has 390 states and 390 transitions. [2019-05-23 09:29:08,536 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:29:08,537 INFO L146 ILogger]: Start isEmpty. Operand 390 states and 390 transitions. [2019-05-23 09:29:08,539 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 390 [2019-05-23 09:29:08,539 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:08,539 INFO L146 ILogger]: trace histogram [97, 97, 96, 96, 1, 1, 1] [2019-05-23 09:29:08,539 INFO L146 ILogger]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:08,539 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:08,540 INFO L146 ILogger]: Analyzing trace with hash 507094564, now seen corresponding path program 96 times [2019-05-23 09:29:08,540 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:08,654 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:08,688 INFO L146 ILogger]: Trace formula consists of 687 conjuncts, 294 conjunts are in the unsatisfiable core [2019-05-23 09:29:08,691 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:08,720 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:08,720 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:08,729 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:08,729 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:08,730 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:13,250 INFO L146 ILogger]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:13,250 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:13,250 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:29:13,251 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:29:13,251 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:29:13,252 INFO L146 ILogger]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:29:13,252 INFO L146 ILogger]: Start difference. First operand 390 states and 390 transitions. Second operand 100 states. [2019-05-23 09:29:19,868 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:19,869 INFO L146 ILogger]: Finished difference Result 395 states and 395 transitions. [2019-05-23 09:29:19,869 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:29:19,869 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 389 [2019-05-23 09:29:19,870 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:19,872 INFO L146 ILogger]: With dead ends: 395 [2019-05-23 09:29:19,872 INFO L146 ILogger]: Without dead ends: 395 [2019-05-23 09:29:19,874 INFO L146 ILogger]: 0 DeclaredPredicates, 485 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4656 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14553, Invalid=24059, Unknown=0, NotChecked=0, Total=38612 [2019-05-23 09:29:19,874 INFO L146 ILogger]: Start minimizeSevpa. Operand 395 states. [2019-05-23 09:29:19,876 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 395 to 394. [2019-05-23 09:29:19,876 INFO L146 ILogger]: Start removeUnreachable. Operand 394 states. [2019-05-23 09:29:19,876 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 394 states to 394 states and 394 transitions. [2019-05-23 09:29:19,876 INFO L146 ILogger]: Start accepts. Automaton has 394 states and 394 transitions. Word has length 389 [2019-05-23 09:29:19,876 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:19,877 INFO L146 ILogger]: Abstraction has 394 states and 394 transitions. [2019-05-23 09:29:19,877 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:29:19,877 INFO L146 ILogger]: Start isEmpty. Operand 394 states and 394 transitions. [2019-05-23 09:29:19,878 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 394 [2019-05-23 09:29:19,878 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:19,878 INFO L146 ILogger]: trace histogram [98, 98, 97, 97, 1, 1, 1] [2019-05-23 09:29:19,878 INFO L146 ILogger]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:19,879 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:19,879 INFO L146 ILogger]: Analyzing trace with hash 2131131549, now seen corresponding path program 97 times [2019-05-23 09:29:19,879 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:19,991 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:20,031 INFO L146 ILogger]: Trace formula consists of 694 conjuncts, 297 conjunts are in the unsatisfiable core [2019-05-23 09:29:20,034 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:20,038 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:20,038 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:20,051 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:20,051 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:20,052 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:25,000 INFO L146 ILogger]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:25,000 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:25,000 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:29:25,001 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:29:25,001 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:29:25,002 INFO L146 ILogger]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:29:25,002 INFO L146 ILogger]: Start difference. First operand 394 states and 394 transitions. Second operand 101 states. [2019-05-23 09:29:31,695 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:31,696 INFO L146 ILogger]: Finished difference Result 399 states and 399 transitions. [2019-05-23 09:29:31,696 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 09:29:31,696 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 393 [2019-05-23 09:29:31,697 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:31,698 INFO L146 ILogger]: With dead ends: 399 [2019-05-23 09:29:31,699 INFO L146 ILogger]: Without dead ends: 399 [2019-05-23 09:29:31,700 INFO L146 ILogger]: 0 DeclaredPredicates, 490 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14850, Invalid=24552, Unknown=0, NotChecked=0, Total=39402 [2019-05-23 09:29:31,701 INFO L146 ILogger]: Start minimizeSevpa. Operand 399 states. [2019-05-23 09:29:31,703 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 399 to 398. [2019-05-23 09:29:31,704 INFO L146 ILogger]: Start removeUnreachable. Operand 398 states. [2019-05-23 09:29:31,704 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2019-05-23 09:29:31,704 INFO L146 ILogger]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 393 [2019-05-23 09:29:31,704 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:31,704 INFO L146 ILogger]: Abstraction has 398 states and 398 transitions. [2019-05-23 09:29:31,704 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:29:31,705 INFO L146 ILogger]: Start isEmpty. Operand 398 states and 398 transitions. [2019-05-23 09:29:31,706 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 398 [2019-05-23 09:29:31,706 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:31,706 INFO L146 ILogger]: trace histogram [99, 99, 98, 98, 1, 1, 1] [2019-05-23 09:29:31,706 INFO L146 ILogger]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:31,707 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:31,707 INFO L146 ILogger]: Analyzing trace with hash 1747021462, now seen corresponding path program 98 times [2019-05-23 09:29:31,707 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:31,829 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:31,868 INFO L146 ILogger]: Trace formula consists of 701 conjuncts, 300 conjunts are in the unsatisfiable core [2019-05-23 09:29:31,871 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:31,877 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:31,877 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:31,885 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:31,885 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:31,886 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:36,787 INFO L146 ILogger]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:36,787 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:36,787 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:29:36,787 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:29:36,788 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:29:36,789 INFO L146 ILogger]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:29:36,789 INFO L146 ILogger]: Start difference. First operand 398 states and 398 transitions. Second operand 102 states. [2019-05-23 09:29:43,588 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:43,589 INFO L146 ILogger]: Finished difference Result 403 states and 403 transitions. [2019-05-23 09:29:43,589 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:29:43,589 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 397 [2019-05-23 09:29:43,590 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:43,591 INFO L146 ILogger]: With dead ends: 403 [2019-05-23 09:29:43,592 INFO L146 ILogger]: Without dead ends: 403 [2019-05-23 09:29:43,594 INFO L146 ILogger]: 0 DeclaredPredicates, 495 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15150, Invalid=25050, Unknown=0, NotChecked=0, Total=40200 [2019-05-23 09:29:43,594 INFO L146 ILogger]: Start minimizeSevpa. Operand 403 states. [2019-05-23 09:29:43,597 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 403 to 402. [2019-05-23 09:29:43,597 INFO L146 ILogger]: Start removeUnreachable. Operand 402 states. [2019-05-23 09:29:43,597 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-05-23 09:29:43,597 INFO L146 ILogger]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 397 [2019-05-23 09:29:43,597 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:43,597 INFO L146 ILogger]: Abstraction has 402 states and 402 transitions. [2019-05-23 09:29:43,598 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:29:43,598 INFO L146 ILogger]: Start isEmpty. Operand 402 states and 402 transitions. [2019-05-23 09:29:43,599 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 402 [2019-05-23 09:29:43,599 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:43,599 INFO L146 ILogger]: trace histogram [100, 100, 99, 99, 1, 1, 1] [2019-05-23 09:29:43,599 INFO L146 ILogger]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:43,600 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:43,600 INFO L146 ILogger]: Analyzing trace with hash -2045723633, now seen corresponding path program 99 times [2019-05-23 09:29:43,600 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:43,710 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:43,748 INFO L146 ILogger]: Trace formula consists of 708 conjuncts, 303 conjunts are in the unsatisfiable core [2019-05-23 09:29:43,751 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:43,758 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-23 09:29:43,758 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:43,776 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:43,776 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:43,777 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-05-23 09:29:48,741 INFO L146 ILogger]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:48,742 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:48,742 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:29:48,742 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:29:48,743 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:29:48,743 INFO L146 ILogger]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:29:48,743 INFO L146 ILogger]: Start difference. First operand 402 states and 402 transitions. Second operand 103 states. [2019-05-23 09:29:55,690 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:55,690 INFO L146 ILogger]: Finished difference Result 407 states and 407 transitions. [2019-05-23 09:29:55,691 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 09:29:55,691 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 401 [2019-05-23 09:29:55,691 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:55,693 INFO L146 ILogger]: With dead ends: 407 [2019-05-23 09:29:55,693 INFO L146 ILogger]: Without dead ends: 407 [2019-05-23 09:29:55,695 INFO L146 ILogger]: 0 DeclaredPredicates, 500 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15453, Invalid=25553, Unknown=0, NotChecked=0, Total=41006 [2019-05-23 09:29:55,695 INFO L146 ILogger]: Start minimizeSevpa. Operand 407 states. [2019-05-23 09:29:55,697 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 407 to 406. [2019-05-23 09:29:55,698 INFO L146 ILogger]: Start removeUnreachable. Operand 406 states. [2019-05-23 09:29:55,698 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-05-23 09:29:55,698 INFO L146 ILogger]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 401 [2019-05-23 09:29:55,698 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:55,698 INFO L146 ILogger]: Abstraction has 406 states and 406 transitions. [2019-05-23 09:29:55,698 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:29:55,699 INFO L146 ILogger]: Start isEmpty. Operand 406 states and 406 transitions. [2019-05-23 09:29:55,700 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 406 [2019-05-23 09:29:55,700 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:55,701 INFO L146 ILogger]: trace histogram [101, 101, 100, 100, 1, 1, 1] [2019-05-23 09:29:55,701 INFO L146 ILogger]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:55,701 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:55,701 INFO L146 ILogger]: Analyzing trace with hash 1480238344, now seen corresponding path program 100 times [2019-05-23 09:29:55,702 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:55,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:55,805 INFO L146 ILogger]: Trace formula consists of 715 conjuncts, 103 conjunts are in the unsatisfiable core [2019-05-23 09:29:55,810 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:01,120 INFO L146 ILogger]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:01,120 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:01,120 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 09:30:01,121 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 09:30:01,122 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 09:30:01,122 INFO L146 ILogger]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:30:01,122 INFO L146 ILogger]: Start difference. First operand 406 states and 406 transitions. Second operand 104 states. [2019-05-23 09:30:02,463 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:02,463 INFO L146 ILogger]: Finished difference Result 404 states and 403 transitions. [2019-05-23 09:30:02,463 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 09:30:02,464 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 405 [2019-05-23 09:30:02,464 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:02,465 INFO L146 ILogger]: With dead ends: 404 [2019-05-23 09:30:02,465 INFO L146 ILogger]: Without dead ends: 0 [2019-05-23 09:30:02,465 INFO L146 ILogger]: 0 DeclaredPredicates, 405 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5359, Invalid=5561, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:30:02,465 INFO L146 ILogger]: Start minimizeSevpa. Operand 0 states. [2019-05-23 09:30:02,466 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-23 09:30:02,466 INFO L146 ILogger]: Start removeUnreachable. Operand 0 states. [2019-05-23 09:30:02,466 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-23 09:30:02,466 INFO L146 ILogger]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 405 [2019-05-23 09:30:02,466 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:02,466 INFO L146 ILogger]: Abstraction has 0 states and 0 transitions. [2019-05-23 09:30:02,466 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 09:30:02,467 INFO L146 ILogger]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-23 09:30:02,467 INFO L146 ILogger]: Finished isEmpty. No accepting run. [2019-05-23 09:30:02,472 INFO L146 ILogger]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:30:02 BoogieIcfgContainer [2019-05-23 09:30:02,472 INFO L146 ILogger]: ------------------------ END TraceAbstraction---------------------------- [2019-05-23 09:30:02,473 INFO L146 ILogger]: Toolchain (without parser) took 477196.73 ms. Allocated memory was 139.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 108.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 293.0 MB. Max. memory is 7.1 GB. [2019-05-23 09:30:02,473 INFO L146 ILogger]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-23 09:30:02,474 INFO L146 ILogger]: Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 139.5 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-05-23 09:30:02,474 INFO L146 ILogger]: Boogie Preprocessor took 23.43 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-05-23 09:30:02,474 INFO L146 ILogger]: RCFGBuilder took 354.01 ms. Allocated memory is still 139.5 MB. Free memory was 105.8 MB in the beginning and 95.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-05-23 09:30:02,474 INFO L146 ILogger]: TraceAbstraction took 476776.90 ms. Allocated memory was 139.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 95.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 279.6 MB. Max. memory is 7.1 GB. [2019-05-23 09:30:02,476 INFO L146 ILogger]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 139.5 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.43 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.01 ms. Allocated memory is still 139.5 MB. Free memory was 105.8 MB in the beginning and 95.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 476776.90 ms. Allocated memory was 139.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 95.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 279.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 476.7s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 266.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 20807 SDslu, 5286 SDs, 0 SdLazy, 18424 SolverSat, 5308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25655 GetRequests, 15352 SyntacticMatches, 0 SemanticMatches, 10303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166750 ImplicationChecksByTransitivity, 414.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 203.3s InterpolantComputationTime, 20705 NumberOfCodeBlocks, 20705 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 20604 ConstructedInterpolants, 0 QuantifiedInterpolants, 49530804 SizeOfPredicates, 202 NumberOfNonLiveVariables, 36865 ConjunctsInSsa, 15553 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 20000/681750 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...