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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,345 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,347 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,361 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,361 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,362 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,364 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,366 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,368 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,369 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,370 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,370 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,371 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,372 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,373 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,374 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,375 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,377 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,379 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,380 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,382 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,383 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,385 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,385 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,385 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,387 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,387 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,388 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,388 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,389 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,390 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,391 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,392 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,392 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,393 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,394 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,394 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,395 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,396 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:21:57,425 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,440 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,444 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,445 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,446 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,447 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-05-23 09:21:57,447 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-05-23 09:21:57,484 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,485 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,486 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,486 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,487 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,505 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,516 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,522 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:21:57,522 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:21:57,522 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:21:57,524 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,525 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,526 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,526 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,537 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,537 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,538 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,538 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,541 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,545 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,546 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,548 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,548 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,548 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,549 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,550 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 [2019-05-23 09:21:57,622 INFO L146 ILogger]: Specification and implementation of procedure main given in one single declaration [2019-05-23 09:21:57,622 INFO L146 ILogger]: Found specification of procedure main [2019-05-23 09:21:57,623 INFO L146 ILogger]: Found implementation of procedure main [2019-05-23 09:21:57,856 INFO L146 ILogger]: Using library mode [2019-05-23 09:21:57,857 INFO L146 ILogger]: Removed 0 assume(true) statements. [2019-05-23 09:21:57,858 INFO L146 ILogger]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57 BoogieIcfgContainer [2019-05-23 09:21:57,858 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:57,860 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:57,860 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:57,867 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:57,867 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:57,869 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91b92d9 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:21:57, skipping insertion in model container [2019-05-23 09:21:57,869 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57" (2/2) ... [2019-05-23 09:21:57,873 INFO L146 ILogger]: Analyzing ICFG divisibilityWithArray.bpl [2019-05-23 09:21:57,883 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:57,892 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:57,911 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:57,938 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:57,939 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:57,939 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:57,940 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:57,940 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:57,940 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:57,940 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:57,940 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:57,941 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:57,957 INFO L146 ILogger]: Start isEmpty. Operand 9 states. [2019-05-23 09:21:57,965 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 7 [2019-05-23 09:21:57,965 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:57,966 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-23 09:21:57,969 INFO L146 ILogger]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:57,980 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:57,980 INFO L146 ILogger]: Analyzing trace with hash 888492775, now seen corresponding path program 1 times [2019-05-23 09:21:58,031 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,073 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,075 WARN L146 ILogger]: Trace formula consists of 10 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,080 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,205 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 8 treesize of output 7 [2019-05-23 09:21:58,206 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:21:58,249 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:58,249 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:58,249 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-05-23 09:21:58,474 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:58,475 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:21:58,481 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:58,509 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:58,510 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:58,510 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-05-23 09:21:58,601 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,604 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,605 INFO L146 ILogger]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-05-23 09:21:58,609 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:58,624 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:58,625 INFO L146 ILogger]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,627 INFO L146 ILogger]: Start difference. First operand 9 states. Second operand 7 states. [2019-05-23 09:21:58,898 WARN L146 ILogger]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-05-23 09:21:58,993 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,994 INFO L146 ILogger]: Finished difference Result 18 states and 18 transitions. [2019-05-23 09:21:58,994 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:21:58,996 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 6 [2019-05-23 09:21:58,996 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,004 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 09:21:59,005 INFO L146 ILogger]: Without dead ends: 12 [2019-05-23 09:21:59,006 INFO L146 ILogger]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:21:59,020 INFO L146 ILogger]: Start minimizeSevpa. Operand 12 states. [2019-05-23 09:21:59,045 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-05-23 09:21:59,047 INFO L146 ILogger]: Start removeUnreachable. Operand 10 states. [2019-05-23 09:21:59,047 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-05-23 09:21:59,049 INFO L146 ILogger]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-05-23 09:21:59,049 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,049 INFO L146 ILogger]: Abstraction has 10 states and 10 transitions. [2019-05-23 09:21:59,049 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:59,049 INFO L146 ILogger]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-23 09:21:59,050 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 10 [2019-05-23 09:21:59,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,050 INFO L146 ILogger]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,051 INFO L146 ILogger]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,051 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,051 INFO L146 ILogger]: Analyzing trace with hash -795149441, now seen corresponding path program 1 times [2019-05-23 09:21:59,052 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,062 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,063 WARN L146 ILogger]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,064 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,078 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 8 treesize of output 7 [2019-05-23 09:21:59,079 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,082 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:59,082 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,082 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:21:59,201 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:59,202 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:21:59,204 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,238 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:59,239 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,239 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:21:59,411 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:21:59,412 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,412 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:59,414 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:21:59,414 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:21:59,415 INFO L146 ILogger]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:21:59,415 INFO L146 ILogger]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-05-23 09:21:59,622 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,623 INFO L146 ILogger]: Finished difference Result 15 states and 15 transitions. [2019-05-23 09:21:59,623 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:21:59,624 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 9 [2019-05-23 09:21:59,624 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,624 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:21:59,624 INFO L146 ILogger]: Without dead ends: 15 [2019-05-23 09:21:59,626 INFO L146 ILogger]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:21:59,626 INFO L146 ILogger]: Start minimizeSevpa. Operand 15 states. [2019-05-23 09:21:59,628 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-05-23 09:21:59,628 INFO L146 ILogger]: Start removeUnreachable. Operand 13 states. [2019-05-23 09:21:59,629 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-05-23 09:21:59,629 INFO L146 ILogger]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-05-23 09:21:59,629 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,630 INFO L146 ILogger]: Abstraction has 13 states and 13 transitions. [2019-05-23 09:21:59,630 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:21:59,630 INFO L146 ILogger]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-23 09:21:59,631 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 13 [2019-05-23 09:21:59,631 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,631 INFO L146 ILogger]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2019-05-23 09:21:59,631 INFO L146 ILogger]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,632 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,632 INFO L146 ILogger]: Analyzing trace with hash -1552323609, now seen corresponding path program 2 times [2019-05-23 09:21:59,633 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,643 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,645 WARN L146 ILogger]: Trace formula consists of 18 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,646 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,663 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 8 treesize of output 7 [2019-05-23 09:21:59,663 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,674 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:59,675 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,675 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:21:59,821 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:59,822 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:21:59,823 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,833 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:21:59,834 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:21:59,834 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:00,128 INFO L146 ILogger]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,128 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,129 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:22:00,129 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:00,129 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:00,132 INFO L146 ILogger]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:00,132 INFO L146 ILogger]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-05-23 09:22:00,409 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,409 INFO L146 ILogger]: Finished difference Result 18 states and 18 transitions. [2019-05-23 09:22:00,409 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:00,409 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 12 [2019-05-23 09:22:00,410 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,410 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 09:22:00,410 INFO L146 ILogger]: Without dead ends: 18 [2019-05-23 09:22:00,411 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:00,411 INFO L146 ILogger]: Start minimizeSevpa. Operand 18 states. [2019-05-23 09:22:00,413 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-05-23 09:22:00,413 INFO L146 ILogger]: Start removeUnreachable. Operand 16 states. [2019-05-23 09:22:00,414 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-05-23 09:22:00,414 INFO L146 ILogger]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-05-23 09:22:00,414 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,415 INFO L146 ILogger]: Abstraction has 16 states and 16 transitions. [2019-05-23 09:22:00,415 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:00,415 INFO L146 ILogger]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-23 09:22:00,415 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 16 [2019-05-23 09:22:00,416 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,416 INFO L146 ILogger]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2019-05-23 09:22:00,416 INFO L146 ILogger]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,416 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,417 INFO L146 ILogger]: Analyzing trace with hash -1359723905, now seen corresponding path program 3 times [2019-05-23 09:22:00,418 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,429 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,431 WARN L146 ILogger]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,432 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,482 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 8 treesize of output 7 [2019-05-23 09:22:00,482 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:00,488 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:00,488 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:00,489 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:00,612 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:00,613 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:00,615 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:00,625 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:00,625 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:00,626 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:00,705 INFO L146 ILogger]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,706 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,707 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:00,707 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:22:00,708 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:22:00,708 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:00,709 INFO L146 ILogger]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-05-23 09:22:00,906 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,907 INFO L146 ILogger]: Finished difference Result 21 states and 21 transitions. [2019-05-23 09:22:00,907 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:22:00,907 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 15 [2019-05-23 09:22:00,908 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,909 INFO L146 ILogger]: With dead ends: 21 [2019-05-23 09:22:00,909 INFO L146 ILogger]: Without dead ends: 21 [2019-05-23 09:22:00,910 INFO L146 ILogger]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:00,910 INFO L146 ILogger]: Start minimizeSevpa. Operand 21 states. [2019-05-23 09:22:00,913 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-05-23 09:22:00,914 INFO L146 ILogger]: Start removeUnreachable. Operand 19 states. [2019-05-23 09:22:00,914 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-05-23 09:22:00,915 INFO L146 ILogger]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-05-23 09:22:00,915 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,915 INFO L146 ILogger]: Abstraction has 19 states and 19 transitions. [2019-05-23 09:22:00,915 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:22:00,915 INFO L146 ILogger]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-23 09:22:00,916 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 19 [2019-05-23 09:22:00,916 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,916 INFO L146 ILogger]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2019-05-23 09:22:00,917 INFO L146 ILogger]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,917 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,917 INFO L146 ILogger]: Analyzing trace with hash -1698249497, now seen corresponding path program 4 times [2019-05-23 09:22:00,918 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,932 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,934 WARN L146 ILogger]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,935 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,968 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 8 treesize of output 7 [2019-05-23 09:22:00,968 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:00,974 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:00,974 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:00,975 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:01,154 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:01,155 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:01,156 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:01,177 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:01,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:01,178 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:01,245 INFO L146 ILogger]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,246 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,246 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:22:01,247 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:01,247 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:01,248 INFO L146 ILogger]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:01,248 INFO L146 ILogger]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-05-23 09:22:01,460 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,461 INFO L146 ILogger]: Finished difference Result 24 states and 24 transitions. [2019-05-23 09:22:01,462 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:22:01,463 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 18 [2019-05-23 09:22:01,463 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,464 INFO L146 ILogger]: With dead ends: 24 [2019-05-23 09:22:01,464 INFO L146 ILogger]: Without dead ends: 24 [2019-05-23 09:22:01,464 INFO L146 ILogger]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:01,465 INFO L146 ILogger]: Start minimizeSevpa. Operand 24 states. [2019-05-23 09:22:01,467 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-05-23 09:22:01,467 INFO L146 ILogger]: Start removeUnreachable. Operand 22 states. [2019-05-23 09:22:01,468 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-05-23 09:22:01,468 INFO L146 ILogger]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-05-23 09:22:01,469 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,469 INFO L146 ILogger]: Abstraction has 22 states and 22 transitions. [2019-05-23 09:22:01,469 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:01,469 INFO L146 ILogger]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-23 09:22:01,470 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 09:22:01,470 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,470 INFO L146 ILogger]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2019-05-23 09:22:01,470 INFO L146 ILogger]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,471 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,471 INFO L146 ILogger]: Analyzing trace with hash -2130949761, now seen corresponding path program 5 times [2019-05-23 09:22:01,472 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,485 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,487 WARN L146 ILogger]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,489 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,504 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 8 treesize of output 7 [2019-05-23 09:22:01,505 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:01,508 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:01,508 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:01,508 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:01,637 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:01,637 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:01,639 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:01,644 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:01,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:01,645 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:01,688 INFO L146 ILogger]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,689 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,689 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:01,689 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:22:01,689 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:22:01,690 INFO L146 ILogger]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:01,690 INFO L146 ILogger]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-05-23 09:22:02,091 WARN L146 ILogger]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-05-23 09:22:02,164 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,164 INFO L146 ILogger]: Finished difference Result 27 states and 27 transitions. [2019-05-23 09:22:02,165 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:02,165 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 21 [2019-05-23 09:22:02,166 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,166 INFO L146 ILogger]: With dead ends: 27 [2019-05-23 09:22:02,167 INFO L146 ILogger]: Without dead ends: 27 [2019-05-23 09:22:02,167 INFO L146 ILogger]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:02,168 INFO L146 ILogger]: Start minimizeSevpa. Operand 27 states. [2019-05-23 09:22:02,170 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-05-23 09:22:02,170 INFO L146 ILogger]: Start removeUnreachable. Operand 25 states. [2019-05-23 09:22:02,171 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-05-23 09:22:02,171 INFO L146 ILogger]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-05-23 09:22:02,171 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,171 INFO L146 ILogger]: Abstraction has 25 states and 25 transitions. [2019-05-23 09:22:02,172 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:22:02,172 INFO L146 ILogger]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-23 09:22:02,172 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 25 [2019-05-23 09:22:02,172 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,173 INFO L146 ILogger]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2019-05-23 09:22:02,173 INFO L146 ILogger]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,173 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,173 INFO L146 ILogger]: Analyzing trace with hash 787308007, now seen corresponding path program 6 times [2019-05-23 09:22:02,174 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,189 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,191 WARN L146 ILogger]: Trace formula consists of 34 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,192 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,211 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 8 treesize of output 7 [2019-05-23 09:22:02,212 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:02,214 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:02,214 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:02,214 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:02,439 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:02,440 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:02,441 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:02,452 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:02,453 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:02,453 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:02,485 INFO L146 ILogger]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:02,485 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,485 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:22:02,486 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:02,486 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:02,487 INFO L146 ILogger]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:02,487 INFO L146 ILogger]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-05-23 09:22:02,884 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,884 INFO L146 ILogger]: Finished difference Result 30 states and 30 transitions. [2019-05-23 09:22:02,885 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:22:02,885 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 24 [2019-05-23 09:22:02,886 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,887 INFO L146 ILogger]: With dead ends: 30 [2019-05-23 09:22:02,887 INFO L146 ILogger]: Without dead ends: 30 [2019-05-23 09:22:02,887 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:02,888 INFO L146 ILogger]: Start minimizeSevpa. Operand 30 states. [2019-05-23 09:22:02,890 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-05-23 09:22:02,890 INFO L146 ILogger]: Start removeUnreachable. Operand 28 states. [2019-05-23 09:22:02,890 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-23 09:22:02,891 INFO L146 ILogger]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-05-23 09:22:02,891 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,891 INFO L146 ILogger]: Abstraction has 28 states and 28 transitions. [2019-05-23 09:22:02,891 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:02,891 INFO L146 ILogger]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-23 09:22:02,892 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 28 [2019-05-23 09:22:02,892 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,892 INFO L146 ILogger]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2019-05-23 09:22:02,892 INFO L146 ILogger]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,893 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,893 INFO L146 ILogger]: Analyzing trace with hash -123531137, now seen corresponding path program 7 times [2019-05-23 09:22:02,894 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,909 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,911 WARN L146 ILogger]: Trace formula consists of 38 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,913 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,923 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 8 treesize of output 7 [2019-05-23 09:22:02,923 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:02,925 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:02,925 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:02,925 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:03,117 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:03,118 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:03,119 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:03,129 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:03,129 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:03,130 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:03,160 INFO L146 ILogger]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:03,160 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,160 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:03,161 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:22:03,161 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:22:03,162 INFO L146 ILogger]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:03,162 INFO L146 ILogger]: Start difference. First operand 28 states and 28 transitions. Second operand 14 states. [2019-05-23 09:22:03,515 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:03,515 INFO L146 ILogger]: Finished difference Result 33 states and 33 transitions. [2019-05-23 09:22:03,516 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:22:03,516 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 27 [2019-05-23 09:22:03,517 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:03,517 INFO L146 ILogger]: With dead ends: 33 [2019-05-23 09:22:03,518 INFO L146 ILogger]: Without dead ends: 33 [2019-05-23 09:22:03,519 INFO L146 ILogger]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:03,519 INFO L146 ILogger]: Start minimizeSevpa. Operand 33 states. [2019-05-23 09:22:03,522 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-05-23 09:22:03,522 INFO L146 ILogger]: Start removeUnreachable. Operand 31 states. [2019-05-23 09:22:03,523 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-05-23 09:22:03,524 INFO L146 ILogger]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-05-23 09:22:03,524 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:03,524 INFO L146 ILogger]: Abstraction has 31 states and 31 transitions. [2019-05-23 09:22:03,524 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:22:03,524 INFO L146 ILogger]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-23 09:22:03,525 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 31 [2019-05-23 09:22:03,525 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:03,525 INFO L146 ILogger]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2019-05-23 09:22:03,526 INFO L146 ILogger]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:03,526 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:03,526 INFO L146 ILogger]: Analyzing trace with hash 670906087, now seen corresponding path program 8 times [2019-05-23 09:22:03,527 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:03,545 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:03,547 WARN L146 ILogger]: Trace formula consists of 42 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:22:03,548 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:03,566 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 8 treesize of output 7 [2019-05-23 09:22:03,566 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:03,568 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:03,568 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:03,569 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:03,779 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:03,780 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:03,781 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:03,787 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:03,788 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:03,788 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:03,828 INFO L146 ILogger]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:03,828 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,828 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:22:03,829 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:03,829 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:03,829 INFO L146 ILogger]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:03,830 INFO L146 ILogger]: Start difference. First operand 31 states and 31 transitions. Second operand 15 states. [2019-05-23 09:22:04,190 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,191 INFO L146 ILogger]: Finished difference Result 36 states and 36 transitions. [2019-05-23 09:22:04,193 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:04,193 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 30 [2019-05-23 09:22:04,193 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,194 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 09:22:04,194 INFO L146 ILogger]: Without dead ends: 36 [2019-05-23 09:22:04,195 INFO L146 ILogger]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:04,195 INFO L146 ILogger]: Start minimizeSevpa. Operand 36 states. [2019-05-23 09:22:04,199 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-05-23 09:22:04,199 INFO L146 ILogger]: Start removeUnreachable. Operand 34 states. [2019-05-23 09:22:04,200 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-05-23 09:22:04,200 INFO L146 ILogger]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-05-23 09:22:04,200 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:04,201 INFO L146 ILogger]: Abstraction has 34 states and 34 transitions. [2019-05-23 09:22:04,201 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:04,201 INFO L146 ILogger]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-23 09:22:04,202 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 34 [2019-05-23 09:22:04,202 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,202 INFO L146 ILogger]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2019-05-23 09:22:04,202 INFO L146 ILogger]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,203 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,203 INFO L146 ILogger]: Analyzing trace with hash -1814521985, now seen corresponding path program 9 times [2019-05-23 09:22:04,204 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,220 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,222 WARN L146 ILogger]: Trace formula consists of 46 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,224 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,231 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 8 treesize of output 7 [2019-05-23 09:22:04,231 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:04,233 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:04,234 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:04,234 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:04,502 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:04,502 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:04,504 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:04,509 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:04,509 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:04,509 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:04,552 INFO L146 ILogger]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:04,553 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,553 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:04,553 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:22:04,553 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:22:04,554 INFO L146 ILogger]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:04,554 INFO L146 ILogger]: Start difference. First operand 34 states and 34 transitions. Second operand 16 states. [2019-05-23 09:22:04,949 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,950 INFO L146 ILogger]: Finished difference Result 39 states and 39 transitions. [2019-05-23 09:22:04,953 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:22:04,953 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 33 [2019-05-23 09:22:04,953 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,955 INFO L146 ILogger]: With dead ends: 39 [2019-05-23 09:22:04,955 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 09:22:04,956 INFO L146 ILogger]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:04,956 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 09:22:04,959 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-05-23 09:22:04,959 INFO L146 ILogger]: Start removeUnreachable. Operand 37 states. [2019-05-23 09:22:04,960 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-23 09:22:04,960 INFO L146 ILogger]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-05-23 09:22:04,960 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:04,960 INFO L146 ILogger]: Abstraction has 37 states and 37 transitions. [2019-05-23 09:22:04,960 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:22:04,960 INFO L146 ILogger]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-23 09:22:04,961 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 37 [2019-05-23 09:22:04,961 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,962 INFO L146 ILogger]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2019-05-23 09:22:04,962 INFO L146 ILogger]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,962 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,962 INFO L146 ILogger]: Analyzing trace with hash 33968103, now seen corresponding path program 10 times [2019-05-23 09:22:04,963 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,980 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,982 WARN L146 ILogger]: Trace formula consists of 50 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,984 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,002 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 8 treesize of output 7 [2019-05-23 09:22:05,003 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:05,004 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:05,005 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:05,005 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:05,305 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:05,306 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:05,307 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:05,401 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:05,401 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:05,401 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:05,583 INFO L146 ILogger]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:05,584 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:05,584 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:22:05,584 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:05,584 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:05,585 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:05,585 INFO L146 ILogger]: Start difference. First operand 37 states and 37 transitions. Second operand 17 states. [2019-05-23 09:22:06,203 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,203 INFO L146 ILogger]: Finished difference Result 42 states and 42 transitions. [2019-05-23 09:22:06,203 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:22:06,203 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 36 [2019-05-23 09:22:06,204 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,205 INFO L146 ILogger]: With dead ends: 42 [2019-05-23 09:22:06,205 INFO L146 ILogger]: Without dead ends: 42 [2019-05-23 09:22:06,206 INFO L146 ILogger]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:06,206 INFO L146 ILogger]: Start minimizeSevpa. Operand 42 states. [2019-05-23 09:22:06,209 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-05-23 09:22:06,209 INFO L146 ILogger]: Start removeUnreachable. Operand 40 states. [2019-05-23 09:22:06,210 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-05-23 09:22:06,210 INFO L146 ILogger]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-05-23 09:22:06,210 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,210 INFO L146 ILogger]: Abstraction has 40 states and 40 transitions. [2019-05-23 09:22:06,210 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:06,210 INFO L146 ILogger]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-23 09:22:06,211 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 40 [2019-05-23 09:22:06,211 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,212 INFO L146 ILogger]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2019-05-23 09:22:06,212 INFO L146 ILogger]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,212 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,212 INFO L146 ILogger]: Analyzing trace with hash -1668489601, now seen corresponding path program 11 times [2019-05-23 09:22:06,213 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,228 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,230 WARN L146 ILogger]: Trace formula consists of 54 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,232 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,245 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 8 treesize of output 7 [2019-05-23 09:22:06,246 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,247 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,247 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,248 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:06,678 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,678 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:06,679 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:06,684 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:06,684 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,684 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:06,735 INFO L146 ILogger]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,736 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,736 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:06,736 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:22:06,737 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:22:06,737 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:06,737 INFO L146 ILogger]: Start difference. First operand 40 states and 40 transitions. Second operand 18 states. [2019-05-23 09:22:07,292 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,293 INFO L146 ILogger]: Finished difference Result 45 states and 45 transitions. [2019-05-23 09:22:07,293 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:07,293 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 39 [2019-05-23 09:22:07,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,294 INFO L146 ILogger]: With dead ends: 45 [2019-05-23 09:22:07,295 INFO L146 ILogger]: Without dead ends: 45 [2019-05-23 09:22:07,296 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:07,296 INFO L146 ILogger]: Start minimizeSevpa. Operand 45 states. [2019-05-23 09:22:07,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-05-23 09:22:07,299 INFO L146 ILogger]: Start removeUnreachable. Operand 43 states. [2019-05-23 09:22:07,300 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-23 09:22:07,300 INFO L146 ILogger]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-05-23 09:22:07,300 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,300 INFO L146 ILogger]: Abstraction has 43 states and 43 transitions. [2019-05-23 09:22:07,301 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:22:07,301 INFO L146 ILogger]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-23 09:22:07,301 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 09:22:07,302 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,302 INFO L146 ILogger]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2019-05-23 09:22:07,302 INFO L146 ILogger]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,302 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,302 INFO L146 ILogger]: Analyzing trace with hash -317151001, now seen corresponding path program 12 times [2019-05-23 09:22:07,303 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,319 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,320 WARN L146 ILogger]: Trace formula consists of 58 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,322 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,334 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 8 treesize of output 7 [2019-05-23 09:22:07,334 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,339 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,340 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,340 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:07,584 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,585 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:07,586 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:07,592 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:07,593 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,593 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:07,632 INFO L146 ILogger]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,632 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,633 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:22:07,633 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:07,633 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:07,634 INFO L146 ILogger]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:07,634 INFO L146 ILogger]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-05-23 09:22:08,265 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,265 INFO L146 ILogger]: Finished difference Result 48 states and 48 transitions. [2019-05-23 09:22:08,272 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:22:08,272 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 42 [2019-05-23 09:22:08,272 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,273 INFO L146 ILogger]: With dead ends: 48 [2019-05-23 09:22:08,273 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 09:22:08,273 INFO L146 ILogger]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:08,274 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 09:22:08,280 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-05-23 09:22:08,280 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 09:22:08,281 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-05-23 09:22:08,281 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-05-23 09:22:08,281 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,281 INFO L146 ILogger]: Abstraction has 46 states and 46 transitions. [2019-05-23 09:22:08,282 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:08,283 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-23 09:22:08,283 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 46 [2019-05-23 09:22:08,284 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,284 INFO L146 ILogger]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2019-05-23 09:22:08,284 INFO L146 ILogger]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,284 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,284 INFO L146 ILogger]: Analyzing trace with hash 682616191, now seen corresponding path program 13 times [2019-05-23 09:22:08,286 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,319 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,325 WARN L146 ILogger]: Trace formula consists of 62 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,330 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,355 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 8 treesize of output 7 [2019-05-23 09:22:08,356 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,358 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,358 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,358 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:08,595 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,596 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:08,597 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:08,602 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:08,602 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,602 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:08,642 INFO L146 ILogger]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,642 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,642 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:08,642 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:22:08,643 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:22:08,643 INFO L146 ILogger]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:08,643 INFO L146 ILogger]: Start difference. First operand 46 states and 46 transitions. Second operand 20 states. [2019-05-23 09:22:09,647 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,647 INFO L146 ILogger]: Finished difference Result 51 states and 51 transitions. [2019-05-23 09:22:09,648 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:22:09,648 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 45 [2019-05-23 09:22:09,648 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,649 INFO L146 ILogger]: With dead ends: 51 [2019-05-23 09:22:09,649 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:22:09,649 INFO L146 ILogger]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:09,650 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:22:09,653 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-05-23 09:22:09,653 INFO L146 ILogger]: Start removeUnreachable. Operand 49 states. [2019-05-23 09:22:09,654 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-05-23 09:22:09,654 INFO L146 ILogger]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-05-23 09:22:09,654 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,654 INFO L146 ILogger]: Abstraction has 49 states and 49 transitions. [2019-05-23 09:22:09,655 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:22:09,655 INFO L146 ILogger]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-23 09:22:09,655 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 49 [2019-05-23 09:22:09,655 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,656 INFO L146 ILogger]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2019-05-23 09:22:09,656 INFO L146 ILogger]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,656 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,656 INFO L146 ILogger]: Analyzing trace with hash -851164697, now seen corresponding path program 14 times [2019-05-23 09:22:09,657 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,671 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,673 WARN L146 ILogger]: Trace formula consists of 66 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,675 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,715 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 8 treesize of output 7 [2019-05-23 09:22:09,716 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,720 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,721 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,721 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:09,962 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,963 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:09,964 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:09,968 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:09,969 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,969 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:10,005 INFO L146 ILogger]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:10,005 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,005 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:22:10,006 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:10,006 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:10,013 INFO L146 ILogger]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:10,013 INFO L146 ILogger]: Start difference. First operand 49 states and 49 transitions. Second operand 21 states. [2019-05-23 09:22:10,771 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,771 INFO L146 ILogger]: Finished difference Result 54 states and 54 transitions. [2019-05-23 09:22:10,771 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:10,772 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 48 [2019-05-23 09:22:10,772 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,772 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 09:22:10,772 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 09:22:10,773 INFO L146 ILogger]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:10,773 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 09:22:10,776 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-05-23 09:22:10,776 INFO L146 ILogger]: Start removeUnreachable. Operand 52 states. [2019-05-23 09:22:10,776 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-05-23 09:22:10,777 INFO L146 ILogger]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-05-23 09:22:10,777 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,777 INFO L146 ILogger]: Abstraction has 52 states and 52 transitions. [2019-05-23 09:22:10,777 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:10,777 INFO L146 ILogger]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-23 09:22:10,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 52 [2019-05-23 09:22:10,778 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,778 INFO L146 ILogger]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2019-05-23 09:22:10,778 INFO L146 ILogger]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,779 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,779 INFO L146 ILogger]: Analyzing trace with hash 439463039, now seen corresponding path program 15 times [2019-05-23 09:22:10,779 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,794 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,795 WARN L146 ILogger]: Trace formula consists of 70 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,797 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,823 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 8 treesize of output 7 [2019-05-23 09:22:10,823 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:10,826 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:10,826 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,826 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:11,172 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:11,173 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:11,174 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:11,182 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:11,182 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,182 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:11,222 INFO L146 ILogger]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,223 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,223 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:11,223 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:22:11,223 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:22:11,224 INFO L146 ILogger]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:11,224 INFO L146 ILogger]: Start difference. First operand 52 states and 52 transitions. Second operand 22 states. [2019-05-23 09:22:12,048 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,049 INFO L146 ILogger]: Finished difference Result 57 states and 57 transitions. [2019-05-23 09:22:12,049 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:22:12,050 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 51 [2019-05-23 09:22:12,050 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,051 INFO L146 ILogger]: With dead ends: 57 [2019-05-23 09:22:12,051 INFO L146 ILogger]: Without dead ends: 57 [2019-05-23 09:22:12,052 INFO L146 ILogger]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:12,052 INFO L146 ILogger]: Start minimizeSevpa. Operand 57 states. [2019-05-23 09:22:12,056 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-05-23 09:22:12,056 INFO L146 ILogger]: Start removeUnreachable. Operand 55 states. [2019-05-23 09:22:12,056 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-05-23 09:22:12,057 INFO L146 ILogger]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-05-23 09:22:12,057 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,057 INFO L146 ILogger]: Abstraction has 55 states and 55 transitions. [2019-05-23 09:22:12,057 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:22:12,057 INFO L146 ILogger]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-23 09:22:12,058 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 55 [2019-05-23 09:22:12,058 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,059 INFO L146 ILogger]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2019-05-23 09:22:12,059 INFO L146 ILogger]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,059 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,059 INFO L146 ILogger]: Analyzing trace with hash 983112423, now seen corresponding path program 16 times [2019-05-23 09:22:12,060 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,075 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,077 WARN L146 ILogger]: Trace formula consists of 74 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,079 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,113 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 8 treesize of output 7 [2019-05-23 09:22:12,113 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:12,138 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:12,138 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,139 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:12,412 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:12,413 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:12,414 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:12,420 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:12,421 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,421 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:12,470 INFO L146 ILogger]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,470 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,470 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:22:12,470 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:12,471 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:12,471 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:12,471 INFO L146 ILogger]: Start difference. First operand 55 states and 55 transitions. Second operand 23 states. [2019-05-23 09:22:13,356 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,357 INFO L146 ILogger]: Finished difference Result 60 states and 60 transitions. [2019-05-23 09:22:13,357 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:22:13,357 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 54 [2019-05-23 09:22:13,358 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,358 INFO L146 ILogger]: With dead ends: 60 [2019-05-23 09:22:13,358 INFO L146 ILogger]: Without dead ends: 60 [2019-05-23 09:22:13,359 INFO L146 ILogger]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:13,359 INFO L146 ILogger]: Start minimizeSevpa. Operand 60 states. [2019-05-23 09:22:13,362 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-05-23 09:22:13,363 INFO L146 ILogger]: Start removeUnreachable. Operand 58 states. [2019-05-23 09:22:13,363 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-05-23 09:22:13,363 INFO L146 ILogger]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-05-23 09:22:13,364 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,364 INFO L146 ILogger]: Abstraction has 58 states and 58 transitions. [2019-05-23 09:22:13,364 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:13,364 INFO L146 ILogger]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-23 09:22:13,365 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:22:13,365 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,365 INFO L146 ILogger]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2019-05-23 09:22:13,365 INFO L146 ILogger]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,365 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,366 INFO L146 ILogger]: Analyzing trace with hash 520237951, now seen corresponding path program 17 times [2019-05-23 09:22:13,366 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,380 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,382 WARN L146 ILogger]: Trace formula consists of 78 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,384 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,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 8 treesize of output 7 [2019-05-23 09:22:13,417 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,438 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:13,438 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,439 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:13,851 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:13,852 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:13,853 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:13,862 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:13,862 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,863 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:13,913 INFO L146 ILogger]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,914 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,914 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:13,914 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:22:13,915 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:22:13,915 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:13,915 INFO L146 ILogger]: Start difference. First operand 58 states and 58 transitions. Second operand 24 states. [2019-05-23 09:22:14,770 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,771 INFO L146 ILogger]: Finished difference Result 63 states and 63 transitions. [2019-05-23 09:22:14,771 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:14,771 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 57 [2019-05-23 09:22:14,772 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,772 INFO L146 ILogger]: With dead ends: 63 [2019-05-23 09:22:14,772 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 09:22:14,773 INFO L146 ILogger]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:14,773 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 09:22:14,777 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-05-23 09:22:14,777 INFO L146 ILogger]: Start removeUnreachable. Operand 61 states. [2019-05-23 09:22:14,778 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-05-23 09:22:14,778 INFO L146 ILogger]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-05-23 09:22:14,778 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,778 INFO L146 ILogger]: Abstraction has 61 states and 61 transitions. [2019-05-23 09:22:14,778 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:22:14,778 INFO L146 ILogger]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-23 09:22:14,779 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 61 [2019-05-23 09:22:14,779 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,779 INFO L146 ILogger]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2019-05-23 09:22:14,780 INFO L146 ILogger]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,780 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,780 INFO L146 ILogger]: Analyzing trace with hash -2128137241, now seen corresponding path program 18 times [2019-05-23 09:22:14,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,802 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,803 WARN L146 ILogger]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,806 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,818 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 8 treesize of output 7 [2019-05-23 09:22:14,818 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:14,820 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:14,820 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,820 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:15,147 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:15,147 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:15,148 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:15,154 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:15,154 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,155 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:15,200 INFO L146 ILogger]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,200 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,200 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:22:15,200 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:15,201 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:15,201 INFO L146 ILogger]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:15,201 INFO L146 ILogger]: Start difference. First operand 61 states and 61 transitions. Second operand 25 states. [2019-05-23 09:22:16,369 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,370 INFO L146 ILogger]: Finished difference Result 66 states and 66 transitions. [2019-05-23 09:22:16,370 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:22:16,370 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 60 [2019-05-23 09:22:16,371 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,371 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 09:22:16,371 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 09:22:16,372 INFO L146 ILogger]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:16,372 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 09:22:16,375 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-05-23 09:22:16,375 INFO L146 ILogger]: Start removeUnreachable. Operand 64 states. [2019-05-23 09:22:16,376 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-05-23 09:22:16,376 INFO L146 ILogger]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-05-23 09:22:16,376 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,376 INFO L146 ILogger]: Abstraction has 64 states and 64 transitions. [2019-05-23 09:22:16,376 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:16,376 INFO L146 ILogger]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-23 09:22:16,377 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 64 [2019-05-23 09:22:16,377 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,377 INFO L146 ILogger]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2019-05-23 09:22:16,378 INFO L146 ILogger]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,378 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,378 INFO L146 ILogger]: Analyzing trace with hash -1324254593, now seen corresponding path program 19 times [2019-05-23 09:22:16,379 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,392 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,394 WARN L146 ILogger]: Trace formula consists of 86 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,396 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,415 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 8 treesize of output 7 [2019-05-23 09:22:16,415 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,418 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:16,418 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,419 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:16,757 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:16,758 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:16,759 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:16,763 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:16,764 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,764 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:16,811 INFO L146 ILogger]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,811 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,811 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:16,812 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:22:16,812 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:22:16,812 INFO L146 ILogger]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:16,812 INFO L146 ILogger]: Start difference. First operand 64 states and 64 transitions. Second operand 26 states. [2019-05-23 09:22:17,881 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,881 INFO L146 ILogger]: Finished difference Result 69 states and 69 transitions. [2019-05-23 09:22:17,881 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:22:17,882 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 63 [2019-05-23 09:22:17,882 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,882 INFO L146 ILogger]: With dead ends: 69 [2019-05-23 09:22:17,883 INFO L146 ILogger]: Without dead ends: 69 [2019-05-23 09:22:17,883 INFO L146 ILogger]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:17,884 INFO L146 ILogger]: Start minimizeSevpa. Operand 69 states. [2019-05-23 09:22:17,886 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-05-23 09:22:17,886 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 09:22:17,887 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-05-23 09:22:17,887 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-05-23 09:22:17,887 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,887 INFO L146 ILogger]: Abstraction has 67 states and 67 transitions. [2019-05-23 09:22:17,888 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:22:17,888 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-23 09:22:17,888 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 67 [2019-05-23 09:22:17,889 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,889 INFO L146 ILogger]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2019-05-23 09:22:17,889 INFO L146 ILogger]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,889 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,889 INFO L146 ILogger]: Analyzing trace with hash -1593930521, now seen corresponding path program 20 times [2019-05-23 09:22:17,890 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,903 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,905 WARN L146 ILogger]: Trace formula consists of 90 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,908 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,949 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 8 treesize of output 7 [2019-05-23 09:22:17,949 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:17,974 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:17,975 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,975 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:18,493 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:18,494 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:18,495 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:18,500 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:18,500 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,501 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:18,557 INFO L146 ILogger]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,557 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,557 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:22:18,557 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:18,558 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:18,558 INFO L146 ILogger]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:18,558 INFO L146 ILogger]: Start difference. First operand 67 states and 67 transitions. Second operand 27 states. [2019-05-23 09:22:19,777 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,778 INFO L146 ILogger]: Finished difference Result 72 states and 72 transitions. [2019-05-23 09:22:19,778 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:19,778 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 66 [2019-05-23 09:22:19,779 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,779 INFO L146 ILogger]: With dead ends: 72 [2019-05-23 09:22:19,779 INFO L146 ILogger]: Without dead ends: 72 [2019-05-23 09:22:19,780 INFO L146 ILogger]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:19,780 INFO L146 ILogger]: Start minimizeSevpa. Operand 72 states. [2019-05-23 09:22:19,783 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-05-23 09:22:19,783 INFO L146 ILogger]: Start removeUnreachable. Operand 70 states. [2019-05-23 09:22:19,783 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-05-23 09:22:19,783 INFO L146 ILogger]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-05-23 09:22:19,784 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,784 INFO L146 ILogger]: Abstraction has 70 states and 70 transitions. [2019-05-23 09:22:19,784 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:19,784 INFO L146 ILogger]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-23 09:22:19,785 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 70 [2019-05-23 09:22:19,785 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,785 INFO L146 ILogger]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2019-05-23 09:22:19,785 INFO L146 ILogger]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,785 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,785 INFO L146 ILogger]: Analyzing trace with hash 374309247, now seen corresponding path program 21 times [2019-05-23 09:22:19,786 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,800 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,801 WARN L146 ILogger]: Trace formula consists of 94 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,804 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,830 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 8 treesize of output 7 [2019-05-23 09:22:19,830 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:19,832 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:19,832 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,833 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:20,249 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:20,249 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:20,251 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:20,255 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:20,256 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,256 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:20,320 INFO L146 ILogger]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:20,320 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,320 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:20,320 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:22:20,320 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:22:20,321 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:20,321 INFO L146 ILogger]: Start difference. First operand 70 states and 70 transitions. Second operand 28 states. [2019-05-23 09:22:21,772 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,772 INFO L146 ILogger]: Finished difference Result 75 states and 75 transitions. [2019-05-23 09:22:21,779 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:22:21,779 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 69 [2019-05-23 09:22:21,779 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,780 INFO L146 ILogger]: With dead ends: 75 [2019-05-23 09:22:21,780 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:22:21,781 INFO L146 ILogger]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:21,781 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:22:21,782 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-05-23 09:22:21,782 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 09:22:21,783 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-23 09:22:21,783 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-05-23 09:22:21,783 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,783 INFO L146 ILogger]: Abstraction has 73 states and 73 transitions. [2019-05-23 09:22:21,783 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:22:21,783 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-23 09:22:21,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 73 [2019-05-23 09:22:21,788 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,788 INFO L146 ILogger]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2019-05-23 09:22:21,789 INFO L146 ILogger]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,789 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,789 INFO L146 ILogger]: Analyzing trace with hash 1311712743, now seen corresponding path program 22 times [2019-05-23 09:22:21,790 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,815 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,820 WARN L146 ILogger]: Trace formula consists of 98 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,827 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:21,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 8 treesize of output 7 [2019-05-23 09:22:21,851 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:21,856 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:21,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:21,857 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:22,243 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:22,244 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:22,245 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:22,249 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:22,250 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,250 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:22,300 INFO L146 ILogger]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:22,300 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,300 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:22:22,300 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:22,301 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:22,301 INFO L146 ILogger]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:22,301 INFO L146 ILogger]: Start difference. First operand 73 states and 73 transitions. Second operand 29 states. [2019-05-23 09:22:23,701 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:23,701 INFO L146 ILogger]: Finished difference Result 78 states and 78 transitions. [2019-05-23 09:22:23,701 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:22:23,702 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 72 [2019-05-23 09:22:23,702 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:23,703 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:22:23,703 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 09:22:23,704 INFO L146 ILogger]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:23,704 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 09:22:23,706 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-05-23 09:22:23,706 INFO L146 ILogger]: Start removeUnreachable. Operand 76 states. [2019-05-23 09:22:23,707 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-05-23 09:22:23,707 INFO L146 ILogger]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-05-23 09:22:23,707 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:23,707 INFO L146 ILogger]: Abstraction has 76 states and 76 transitions. [2019-05-23 09:22:23,707 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:23,708 INFO L146 ILogger]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-23 09:22:23,708 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 76 [2019-05-23 09:22:23,708 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:23,708 INFO L146 ILogger]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2019-05-23 09:22:23,709 INFO L146 ILogger]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:23,709 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,709 INFO L146 ILogger]: Analyzing trace with hash 1621903487, now seen corresponding path program 23 times [2019-05-23 09:22:23,710 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,722 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:23,724 WARN L146 ILogger]: Trace formula consists of 102 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 09:22:23,726 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,746 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 8 treesize of output 7 [2019-05-23 09:22:23,747 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:23,752 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:23,752 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,752 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:24,233 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:24,234 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:24,235 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:24,240 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:24,240 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,240 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:24,294 INFO L146 ILogger]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:24,294 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:24,295 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:24,295 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:22:24,295 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:22:24,296 INFO L146 ILogger]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:24,296 INFO L146 ILogger]: Start difference. First operand 76 states and 76 transitions. Second operand 30 states. [2019-05-23 09:22:25,775 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,775 INFO L146 ILogger]: Finished difference Result 81 states and 81 transitions. [2019-05-23 09:22:25,776 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:25,776 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 75 [2019-05-23 09:22:25,777 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,777 INFO L146 ILogger]: With dead ends: 81 [2019-05-23 09:22:25,778 INFO L146 ILogger]: Without dead ends: 81 [2019-05-23 09:22:25,778 INFO L146 ILogger]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:25,779 INFO L146 ILogger]: Start minimizeSevpa. Operand 81 states. [2019-05-23 09:22:25,780 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-05-23 09:22:25,780 INFO L146 ILogger]: Start removeUnreachable. Operand 79 states. [2019-05-23 09:22:25,780 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-05-23 09:22:25,780 INFO L146 ILogger]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-05-23 09:22:25,780 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,780 INFO L146 ILogger]: Abstraction has 79 states and 79 transitions. [2019-05-23 09:22:25,781 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:22:25,781 INFO L146 ILogger]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-23 09:22:25,781 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 09:22:25,781 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,781 INFO L146 ILogger]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2019-05-23 09:22:25,782 INFO L146 ILogger]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,782 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,782 INFO L146 ILogger]: Analyzing trace with hash -255263001, now seen corresponding path program 24 times [2019-05-23 09:22:25,783 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,795 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,797 WARN L146 ILogger]: Trace formula consists of 106 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,799 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,841 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 8 treesize of output 7 [2019-05-23 09:22:25,842 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:25,864 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:25,865 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,865 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:26,580 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:26,581 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:26,582 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:26,588 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:26,589 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:26,589 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:26,642 INFO L146 ILogger]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:26,642 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:26,643 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:22:26,643 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:26,643 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:26,643 INFO L146 ILogger]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:26,644 INFO L146 ILogger]: Start difference. First operand 79 states and 79 transitions. Second operand 31 states. [2019-05-23 09:22:28,223 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:28,223 INFO L146 ILogger]: Finished difference Result 84 states and 84 transitions. [2019-05-23 09:22:28,223 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:22:28,224 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 78 [2019-05-23 09:22:28,224 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:28,225 INFO L146 ILogger]: With dead ends: 84 [2019-05-23 09:22:28,225 INFO L146 ILogger]: Without dead ends: 84 [2019-05-23 09:22:28,226 INFO L146 ILogger]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:28,226 INFO L146 ILogger]: Start minimizeSevpa. Operand 84 states. [2019-05-23 09:22:28,228 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-05-23 09:22:28,228 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 09:22:28,228 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-05-23 09:22:28,229 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-05-23 09:22:28,229 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:28,229 INFO L146 ILogger]: Abstraction has 82 states and 82 transitions. [2019-05-23 09:22:28,229 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:28,229 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-23 09:22:28,230 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 82 [2019-05-23 09:22:28,230 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:28,230 INFO L146 ILogger]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2019-05-23 09:22:28,230 INFO L146 ILogger]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:28,230 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:28,231 INFO L146 ILogger]: Analyzing trace with hash 1847054207, now seen corresponding path program 25 times [2019-05-23 09:22:28,231 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:28,244 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:28,246 WARN L146 ILogger]: Trace formula consists of 110 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:22:28,248 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:28,291 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 8 treesize of output 7 [2019-05-23 09:22:28,291 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,303 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:28,303 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,303 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:28,840 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:28,840 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:28,841 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,846 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:28,846 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:28,846 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:28,911 INFO L146 ILogger]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:28,911 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:28,911 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:28,911 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:22:28,912 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:22:28,912 INFO L146 ILogger]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:28,912 INFO L146 ILogger]: Start difference. First operand 82 states and 82 transitions. Second operand 32 states. [2019-05-23 09:22:30,658 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:30,659 INFO L146 ILogger]: Finished difference Result 87 states and 87 transitions. [2019-05-23 09:22:30,659 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:22:30,659 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 81 [2019-05-23 09:22:30,659 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:30,660 INFO L146 ILogger]: With dead ends: 87 [2019-05-23 09:22:30,660 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 09:22:30,661 INFO L146 ILogger]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:30,661 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 09:22:30,662 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-05-23 09:22:30,662 INFO L146 ILogger]: Start removeUnreachable. Operand 85 states. [2019-05-23 09:22:30,663 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-05-23 09:22:30,663 INFO L146 ILogger]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-05-23 09:22:30,663 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:30,663 INFO L146 ILogger]: Abstraction has 85 states and 85 transitions. [2019-05-23 09:22:30,663 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:22:30,663 INFO L146 ILogger]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-23 09:22:30,664 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 85 [2019-05-23 09:22:30,664 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:30,664 INFO L146 ILogger]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2019-05-23 09:22:30,664 INFO L146 ILogger]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:30,664 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:30,664 INFO L146 ILogger]: Analyzing trace with hash -1529079833, now seen corresponding path program 26 times [2019-05-23 09:22:30,665 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:30,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:30,679 WARN L146 ILogger]: Trace formula consists of 114 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 09:22:30,681 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:30,703 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 8 treesize of output 7 [2019-05-23 09:22:30,703 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:30,713 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:30,714 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:30,714 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:31,391 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:31,392 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:31,392 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:31,399 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:31,399 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,400 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:31,492 INFO L146 ILogger]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:31,492 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:31,492 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:22:31,492 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:31,493 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:31,493 INFO L146 ILogger]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:31,493 INFO L146 ILogger]: Start difference. First operand 85 states and 85 transitions. Second operand 33 states. [2019-05-23 09:22:33,286 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:33,286 INFO L146 ILogger]: Finished difference Result 90 states and 90 transitions. [2019-05-23 09:22:33,287 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:33,287 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 84 [2019-05-23 09:22:33,287 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:33,288 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:22:33,288 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:22:33,289 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:33,290 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:22:33,292 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-05-23 09:22:33,292 INFO L146 ILogger]: Start removeUnreachable. Operand 88 states. [2019-05-23 09:22:33,292 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-05-23 09:22:33,292 INFO L146 ILogger]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-05-23 09:22:33,293 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:33,293 INFO L146 ILogger]: Abstraction has 88 states and 88 transitions. [2019-05-23 09:22:33,293 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:33,293 INFO L146 ILogger]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-23 09:22:33,293 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 88 [2019-05-23 09:22:33,293 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:33,294 INFO L146 ILogger]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2019-05-23 09:22:33,294 INFO L146 ILogger]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:33,294 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:33,294 INFO L146 ILogger]: Analyzing trace with hash -394127745, now seen corresponding path program 27 times [2019-05-23 09:22:33,295 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:33,307 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:33,309 WARN L146 ILogger]: Trace formula consists of 118 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 09:22:33,311 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,337 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 8 treesize of output 7 [2019-05-23 09:22:33,338 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:33,339 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:33,339 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:33,339 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:34,043 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:34,043 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:34,044 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:34,050 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:34,050 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,051 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:34,110 INFO L146 ILogger]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:34,110 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:34,111 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:34,111 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:22:34,111 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:22:34,111 INFO L146 ILogger]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:34,112 INFO L146 ILogger]: Start difference. First operand 88 states and 88 transitions. Second operand 34 states. [2019-05-23 09:22:36,040 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:36,040 INFO L146 ILogger]: Finished difference Result 93 states and 93 transitions. [2019-05-23 09:22:36,041 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:22:36,041 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 87 [2019-05-23 09:22:36,041 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:36,042 INFO L146 ILogger]: With dead ends: 93 [2019-05-23 09:22:36,042 INFO L146 ILogger]: Without dead ends: 93 [2019-05-23 09:22:36,043 INFO L146 ILogger]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:36,043 INFO L146 ILogger]: Start minimizeSevpa. Operand 93 states. [2019-05-23 09:22:36,045 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-05-23 09:22:36,045 INFO L146 ILogger]: Start removeUnreachable. Operand 91 states. [2019-05-23 09:22:36,046 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-05-23 09:22:36,046 INFO L146 ILogger]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-05-23 09:22:36,046 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:36,046 INFO L146 ILogger]: Abstraction has 91 states and 91 transitions. [2019-05-23 09:22:36,046 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:22:36,047 INFO L146 ILogger]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-23 09:22:36,047 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 91 [2019-05-23 09:22:36,047 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:36,047 INFO L146 ILogger]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2019-05-23 09:22:36,047 INFO L146 ILogger]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:36,048 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:36,048 INFO L146 ILogger]: Analyzing trace with hash 980971751, now seen corresponding path program 28 times [2019-05-23 09:22:36,049 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:36,062 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:36,064 WARN L146 ILogger]: Trace formula consists of 122 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:22:36,066 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,089 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 8 treesize of output 7 [2019-05-23 09:22:36,089 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,091 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:36,091 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,091 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:36,887 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:36,888 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:36,889 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:36,893 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:36,894 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,894 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:36,956 INFO L146 ILogger]: Checked inductivity of 1218 backedges. 0 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:36,957 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:36,957 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:22:36,957 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:36,957 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:36,958 INFO L146 ILogger]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:36,958 INFO L146 ILogger]: Start difference. First operand 91 states and 91 transitions. Second operand 35 states. [2019-05-23 09:22:39,005 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:39,006 INFO L146 ILogger]: Finished difference Result 96 states and 96 transitions. [2019-05-23 09:22:39,006 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:22:39,007 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 90 [2019-05-23 09:22:39,007 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:39,007 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 09:22:39,008 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 09:22:39,009 INFO L146 ILogger]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:39,009 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 09:22:39,010 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-05-23 09:22:39,011 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:22:39,011 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-05-23 09:22:39,011 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-05-23 09:22:39,011 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:39,012 INFO L146 ILogger]: Abstraction has 94 states and 94 transitions. [2019-05-23 09:22:39,012 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:39,012 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-23 09:22:39,012 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 09:22:39,012 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:39,012 INFO L146 ILogger]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2019-05-23 09:22:39,013 INFO L146 ILogger]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:39,013 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:39,013 INFO L146 ILogger]: Analyzing trace with hash 1171987839, now seen corresponding path program 29 times [2019-05-23 09:22:39,014 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:39,026 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:39,028 WARN L146 ILogger]: Trace formula consists of 126 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 09:22:39,030 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:39,071 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 8 treesize of output 7 [2019-05-23 09:22:39,072 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:39,084 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:39,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:39,085 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:39,813 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:39,813 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:39,814 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:39,818 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:39,818 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:39,819 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:39,883 INFO L146 ILogger]: Checked inductivity of 1305 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:39,883 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:39,883 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:39,883 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:22:39,884 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:22:39,884 INFO L146 ILogger]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:39,884 INFO L146 ILogger]: Start difference. First operand 94 states and 94 transitions. Second operand 36 states. [2019-05-23 09:22:42,224 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:42,224 INFO L146 ILogger]: Finished difference Result 99 states and 99 transitions. [2019-05-23 09:22:42,225 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:42,225 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 93 [2019-05-23 09:22:42,225 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:42,226 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:22:42,226 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:22:42,227 INFO L146 ILogger]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:42,227 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:22:42,229 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-05-23 09:22:42,229 INFO L146 ILogger]: Start removeUnreachable. Operand 97 states. [2019-05-23 09:22:42,230 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-05-23 09:22:42,230 INFO L146 ILogger]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-05-23 09:22:42,230 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:42,230 INFO L146 ILogger]: Abstraction has 97 states and 97 transitions. [2019-05-23 09:22:42,230 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:22:42,230 INFO L146 ILogger]: Start isEmpty. Operand 97 states and 97 transitions. [2019-05-23 09:22:42,231 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 97 [2019-05-23 09:22:42,231 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:42,231 INFO L146 ILogger]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2019-05-23 09:22:42,231 INFO L146 ILogger]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:42,232 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:42,232 INFO L146 ILogger]: Analyzing trace with hash 900598247, now seen corresponding path program 30 times [2019-05-23 09:22:42,232 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:42,246 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:42,248 WARN L146 ILogger]: Trace formula consists of 130 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 09:22:42,250 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,302 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 8 treesize of output 7 [2019-05-23 09:22:42,302 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:42,325 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:42,326 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,326 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:43,765 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:43,765 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:43,766 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:43,770 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:43,771 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:43,771 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:43,835 INFO L146 ILogger]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:43,835 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:43,835 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:22:43,835 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:43,836 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:43,836 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:43,836 INFO L146 ILogger]: Start difference. First operand 97 states and 97 transitions. Second operand 37 states. [2019-05-23 09:22:46,132 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:46,132 INFO L146 ILogger]: Finished difference Result 102 states and 102 transitions. [2019-05-23 09:22:46,132 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:22:46,133 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 96 [2019-05-23 09:22:46,133 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:46,134 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 09:22:46,134 INFO L146 ILogger]: Without dead ends: 102 [2019-05-23 09:22:46,135 INFO L146 ILogger]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:46,135 INFO L146 ILogger]: Start minimizeSevpa. Operand 102 states. [2019-05-23 09:22:46,137 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-05-23 09:22:46,137 INFO L146 ILogger]: Start removeUnreachable. Operand 100 states. [2019-05-23 09:22:46,138 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-05-23 09:22:46,138 INFO L146 ILogger]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-05-23 09:22:46,138 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:46,138 INFO L146 ILogger]: Abstraction has 100 states and 100 transitions. [2019-05-23 09:22:46,138 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:46,138 INFO L146 ILogger]: Start isEmpty. Operand 100 states and 100 transitions. [2019-05-23 09:22:46,139 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 100 [2019-05-23 09:22:46,139 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:46,139 INFO L146 ILogger]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2019-05-23 09:22:46,139 INFO L146 ILogger]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:46,140 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:46,140 INFO L146 ILogger]: Analyzing trace with hash -938285953, now seen corresponding path program 31 times [2019-05-23 09:22:46,140 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:46,154 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:46,157 WARN L146 ILogger]: Trace formula consists of 134 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:22:46,158 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:46,194 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 8 treesize of output 7 [2019-05-23 09:22:46,195 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:46,205 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:46,205 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:46,205 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:48,611 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:48,612 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:48,612 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:48,616 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:48,617 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:48,617 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:48,694 INFO L146 ILogger]: Checked inductivity of 1488 backedges. 0 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:48,694 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:48,694 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:48,695 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:22:48,695 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:22:48,695 INFO L146 ILogger]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:48,695 INFO L146 ILogger]: Start difference. First operand 100 states and 100 transitions. Second operand 38 states. [2019-05-23 09:22:51,123 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:51,123 INFO L146 ILogger]: Finished difference Result 105 states and 105 transitions. [2019-05-23 09:22:51,123 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:22:51,124 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 99 [2019-05-23 09:22:51,124 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:51,125 INFO L146 ILogger]: With dead ends: 105 [2019-05-23 09:22:51,125 INFO L146 ILogger]: Without dead ends: 105 [2019-05-23 09:22:51,126 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:51,127 INFO L146 ILogger]: Start minimizeSevpa. Operand 105 states. [2019-05-23 09:22:51,129 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-05-23 09:22:51,129 INFO L146 ILogger]: Start removeUnreachable. Operand 103 states. [2019-05-23 09:22:51,129 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-05-23 09:22:51,129 INFO L146 ILogger]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-05-23 09:22:51,130 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:51,130 INFO L146 ILogger]: Abstraction has 103 states and 103 transitions. [2019-05-23 09:22:51,130 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:22:51,130 INFO L146 ILogger]: Start isEmpty. Operand 103 states and 103 transitions. [2019-05-23 09:22:51,131 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 103 [2019-05-23 09:22:51,131 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:51,131 INFO L146 ILogger]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2019-05-23 09:22:51,131 INFO L146 ILogger]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:51,131 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:51,131 INFO L146 ILogger]: Analyzing trace with hash -829627673, now seen corresponding path program 32 times [2019-05-23 09:22:51,132 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:51,146 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:51,148 WARN L146 ILogger]: Trace formula consists of 138 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 09:22:51,150 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:51,186 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 8 treesize of output 7 [2019-05-23 09:22:51,187 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:51,192 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:51,192 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,192 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:52,221 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:52,222 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:52,222 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:52,226 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:52,226 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:52,227 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:52,297 INFO L146 ILogger]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:52,297 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:52,297 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:22:52,298 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:52,298 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:52,298 INFO L146 ILogger]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:52,299 INFO L146 ILogger]: Start difference. First operand 103 states and 103 transitions. Second operand 39 states. [2019-05-23 09:22:54,869 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:54,870 INFO L146 ILogger]: Finished difference Result 108 states and 108 transitions. [2019-05-23 09:22:54,870 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:54,870 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 102 [2019-05-23 09:22:54,871 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:54,871 INFO L146 ILogger]: With dead ends: 108 [2019-05-23 09:22:54,872 INFO L146 ILogger]: Without dead ends: 108 [2019-05-23 09:22:54,873 INFO L146 ILogger]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:54,873 INFO L146 ILogger]: Start minimizeSevpa. Operand 108 states. [2019-05-23 09:22:54,875 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-05-23 09:22:54,876 INFO L146 ILogger]: Start removeUnreachable. Operand 106 states. [2019-05-23 09:22:54,876 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-05-23 09:22:54,876 INFO L146 ILogger]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-05-23 09:22:54,877 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:54,877 INFO L146 ILogger]: Abstraction has 106 states and 106 transitions. [2019-05-23 09:22:54,877 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:54,877 INFO L146 ILogger]: Start isEmpty. Operand 106 states and 106 transitions. [2019-05-23 09:22:54,877 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 106 [2019-05-23 09:22:54,877 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:54,878 INFO L146 ILogger]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2019-05-23 09:22:54,878 INFO L146 ILogger]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:54,878 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:54,878 INFO L146 ILogger]: Analyzing trace with hash 2098817919, now seen corresponding path program 33 times [2019-05-23 09:22:54,879 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:54,893 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:54,895 WARN L146 ILogger]: Trace formula consists of 142 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 09:22:54,897 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,929 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 8 treesize of output 7 [2019-05-23 09:22:54,930 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:54,948 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:54,948 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:54,948 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:55,695 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:55,696 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:55,696 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:55,701 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:55,701 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,702 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:55,773 INFO L146 ILogger]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:55,774 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:55,774 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:55,774 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:22:55,774 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:22:55,775 INFO L146 ILogger]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:55,775 INFO L146 ILogger]: Start difference. First operand 106 states and 106 transitions. Second operand 40 states. [2019-05-23 09:22:58,693 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:58,694 INFO L146 ILogger]: Finished difference Result 111 states and 111 transitions. [2019-05-23 09:22:58,694 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:22:58,694 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 105 [2019-05-23 09:22:58,695 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:58,696 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:22:58,696 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:22:58,697 INFO L146 ILogger]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=1596, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:58,697 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:22:58,699 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-05-23 09:22:58,699 INFO L146 ILogger]: Start removeUnreachable. Operand 109 states. [2019-05-23 09:22:58,699 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-05-23 09:22:58,700 INFO L146 ILogger]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-05-23 09:22:58,700 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:58,700 INFO L146 ILogger]: Abstraction has 109 states and 109 transitions. [2019-05-23 09:22:58,700 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:22:58,700 INFO L146 ILogger]: Start isEmpty. Operand 109 states and 109 transitions. [2019-05-23 09:22:58,700 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 109 [2019-05-23 09:22:58,700 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:58,701 INFO L146 ILogger]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2019-05-23 09:22:58,701 INFO L146 ILogger]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:58,701 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:58,701 INFO L146 ILogger]: Analyzing trace with hash -249234457, now seen corresponding path program 34 times [2019-05-23 09:22:58,702 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:58,714 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:58,717 WARN L146 ILogger]: Trace formula consists of 146 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:22:58,719 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:58,764 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 8 treesize of output 7 [2019-05-23 09:22:58,765 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:22:58,786 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22: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:22:58,787 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:22:59,643 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:59,644 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:22:59,645 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:59,649 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:22:59,649 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:22:59,650 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:22:59,800 INFO L146 ILogger]: Checked inductivity of 1785 backedges. 0 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:59,800 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:59,801 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:22:59,801 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:59,801 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:59,801 INFO L146 ILogger]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:59,802 INFO L146 ILogger]: Start difference. First operand 109 states and 109 transitions. Second operand 41 states. [2019-05-23 09:23:02,844 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:02,845 INFO L146 ILogger]: Finished difference Result 114 states and 114 transitions. [2019-05-23 09:23:02,845 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:23:02,845 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 108 [2019-05-23 09:23:02,846 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:02,846 INFO L146 ILogger]: With dead ends: 114 [2019-05-23 09:23:02,847 INFO L146 ILogger]: Without dead ends: 114 [2019-05-23 09:23:02,848 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:23:02,848 INFO L146 ILogger]: Start minimizeSevpa. Operand 114 states. [2019-05-23 09:23:02,850 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-05-23 09:23:02,850 INFO L146 ILogger]: Start removeUnreachable. Operand 112 states. [2019-05-23 09:23:02,851 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-05-23 09:23:02,851 INFO L146 ILogger]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-05-23 09:23:02,851 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:02,851 INFO L146 ILogger]: Abstraction has 112 states and 112 transitions. [2019-05-23 09:23:02,852 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:23:02,852 INFO L146 ILogger]: Start isEmpty. Operand 112 states and 112 transitions. [2019-05-23 09:23:02,852 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 112 [2019-05-23 09:23:02,852 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:02,852 INFO L146 ILogger]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2019-05-23 09:23:02,853 INFO L146 ILogger]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:02,853 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:02,853 INFO L146 ILogger]: Analyzing trace with hash 1054782079, now seen corresponding path program 35 times [2019-05-23 09:23:02,854 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:02,868 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:02,871 WARN L146 ILogger]: Trace formula consists of 150 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 09:23:02,873 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:02,901 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 8 treesize of output 7 [2019-05-23 09:23:02,902 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:02,905 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:02,905 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:02,905 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:03,776 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:03,776 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:03,777 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:03,783 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:03,783 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:03,783 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:03,858 INFO L146 ILogger]: Checked inductivity of 1890 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:03,858 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:03,859 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:23:03,859 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:23:03,859 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:23:03,860 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:23:03,860 INFO L146 ILogger]: Start difference. First operand 112 states and 112 transitions. Second operand 42 states. [2019-05-23 09:23:06,911 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:06,911 INFO L146 ILogger]: Finished difference Result 117 states and 117 transitions. [2019-05-23 09:23:06,911 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:23:06,912 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 111 [2019-05-23 09:23:06,913 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:06,913 INFO L146 ILogger]: With dead ends: 117 [2019-05-23 09:23:06,914 INFO L146 ILogger]: Without dead ends: 117 [2019-05-23 09:23:06,915 INFO L146 ILogger]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:23:06,915 INFO L146 ILogger]: Start minimizeSevpa. Operand 117 states. [2019-05-23 09:23:06,917 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-05-23 09:23:06,917 INFO L146 ILogger]: Start removeUnreachable. Operand 115 states. [2019-05-23 09:23:06,917 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-05-23 09:23:06,917 INFO L146 ILogger]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-05-23 09:23:06,918 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:06,918 INFO L146 ILogger]: Abstraction has 115 states and 115 transitions. [2019-05-23 09:23:06,918 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:23:06,918 INFO L146 ILogger]: Start isEmpty. Operand 115 states and 115 transitions. [2019-05-23 09:23:06,918 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 115 [2019-05-23 09:23:06,919 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:06,919 INFO L146 ILogger]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2019-05-23 09:23:06,919 INFO L146 ILogger]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:06,919 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:06,919 INFO L146 ILogger]: Analyzing trace with hash 1032213735, now seen corresponding path program 36 times [2019-05-23 09:23:06,920 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:06,934 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:06,937 WARN L146 ILogger]: Trace formula consists of 154 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 09:23:06,939 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:06,972 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 8 treesize of output 7 [2019-05-23 09:23:06,972 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:06,974 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:06,974 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:06,974 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:08,081 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:08,082 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:08,082 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:08,087 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:08,087 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:08,088 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:08,178 INFO L146 ILogger]: Checked inductivity of 1998 backedges. 0 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:08,179 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:08,179 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:23:08,179 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:23:08,179 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:23:08,180 INFO L146 ILogger]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:23:08,180 INFO L146 ILogger]: Start difference. First operand 115 states and 115 transitions. Second operand 43 states. [2019-05-23 09:23:11,371 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:11,372 INFO L146 ILogger]: Finished difference Result 120 states and 120 transitions. [2019-05-23 09:23:11,372 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:23:11,372 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 114 [2019-05-23 09:23:11,373 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:11,373 INFO L146 ILogger]: With dead ends: 120 [2019-05-23 09:23:11,374 INFO L146 ILogger]: Without dead ends: 120 [2019-05-23 09:23:11,375 INFO L146 ILogger]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=1845, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:23:11,375 INFO L146 ILogger]: Start minimizeSevpa. Operand 120 states. [2019-05-23 09:23:11,377 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-05-23 09:23:11,377 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 09:23:11,378 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-05-23 09:23:11,378 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-05-23 09:23:11,378 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:11,378 INFO L146 ILogger]: Abstraction has 118 states and 118 transitions. [2019-05-23 09:23:11,378 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:23:11,378 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 118 transitions. [2019-05-23 09:23:11,379 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 09:23:11,379 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:11,379 INFO L146 ILogger]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2019-05-23 09:23:11,379 INFO L146 ILogger]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:11,379 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:11,380 INFO L146 ILogger]: Analyzing trace with hash -1286424193, now seen corresponding path program 37 times [2019-05-23 09:23:11,380 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:11,395 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:11,398 WARN L146 ILogger]: Trace formula consists of 158 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:23:11,400 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:11,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 8 treesize of output 7 [2019-05-23 09:23:11,429 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:11,431 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:11,431 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:11,431 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:12,668 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:12,669 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:12,670 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:12,674 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:12,674 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:12,674 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:12,753 INFO L146 ILogger]: Checked inductivity of 2109 backedges. 0 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:12,754 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:12,754 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:23:12,754 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:23:12,754 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:23:12,755 INFO L146 ILogger]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:23:12,755 INFO L146 ILogger]: Start difference. First operand 118 states and 118 transitions. Second operand 44 states. [2019-05-23 09:23:16,125 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:16,126 INFO L146 ILogger]: Finished difference Result 123 states and 123 transitions. [2019-05-23 09:23:16,126 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:23:16,126 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 117 [2019-05-23 09:23:16,127 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:16,128 INFO L146 ILogger]: With dead ends: 123 [2019-05-23 09:23:16,128 INFO L146 ILogger]: Without dead ends: 123 [2019-05-23 09:23:16,129 INFO L146 ILogger]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=1932, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:23:16,129 INFO L146 ILogger]: Start minimizeSevpa. Operand 123 states. [2019-05-23 09:23:16,131 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-05-23 09:23:16,131 INFO L146 ILogger]: Start removeUnreachable. Operand 121 states. [2019-05-23 09:23:16,132 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-05-23 09:23:16,132 INFO L146 ILogger]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-05-23 09:23:16,132 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:16,133 INFO L146 ILogger]: Abstraction has 121 states and 121 transitions. [2019-05-23 09:23:16,133 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:23:16,133 INFO L146 ILogger]: Start isEmpty. Operand 121 states and 121 transitions. [2019-05-23 09:23:16,133 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 121 [2019-05-23 09:23:16,133 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:16,134 INFO L146 ILogger]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2019-05-23 09:23:16,134 INFO L146 ILogger]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:16,134 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:16,134 INFO L146 ILogger]: Analyzing trace with hash 130084327, now seen corresponding path program 38 times [2019-05-23 09:23:16,135 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:16,150 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:16,153 WARN L146 ILogger]: Trace formula consists of 162 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 09:23:16,155 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,170 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 8 treesize of output 7 [2019-05-23 09:23:16,171 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:16,173 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:16,173 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,174 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:17,497 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:17,498 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:17,498 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:17,506 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:17,506 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:17,507 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:17,595 INFO L146 ILogger]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:17,595 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:17,596 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:23:17,596 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:23:17,596 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:23:17,597 INFO L146 ILogger]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:23:17,597 INFO L146 ILogger]: Start difference. First operand 121 states and 121 transitions. Second operand 45 states. [2019-05-23 09:23:21,122 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:21,122 INFO L146 ILogger]: Finished difference Result 126 states and 126 transitions. [2019-05-23 09:23:21,122 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:23:21,123 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 120 [2019-05-23 09:23:21,123 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:21,124 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 09:23:21,124 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 09:23:21,124 INFO L146 ILogger]: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=2021, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:23:21,125 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 09:23:21,127 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-05-23 09:23:21,127 INFO L146 ILogger]: Start removeUnreachable. Operand 124 states. [2019-05-23 09:23:21,128 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-05-23 09:23:21,128 INFO L146 ILogger]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-05-23 09:23:21,128 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:21,128 INFO L146 ILogger]: Abstraction has 124 states and 124 transitions. [2019-05-23 09:23:21,128 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:23:21,128 INFO L146 ILogger]: Start isEmpty. Operand 124 states and 124 transitions. [2019-05-23 09:23:21,129 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 124 [2019-05-23 09:23:21,129 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:21,129 INFO L146 ILogger]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2019-05-23 09:23:21,129 INFO L146 ILogger]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:21,129 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:21,129 INFO L146 ILogger]: Analyzing trace with hash 1281720447, now seen corresponding path program 39 times [2019-05-23 09:23:21,130 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:21,142 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:21,145 WARN L146 ILogger]: Trace formula consists of 166 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 09:23:21,147 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:21,192 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 8 treesize of output 7 [2019-05-23 09:23:21,193 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:21,216 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:21,217 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:21,217 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:22,250 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:22,250 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:22,251 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:22,256 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:22,256 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:22,256 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:22,438 INFO L146 ILogger]: Checked inductivity of 2340 backedges. 0 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:22,438 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:22,438 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:23:22,438 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:23:22,438 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:23:22,439 INFO L146 ILogger]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:23:22,439 INFO L146 ILogger]: Start difference. First operand 124 states and 124 transitions. Second operand 46 states. [2019-05-23 09:23:26,233 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:26,233 INFO L146 ILogger]: Finished difference Result 129 states and 129 transitions. [2019-05-23 09:23:26,233 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:23:26,234 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 123 [2019-05-23 09:23:26,234 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:26,235 INFO L146 ILogger]: With dead ends: 129 [2019-05-23 09:23:26,235 INFO L146 ILogger]: Without dead ends: 129 [2019-05-23 09:23:26,236 INFO L146 ILogger]: 0 DeclaredPredicates, 124 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=2112, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:23:26,236 INFO L146 ILogger]: Start minimizeSevpa. Operand 129 states. [2019-05-23 09:23:26,238 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-05-23 09:23:26,238 INFO L146 ILogger]: Start removeUnreachable. Operand 127 states. [2019-05-23 09:23:26,239 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-05-23 09:23:26,239 INFO L146 ILogger]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-05-23 09:23:26,239 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:26,239 INFO L146 ILogger]: Abstraction has 127 states and 127 transitions. [2019-05-23 09:23:26,239 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:23:26,239 INFO L146 ILogger]: Start isEmpty. Operand 127 states and 127 transitions. [2019-05-23 09:23:26,240 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 127 [2019-05-23 09:23:26,240 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:26,240 INFO L146 ILogger]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2019-05-23 09:23:26,241 INFO L146 ILogger]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:26,241 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:26,241 INFO L146 ILogger]: Analyzing trace with hash 1474610919, now seen corresponding path program 40 times [2019-05-23 09:23:26,241 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:26,258 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:26,261 WARN L146 ILogger]: Trace formula consists of 170 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:23:26,263 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:26,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 8 treesize of output 7 [2019-05-23 09:23:26,274 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:26,276 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:26,276 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:26,276 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:27,346 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:27,347 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:27,348 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:27,352 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:27,352 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:27,352 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:27,470 INFO L146 ILogger]: Checked inductivity of 2460 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:27,471 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:27,471 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:23:27,471 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:23:27,471 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:23:27,472 INFO L146 ILogger]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:23:27,472 INFO L146 ILogger]: Start difference. First operand 127 states and 127 transitions. Second operand 47 states. [2019-05-23 09:23:32,056 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:32,056 INFO L146 ILogger]: Finished difference Result 132 states and 132 transitions. [2019-05-23 09:23:32,057 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:23:32,057 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 126 [2019-05-23 09:23:32,057 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:32,060 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 09:23:32,060 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 09:23:32,061 INFO L146 ILogger]: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=2205, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:23:32,061 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 09:23:32,063 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-05-23 09:23:32,063 INFO L146 ILogger]: Start removeUnreachable. Operand 130 states. [2019-05-23 09:23:32,063 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-05-23 09:23:32,064 INFO L146 ILogger]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-05-23 09:23:32,064 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:32,064 INFO L146 ILogger]: Abstraction has 130 states and 130 transitions. [2019-05-23 09:23:32,064 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:23:32,064 INFO L146 ILogger]: Start isEmpty. Operand 130 states and 130 transitions. [2019-05-23 09:23:32,065 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 130 [2019-05-23 09:23:32,065 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:32,065 INFO L146 ILogger]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2019-05-23 09:23:32,065 INFO L146 ILogger]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:32,066 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:32,066 INFO L146 ILogger]: Analyzing trace with hash 1208420223, now seen corresponding path program 41 times [2019-05-23 09:23:32,066 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:32,083 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:32,087 WARN L146 ILogger]: Trace formula consists of 174 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 09:23:32,089 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:32,127 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 8 treesize of output 7 [2019-05-23 09:23:32,128 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:32,150 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:32,150 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:32,150 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:33,632 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:33,633 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:33,634 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:33,638 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:33,639 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,639 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:33,732 INFO L146 ILogger]: Checked inductivity of 2583 backedges. 0 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:33,733 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:33,733 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:23:33,733 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:23:33,733 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:23:33,733 INFO L146 ILogger]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:23:33,734 INFO L146 ILogger]: Start difference. First operand 130 states and 130 transitions. Second operand 48 states. [2019-05-23 09:23:37,942 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:37,943 INFO L146 ILogger]: Finished difference Result 135 states and 135 transitions. [2019-05-23 09:23:37,943 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:23:37,943 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 129 [2019-05-23 09:23:37,943 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:37,944 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 09:23:37,944 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 09:23:37,944 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:23:37,944 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 09:23:37,946 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-05-23 09:23:37,946 INFO L146 ILogger]: Start removeUnreachable. Operand 133 states. [2019-05-23 09:23:37,946 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-05-23 09:23:37,946 INFO L146 ILogger]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-05-23 09:23:37,946 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:37,947 INFO L146 ILogger]: Abstraction has 133 states and 133 transitions. [2019-05-23 09:23:37,947 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:23:37,947 INFO L146 ILogger]: Start isEmpty. Operand 133 states and 133 transitions. [2019-05-23 09:23:37,947 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 133 [2019-05-23 09:23:37,947 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:37,947 INFO L146 ILogger]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2019-05-23 09:23:37,948 INFO L146 ILogger]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:37,948 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:37,948 INFO L146 ILogger]: Analyzing trace with hash -368975897, now seen corresponding path program 42 times [2019-05-23 09:23:37,948 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:37,965 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:37,968 WARN L146 ILogger]: Trace formula consists of 178 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 09:23:37,970 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:38,006 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 8 treesize of output 7 [2019-05-23 09:23:38,007 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:38,036 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:38,036 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:38,037 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:39,189 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:39,189 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:39,190 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:39,200 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:39,200 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:39,201 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:39,295 INFO L146 ILogger]: Checked inductivity of 2709 backedges. 0 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:39,295 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:39,295 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:23:39,296 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:23:39,296 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:23:39,296 INFO L146 ILogger]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:23:39,296 INFO L146 ILogger]: Start difference. First operand 133 states and 133 transitions. Second operand 49 states. [2019-05-23 09:23:43,568 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:43,568 INFO L146 ILogger]: Finished difference Result 138 states and 138 transitions. [2019-05-23 09:23:43,569 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:23:43,569 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 132 [2019-05-23 09:23:43,569 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:43,570 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 09:23:43,570 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 09:23:43,571 INFO L146 ILogger]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=2397, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:23:43,571 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 09:23:43,574 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-05-23 09:23:43,574 INFO L146 ILogger]: Start removeUnreachable. Operand 136 states. [2019-05-23 09:23:43,574 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-05-23 09:23:43,574 INFO L146 ILogger]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-05-23 09:23:43,575 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:43,575 INFO L146 ILogger]: Abstraction has 136 states and 136 transitions. [2019-05-23 09:23:43,575 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:23:43,575 INFO L146 ILogger]: Start isEmpty. Operand 136 states and 136 transitions. [2019-05-23 09:23:43,576 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 136 [2019-05-23 09:23:43,576 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:43,576 INFO L146 ILogger]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2019-05-23 09:23:43,576 INFO L146 ILogger]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:43,576 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:43,577 INFO L146 ILogger]: Analyzing trace with hash -1339601281, now seen corresponding path program 43 times [2019-05-23 09:23:43,577 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:43,596 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:43,599 WARN L146 ILogger]: Trace formula consists of 182 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:23:43,602 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:43,639 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 8 treesize of output 7 [2019-05-23 09:23:43,639 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:43,662 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:43,663 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:43,663 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:45,172 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:45,173 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:45,173 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:45,178 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:45,178 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,179 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:45,277 INFO L146 ILogger]: Checked inductivity of 2838 backedges. 0 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:45,277 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:45,277 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:23:45,278 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:23:45,278 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:23:45,278 INFO L146 ILogger]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:23:45,278 INFO L146 ILogger]: Start difference. First operand 136 states and 136 transitions. Second operand 50 states. [2019-05-23 09:23:49,874 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:49,874 INFO L146 ILogger]: Finished difference Result 141 states and 141 transitions. [2019-05-23 09:23:49,875 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:23:49,875 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 135 [2019-05-23 09:23:49,875 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:49,876 INFO L146 ILogger]: With dead ends: 141 [2019-05-23 09:23:49,876 INFO L146 ILogger]: Without dead ends: 141 [2019-05-23 09:23:49,877 INFO L146 ILogger]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=156, Invalid=2496, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:23:49,877 INFO L146 ILogger]: Start minimizeSevpa. Operand 141 states. [2019-05-23 09:23:49,879 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-05-23 09:23:49,879 INFO L146 ILogger]: Start removeUnreachable. Operand 139 states. [2019-05-23 09:23:49,880 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-05-23 09:23:49,880 INFO L146 ILogger]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-05-23 09:23:49,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:49,880 INFO L146 ILogger]: Abstraction has 139 states and 139 transitions. [2019-05-23 09:23:49,880 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:23:49,881 INFO L146 ILogger]: Start isEmpty. Operand 139 states and 139 transitions. [2019-05-23 09:23:49,881 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 139 [2019-05-23 09:23:49,881 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:49,881 INFO L146 ILogger]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2019-05-23 09:23:49,882 INFO L146 ILogger]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:49,882 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:49,882 INFO L146 ILogger]: Analyzing trace with hash 774387943, now seen corresponding path program 44 times [2019-05-23 09:23:49,883 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:49,900 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:49,904 WARN L146 ILogger]: Trace formula consists of 186 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 09:23:49,906 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:49,945 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 8 treesize of output 7 [2019-05-23 09:23:49,946 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:49,968 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:49,969 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,969 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:51,199 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:51,199 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:51,200 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:51,205 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:51,205 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:51,205 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:51,305 INFO L146 ILogger]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:51,305 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:51,305 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:23:51,305 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:23:51,306 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:23:51,306 INFO L146 ILogger]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:23:51,306 INFO L146 ILogger]: Start difference. First operand 139 states and 139 transitions. Second operand 51 states. [2019-05-23 09:23:56,022 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:56,022 INFO L146 ILogger]: Finished difference Result 144 states and 144 transitions. [2019-05-23 09:23:56,023 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:23:56,023 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 138 [2019-05-23 09:23:56,023 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:56,024 INFO L146 ILogger]: With dead ends: 144 [2019-05-23 09:23:56,024 INFO L146 ILogger]: Without dead ends: 144 [2019-05-23 09:23:56,025 INFO L146 ILogger]: 0 DeclaredPredicates, 139 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=159, Invalid=2597, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:23:56,025 INFO L146 ILogger]: Start minimizeSevpa. Operand 144 states. [2019-05-23 09:23:56,027 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-05-23 09:23:56,028 INFO L146 ILogger]: Start removeUnreachable. Operand 142 states. [2019-05-23 09:23:56,028 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-05-23 09:23:56,028 INFO L146 ILogger]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-05-23 09:23:56,029 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:56,029 INFO L146 ILogger]: Abstraction has 142 states and 142 transitions. [2019-05-23 09:23:56,029 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:23:56,029 INFO L146 ILogger]: Start isEmpty. Operand 142 states and 142 transitions. [2019-05-23 09:23:56,030 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 09:23:56,030 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:56,030 INFO L146 ILogger]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2019-05-23 09:23:56,030 INFO L146 ILogger]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:56,030 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:56,030 INFO L146 ILogger]: Analyzing trace with hash 1521898879, now seen corresponding path program 45 times [2019-05-23 09:23:56,031 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:56,049 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:56,053 WARN L146 ILogger]: Trace formula consists of 190 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 09:23:56,055 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:56,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 8 treesize of output 7 [2019-05-23 09:23:56,094 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:23:56,117 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:56,118 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:56,118 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:23:57,390 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:57,391 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:23:57,391 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:57,396 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:23:57,396 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:23:57,396 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:23:57,495 INFO L146 ILogger]: Checked inductivity of 3105 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:57,496 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:57,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:23:57,496 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:23:57,496 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:23:57,496 INFO L146 ILogger]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:23:57,497 INFO L146 ILogger]: Start difference. First operand 142 states and 142 transitions. Second operand 52 states. [2019-05-23 09:24:02,374 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:02,375 INFO L146 ILogger]: Finished difference Result 147 states and 147 transitions. [2019-05-23 09:24:02,375 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:24:02,375 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 141 [2019-05-23 09:24:02,376 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:02,376 INFO L146 ILogger]: With dead ends: 147 [2019-05-23 09:24:02,376 INFO L146 ILogger]: Without dead ends: 147 [2019-05-23 09:24:02,377 INFO L146 ILogger]: 0 DeclaredPredicates, 142 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=2700, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:24:02,377 INFO L146 ILogger]: Start minimizeSevpa. Operand 147 states. [2019-05-23 09:24:02,379 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-05-23 09:24:02,380 INFO L146 ILogger]: Start removeUnreachable. Operand 145 states. [2019-05-23 09:24:02,380 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-05-23 09:24:02,380 INFO L146 ILogger]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-05-23 09:24:02,380 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:02,381 INFO L146 ILogger]: Abstraction has 145 states and 145 transitions. [2019-05-23 09:24:02,381 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:24:02,381 INFO L146 ILogger]: Start isEmpty. Operand 145 states and 145 transitions. [2019-05-23 09:24:02,381 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 145 [2019-05-23 09:24:02,381 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:02,382 INFO L146 ILogger]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2019-05-23 09:24:02,382 INFO L146 ILogger]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:02,382 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:02,382 INFO L146 ILogger]: Analyzing trace with hash 1214763495, now seen corresponding path program 46 times [2019-05-23 09:24:02,383 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:02,401 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:02,405 WARN L146 ILogger]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:24:02,407 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:02,424 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 8 treesize of output 7 [2019-05-23 09:24:02,424 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:02,428 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:02,428 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:02,428 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:03,955 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:03,955 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:03,956 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:03,961 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:03,961 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,961 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:04,067 INFO L146 ILogger]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:04,068 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:04,068 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:24:04,069 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:24:04,069 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:24:04,069 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:24:04,069 INFO L146 ILogger]: Start difference. First operand 145 states and 145 transitions. Second operand 53 states. [2019-05-23 09:24:09,296 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:09,297 INFO L146 ILogger]: Finished difference Result 150 states and 150 transitions. [2019-05-23 09:24:09,297 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:24:09,297 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 144 [2019-05-23 09:24:09,298 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:09,299 INFO L146 ILogger]: With dead ends: 150 [2019-05-23 09:24:09,299 INFO L146 ILogger]: Without dead ends: 150 [2019-05-23 09:24:09,299 INFO L146 ILogger]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=165, Invalid=2805, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:24:09,300 INFO L146 ILogger]: Start minimizeSevpa. Operand 150 states. [2019-05-23 09:24:09,302 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-05-23 09:24:09,302 INFO L146 ILogger]: Start removeUnreachable. Operand 148 states. [2019-05-23 09:24:09,303 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-05-23 09:24:09,303 INFO L146 ILogger]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-05-23 09:24:09,303 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:09,303 INFO L146 ILogger]: Abstraction has 148 states and 148 transitions. [2019-05-23 09:24:09,303 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:24:09,304 INFO L146 ILogger]: Start isEmpty. Operand 148 states and 148 transitions. [2019-05-23 09:24:09,304 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 148 [2019-05-23 09:24:09,304 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:09,304 INFO L146 ILogger]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2019-05-23 09:24:09,305 INFO L146 ILogger]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:09,305 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:09,305 INFO L146 ILogger]: Analyzing trace with hash -375120769, now seen corresponding path program 47 times [2019-05-23 09:24:09,306 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:09,331 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:09,336 WARN L146 ILogger]: Trace formula consists of 198 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 09:24:09,338 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:09,379 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 8 treesize of output 7 [2019-05-23 09:24:09,380 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:09,402 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:09,403 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:09,403 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:10,760 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:10,761 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:10,761 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:10,765 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:10,765 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:10,766 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:10,878 INFO L146 ILogger]: Checked inductivity of 3384 backedges. 0 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:10,878 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:10,878 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:24:10,878 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:24:10,879 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:24:10,879 INFO L146 ILogger]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:24:10,879 INFO L146 ILogger]: Start difference. First operand 148 states and 148 transitions. Second operand 54 states. [2019-05-23 09:24:16,247 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:16,247 INFO L146 ILogger]: Finished difference Result 153 states and 153 transitions. [2019-05-23 09:24:16,248 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:24:16,248 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 147 [2019-05-23 09:24:16,249 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:16,250 INFO L146 ILogger]: With dead ends: 153 [2019-05-23 09:24:16,250 INFO L146 ILogger]: Without dead ends: 153 [2019-05-23 09:24:16,251 INFO L146 ILogger]: 0 DeclaredPredicates, 148 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=2912, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:24:16,251 INFO L146 ILogger]: Start minimizeSevpa. Operand 153 states. [2019-05-23 09:24:16,253 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-05-23 09:24:16,253 INFO L146 ILogger]: Start removeUnreachable. Operand 151 states. [2019-05-23 09:24:16,254 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-05-23 09:24:16,254 INFO L146 ILogger]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-05-23 09:24:16,254 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:16,254 INFO L146 ILogger]: Abstraction has 151 states and 151 transitions. [2019-05-23 09:24:16,254 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:24:16,254 INFO L146 ILogger]: Start isEmpty. Operand 151 states and 151 transitions. [2019-05-23 09:24:16,255 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 151 [2019-05-23 09:24:16,255 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:16,255 INFO L146 ILogger]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2019-05-23 09:24:16,256 INFO L146 ILogger]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:16,256 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:16,256 INFO L146 ILogger]: Analyzing trace with hash 282110695, now seen corresponding path program 48 times [2019-05-23 09:24:16,257 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:16,278 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:16,283 WARN L146 ILogger]: Trace formula consists of 202 conjuncts, 103 conjunts are in the unsatisfiable core [2019-05-23 09:24:16,285 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:16,313 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 8 treesize of output 7 [2019-05-23 09:24:16,314 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:16,337 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:16,337 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:16,337 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:18,739 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:18,740 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:18,740 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:18,747 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:18,747 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:18,747 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:18,965 INFO L146 ILogger]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:18,965 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:18,965 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:24:18,966 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:24:18,966 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:24:18,966 INFO L146 ILogger]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:24:18,966 INFO L146 ILogger]: Start difference. First operand 151 states and 151 transitions. Second operand 55 states. [2019-05-23 09:24:24,503 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:24,503 INFO L146 ILogger]: Finished difference Result 156 states and 156 transitions. [2019-05-23 09:24:24,504 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:24:24,504 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 150 [2019-05-23 09:24:24,504 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:24,506 INFO L146 ILogger]: With dead ends: 156 [2019-05-23 09:24:24,506 INFO L146 ILogger]: Without dead ends: 156 [2019-05-23 09:24:24,506 INFO L146 ILogger]: 0 DeclaredPredicates, 151 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=171, Invalid=3021, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:24:24,507 INFO L146 ILogger]: Start minimizeSevpa. Operand 156 states. [2019-05-23 09:24:24,509 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-05-23 09:24:24,509 INFO L146 ILogger]: Start removeUnreachable. Operand 154 states. [2019-05-23 09:24:24,510 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-05-23 09:24:24,510 INFO L146 ILogger]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-05-23 09:24:24,510 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:24,510 INFO L146 ILogger]: Abstraction has 154 states and 154 transitions. [2019-05-23 09:24:24,510 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:24:24,510 INFO L146 ILogger]: Start isEmpty. Operand 154 states and 154 transitions. [2019-05-23 09:24:24,511 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 154 [2019-05-23 09:24:24,511 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:24,511 INFO L146 ILogger]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2019-05-23 09:24:24,512 INFO L146 ILogger]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:24,512 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:24,512 INFO L146 ILogger]: Analyzing trace with hash -891247745, now seen corresponding path program 49 times [2019-05-23 09:24:24,519 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:24,539 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:24,544 WARN L146 ILogger]: Trace formula consists of 206 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:24:24,546 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:24,580 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 8 treesize of output 7 [2019-05-23 09:24:24,581 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:24,602 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:24,602 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:24,603 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:26,096 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:26,096 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:26,097 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:26,104 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:26,105 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:26,105 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:26,300 INFO L146 ILogger]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:26,300 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:26,300 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:24:26,301 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:24:26,301 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:24:26,301 INFO L146 ILogger]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:24:26,301 INFO L146 ILogger]: Start difference. First operand 154 states and 154 transitions. Second operand 56 states. [2019-05-23 09:24:32,094 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:32,094 INFO L146 ILogger]: Finished difference Result 159 states and 159 transitions. [2019-05-23 09:24:32,095 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:24:32,095 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 153 [2019-05-23 09:24:32,095 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:32,096 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 09:24:32,096 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:24:32,097 INFO L146 ILogger]: 0 DeclaredPredicates, 154 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=3132, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:24:32,097 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:24:32,099 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-05-23 09:24:32,099 INFO L146 ILogger]: Start removeUnreachable. Operand 157 states. [2019-05-23 09:24:32,099 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-05-23 09:24:32,099 INFO L146 ILogger]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-05-23 09:24:32,100 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:32,100 INFO L146 ILogger]: Abstraction has 157 states and 157 transitions. [2019-05-23 09:24:32,100 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:24:32,100 INFO L146 ILogger]: Start isEmpty. Operand 157 states and 157 transitions. [2019-05-23 09:24:32,100 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 157 [2019-05-23 09:24:32,100 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:32,100 INFO L146 ILogger]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2019-05-23 09:24:32,101 INFO L146 ILogger]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:32,101 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:32,101 INFO L146 ILogger]: Analyzing trace with hash 326288359, now seen corresponding path program 50 times [2019-05-23 09:24:32,102 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:32,122 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:32,127 WARN L146 ILogger]: Trace formula consists of 210 conjuncts, 107 conjunts are in the unsatisfiable core [2019-05-23 09:24:32,129 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:32,171 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 8 treesize of output 7 [2019-05-23 09:24:32,171 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:32,192 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:32,193 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,193 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:33,701 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:33,702 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:33,703 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:33,708 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:33,708 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:33,708 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:33,830 INFO L146 ILogger]: Checked inductivity of 3825 backedges. 0 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:33,830 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:33,830 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:24:33,831 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:24:33,831 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:24:33,831 INFO L146 ILogger]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:24:33,831 INFO L146 ILogger]: Start difference. First operand 157 states and 157 transitions. Second operand 57 states. [2019-05-23 09:24:40,059 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:40,059 INFO L146 ILogger]: Finished difference Result 162 states and 162 transitions. [2019-05-23 09:24:40,060 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:24:40,060 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 156 [2019-05-23 09:24:40,060 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:40,061 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:24:40,062 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 09:24:40,062 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=3245, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:24:40,062 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 09:24:40,064 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-05-23 09:24:40,065 INFO L146 ILogger]: Start removeUnreachable. Operand 160 states. [2019-05-23 09:24:40,065 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-05-23 09:24:40,065 INFO L146 ILogger]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-05-23 09:24:40,065 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:40,066 INFO L146 ILogger]: Abstraction has 160 states and 160 transitions. [2019-05-23 09:24:40,066 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:24:40,066 INFO L146 ILogger]: Start isEmpty. Operand 160 states and 160 transitions. [2019-05-23 09:24:40,066 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 160 [2019-05-23 09:24:40,067 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:40,067 INFO L146 ILogger]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2019-05-23 09:24:40,067 INFO L146 ILogger]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:40,067 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:40,067 INFO L146 ILogger]: Analyzing trace with hash 945547903, now seen corresponding path program 51 times [2019-05-23 09:24:40,068 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:40,090 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:40,095 WARN L146 ILogger]: Trace formula consists of 214 conjuncts, 109 conjunts are in the unsatisfiable core [2019-05-23 09:24:40,097 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:40,143 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 8 treesize of output 7 [2019-05-23 09:24:40,144 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:40,157 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:40,157 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:40,158 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:41,809 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:41,809 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:41,810 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:41,813 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:41,813 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:41,813 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:41,933 INFO L146 ILogger]: Checked inductivity of 3978 backedges. 0 proven. 3978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:41,934 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:41,934 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:24:41,934 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:24:41,934 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:24:41,934 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:24:41,935 INFO L146 ILogger]: Start difference. First operand 160 states and 160 transitions. Second operand 58 states. [2019-05-23 09:24:48,171 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:48,171 INFO L146 ILogger]: Finished difference Result 165 states and 165 transitions. [2019-05-23 09:24:48,172 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:24:48,172 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 159 [2019-05-23 09:24:48,172 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:48,173 INFO L146 ILogger]: With dead ends: 165 [2019-05-23 09:24:48,173 INFO L146 ILogger]: Without dead ends: 165 [2019-05-23 09:24:48,174 INFO L146 ILogger]: 0 DeclaredPredicates, 160 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=180, Invalid=3360, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:24:48,174 INFO L146 ILogger]: Start minimizeSevpa. Operand 165 states. [2019-05-23 09:24:48,176 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-05-23 09:24:48,176 INFO L146 ILogger]: Start removeUnreachable. Operand 163 states. [2019-05-23 09:24:48,177 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-05-23 09:24:48,177 INFO L146 ILogger]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-05-23 09:24:48,177 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:48,177 INFO L146 ILogger]: Abstraction has 163 states and 163 transitions. [2019-05-23 09:24:48,177 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:24:48,177 INFO L146 ILogger]: Start isEmpty. Operand 163 states and 163 transitions. [2019-05-23 09:24:48,178 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 09:24:48,178 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:48,178 INFO L146 ILogger]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2019-05-23 09:24:48,178 INFO L146 ILogger]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:48,178 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:48,178 INFO L146 ILogger]: Analyzing trace with hash -1872880409, now seen corresponding path program 52 times [2019-05-23 09:24:48,179 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:48,204 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:48,209 WARN L146 ILogger]: Trace formula consists of 218 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 09:24:48,211 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:48,226 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 8 treesize of output 7 [2019-05-23 09:24:48,226 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:48,228 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:48,228 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:48,228 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:24:52,387 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:52,387 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:24:52,388 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:52,392 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:52,393 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:52,393 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:24:52,519 INFO L146 ILogger]: Checked inductivity of 4134 backedges. 0 proven. 4134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:52,519 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:52,519 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:24:52,519 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:24:52,520 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:24:52,520 INFO L146 ILogger]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:24:52,520 INFO L146 ILogger]: Start difference. First operand 163 states and 163 transitions. Second operand 59 states. [2019-05-23 09:24:58,953 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:58,953 INFO L146 ILogger]: Finished difference Result 168 states and 168 transitions. [2019-05-23 09:24:58,958 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:24:58,958 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 162 [2019-05-23 09:24:58,959 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:58,959 INFO L146 ILogger]: With dead ends: 168 [2019-05-23 09:24:58,959 INFO L146 ILogger]: Without dead ends: 168 [2019-05-23 09:24:58,960 INFO L146 ILogger]: 0 DeclaredPredicates, 163 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=183, Invalid=3477, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:24:58,960 INFO L146 ILogger]: Start minimizeSevpa. Operand 168 states. [2019-05-23 09:24:58,962 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-05-23 09:24:58,962 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 09:24:58,962 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-05-23 09:24:58,963 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-05-23 09:24:58,963 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:58,963 INFO L146 ILogger]: Abstraction has 166 states and 166 transitions. [2019-05-23 09:24:58,963 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:24:58,963 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 166 transitions. [2019-05-23 09:24:58,964 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 166 [2019-05-23 09:24:58,964 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:58,964 INFO L146 ILogger]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2019-05-23 09:24:58,964 INFO L146 ILogger]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:58,964 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:58,964 INFO L146 ILogger]: Analyzing trace with hash 939913599, now seen corresponding path program 53 times [2019-05-23 09:24:58,965 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:58,987 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:58,992 WARN L146 ILogger]: Trace formula consists of 222 conjuncts, 113 conjunts are in the unsatisfiable core [2019-05-23 09:24:58,994 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:59,032 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 8 treesize of output 7 [2019-05-23 09:24:59,033 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:24:59,054 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:24:59,054 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:24:59,055 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:01,781 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:01,781 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:01,782 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:01,786 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:01,787 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,787 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:01,915 INFO L146 ILogger]: Checked inductivity of 4293 backedges. 0 proven. 4293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:01,916 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:01,916 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:25:01,916 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:25:01,916 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:25:01,917 INFO L146 ILogger]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:25:01,917 INFO L146 ILogger]: Start difference. First operand 166 states and 166 transitions. Second operand 60 states. [2019-05-23 09:25:08,991 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:08,991 INFO L146 ILogger]: Finished difference Result 171 states and 171 transitions. [2019-05-23 09:25:08,991 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:25:08,991 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 165 [2019-05-23 09:25:08,992 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:08,992 INFO L146 ILogger]: With dead ends: 171 [2019-05-23 09:25:08,993 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:25:08,993 INFO L146 ILogger]: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=186, Invalid=3596, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:25:08,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:25:08,995 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-05-23 09:25:08,995 INFO L146 ILogger]: Start removeUnreachable. Operand 169 states. [2019-05-23 09:25:08,995 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-05-23 09:25:08,996 INFO L146 ILogger]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-05-23 09:25:08,996 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:08,996 INFO L146 ILogger]: Abstraction has 169 states and 169 transitions. [2019-05-23 09:25:08,996 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:25:08,996 INFO L146 ILogger]: Start isEmpty. Operand 169 states and 169 transitions. [2019-05-23 09:25:08,996 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 169 [2019-05-23 09:25:08,997 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:08,997 INFO L146 ILogger]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2019-05-23 09:25:08,997 INFO L146 ILogger]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:08,997 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:08,997 INFO L146 ILogger]: Analyzing trace with hash 2074260967, now seen corresponding path program 54 times [2019-05-23 09:25:08,998 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:09,019 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:09,024 WARN L146 ILogger]: Trace formula consists of 226 conjuncts, 115 conjunts are in the unsatisfiable core [2019-05-23 09:25:09,027 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:09,045 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 8 treesize of output 7 [2019-05-23 09:25:09,045 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:09,047 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:09,047 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:09,048 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:10,951 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:10,952 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:10,952 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:10,957 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:10,957 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:10,957 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:11,086 INFO L146 ILogger]: Checked inductivity of 4455 backedges. 0 proven. 4455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:11,087 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:11,087 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:25:11,087 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:25:11,087 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:25:11,087 INFO L146 ILogger]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:25:11,087 INFO L146 ILogger]: Start difference. First operand 169 states and 169 transitions. Second operand 61 states. [2019-05-23 09:25:17,996 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:17,996 INFO L146 ILogger]: Finished difference Result 174 states and 174 transitions. [2019-05-23 09:25:17,997 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:25:17,997 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 168 [2019-05-23 09:25:17,997 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:17,998 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 09:25:17,999 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 09:25:17,999 INFO L146 ILogger]: 0 DeclaredPredicates, 169 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=189, Invalid=3717, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:25:17,999 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 09:25:18,001 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-05-23 09:25:18,001 INFO L146 ILogger]: Start removeUnreachable. Operand 172 states. [2019-05-23 09:25:18,001 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-05-23 09:25:18,001 INFO L146 ILogger]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-05-23 09:25:18,002 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:18,002 INFO L146 ILogger]: Abstraction has 172 states and 172 transitions. [2019-05-23 09:25:18,002 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:25:18,002 INFO L146 ILogger]: Start isEmpty. Operand 172 states and 172 transitions. [2019-05-23 09:25:18,002 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 172 [2019-05-23 09:25:18,002 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:18,003 INFO L146 ILogger]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2019-05-23 09:25:18,003 INFO L146 ILogger]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:18,003 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:18,003 INFO L146 ILogger]: Analyzing trace with hash -1680951169, now seen corresponding path program 55 times [2019-05-23 09:25:18,004 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:18,028 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:18,033 WARN L146 ILogger]: Trace formula consists of 230 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 09:25:18,035 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:18,047 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 8 treesize of output 7 [2019-05-23 09:25:18,047 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:18,049 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:18,049 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:18,049 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:19,792 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:19,793 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:19,794 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:19,799 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:19,799 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,800 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:19,931 INFO L146 ILogger]: Checked inductivity of 4620 backedges. 0 proven. 4620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:19,931 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:19,931 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:25:19,932 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:25:19,932 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:25:19,932 INFO L146 ILogger]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:25:19,933 INFO L146 ILogger]: Start difference. First operand 172 states and 172 transitions. Second operand 62 states. [2019-05-23 09:25:27,208 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:27,208 INFO L146 ILogger]: Finished difference Result 177 states and 177 transitions. [2019-05-23 09:25:27,209 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:25:27,209 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 171 [2019-05-23 09:25:27,209 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:27,210 INFO L146 ILogger]: With dead ends: 177 [2019-05-23 09:25:27,210 INFO L146 ILogger]: Without dead ends: 177 [2019-05-23 09:25:27,211 INFO L146 ILogger]: 0 DeclaredPredicates, 172 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=3840, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:25:27,211 INFO L146 ILogger]: Start minimizeSevpa. Operand 177 states. [2019-05-23 09:25:27,213 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-05-23 09:25:27,213 INFO L146 ILogger]: Start removeUnreachable. Operand 175 states. [2019-05-23 09:25:27,213 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-05-23 09:25:27,213 INFO L146 ILogger]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-05-23 09:25:27,214 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:27,214 INFO L146 ILogger]: Abstraction has 175 states and 175 transitions. [2019-05-23 09:25:27,214 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:25:27,214 INFO L146 ILogger]: Start isEmpty. Operand 175 states and 175 transitions. [2019-05-23 09:25:27,214 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 175 [2019-05-23 09:25:27,214 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:27,215 INFO L146 ILogger]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2019-05-23 09:25:27,215 INFO L146 ILogger]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:27,215 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:27,215 INFO L146 ILogger]: Analyzing trace with hash 2102431463, now seen corresponding path program 56 times [2019-05-23 09:25:27,215 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:27,240 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:27,245 WARN L146 ILogger]: Trace formula consists of 234 conjuncts, 119 conjunts are in the unsatisfiable core [2019-05-23 09:25:27,248 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:27,288 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 8 treesize of output 7 [2019-05-23 09:25:27,289 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:27,310 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:27,311 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:27,311 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:29,259 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:29,259 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:29,260 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:29,266 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:29,266 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:29,266 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:29,399 INFO L146 ILogger]: Checked inductivity of 4788 backedges. 0 proven. 4788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:29,399 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:29,399 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:25:29,400 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:25:29,400 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:25:29,400 INFO L146 ILogger]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:25:29,400 INFO L146 ILogger]: Start difference. First operand 175 states and 175 transitions. Second operand 63 states. [2019-05-23 09:25:37,043 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:37,043 INFO L146 ILogger]: Finished difference Result 180 states and 180 transitions. [2019-05-23 09:25:37,044 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:25:37,044 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 174 [2019-05-23 09:25:37,044 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:37,045 INFO L146 ILogger]: With dead ends: 180 [2019-05-23 09:25:37,045 INFO L146 ILogger]: Without dead ends: 180 [2019-05-23 09:25:37,045 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=195, Invalid=3965, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:25:37,046 INFO L146 ILogger]: Start minimizeSevpa. Operand 180 states. [2019-05-23 09:25:37,048 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-05-23 09:25:37,048 INFO L146 ILogger]: Start removeUnreachable. Operand 178 states. [2019-05-23 09:25:37,049 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-05-23 09:25:37,049 INFO L146 ILogger]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-05-23 09:25:37,049 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:37,049 INFO L146 ILogger]: Abstraction has 178 states and 178 transitions. [2019-05-23 09:25:37,049 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:25:37,049 INFO L146 ILogger]: Start isEmpty. Operand 178 states and 178 transitions. [2019-05-23 09:25:37,050 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 178 [2019-05-23 09:25:37,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:37,050 INFO L146 ILogger]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2019-05-23 09:25:37,051 INFO L146 ILogger]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:37,051 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:37,051 INFO L146 ILogger]: Analyzing trace with hash 27672447, now seen corresponding path program 57 times [2019-05-23 09:25:37,051 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:37,083 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:37,100 WARN L146 ILogger]: Trace formula consists of 238 conjuncts, 121 conjunts are in the unsatisfiable core [2019-05-23 09:25:37,107 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:37,147 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 8 treesize of output 7 [2019-05-23 09:25:37,148 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:37,169 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:37,170 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:37,170 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:39,145 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:39,145 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:39,146 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:39,150 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:39,150 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:39,151 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:39,291 INFO L146 ILogger]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:39,291 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:39,292 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:25:39,292 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:25:39,292 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:25:39,293 INFO L146 ILogger]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:25:39,293 INFO L146 ILogger]: Start difference. First operand 178 states and 178 transitions. Second operand 64 states. [2019-05-23 09:25:47,002 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:47,003 INFO L146 ILogger]: Finished difference Result 183 states and 183 transitions. [2019-05-23 09:25:47,003 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:25:47,003 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 177 [2019-05-23 09:25:47,003 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:47,004 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 09:25:47,005 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 09:25:47,005 INFO L146 ILogger]: 0 DeclaredPredicates, 178 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=198, Invalid=4092, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:25:47,006 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 09:25:47,008 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-05-23 09:25:47,008 INFO L146 ILogger]: Start removeUnreachable. Operand 181 states. [2019-05-23 09:25:47,008 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-05-23 09:25:47,009 INFO L146 ILogger]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-05-23 09:25:47,009 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:47,009 INFO L146 ILogger]: Abstraction has 181 states and 181 transitions. [2019-05-23 09:25:47,009 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:25:47,009 INFO L146 ILogger]: Start isEmpty. Operand 181 states and 181 transitions. [2019-05-23 09:25:47,010 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 181 [2019-05-23 09:25:47,010 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:47,010 INFO L146 ILogger]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2019-05-23 09:25:47,010 INFO L146 ILogger]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:47,010 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:47,011 INFO L146 ILogger]: Analyzing trace with hash -243816473, now seen corresponding path program 58 times [2019-05-23 09:25:47,011 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:47,036 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:47,042 WARN L146 ILogger]: Trace formula consists of 242 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 09:25:47,044 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:47,083 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 8 treesize of output 7 [2019-05-23 09:25:47,084 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:47,100 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:47,100 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,100 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:49,225 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:49,226 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:49,226 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:49,231 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:49,231 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:49,231 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:49,391 INFO L146 ILogger]: Checked inductivity of 5133 backedges. 0 proven. 5133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:49,391 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:49,391 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:25:49,391 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:25:49,392 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:25:49,392 INFO L146 ILogger]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:25:49,392 INFO L146 ILogger]: Start difference. First operand 181 states and 181 transitions. Second operand 65 states. [2019-05-23 09:25:57,299 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:57,299 INFO L146 ILogger]: Finished difference Result 186 states and 186 transitions. [2019-05-23 09:25:57,299 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:25:57,299 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 180 [2019-05-23 09:25:57,300 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:57,301 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 09:25:57,301 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 09:25:57,302 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=201, Invalid=4221, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:25:57,302 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 09:25:57,304 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-05-23 09:25:57,304 INFO L146 ILogger]: Start removeUnreachable. Operand 184 states. [2019-05-23 09:25:57,305 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-05-23 09:25:57,305 INFO L146 ILogger]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-05-23 09:25:57,305 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:57,305 INFO L146 ILogger]: Abstraction has 184 states and 184 transitions. [2019-05-23 09:25:57,305 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:25:57,306 INFO L146 ILogger]: Start isEmpty. Operand 184 states and 184 transitions. [2019-05-23 09:25:57,306 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 184 [2019-05-23 09:25:57,306 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:57,307 INFO L146 ILogger]: trace histogram [60, 60, 59, 1, 1, 1, 1] [2019-05-23 09:25:57,307 INFO L146 ILogger]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:57,307 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:57,307 INFO L146 ILogger]: Analyzing trace with hash -746813825, now seen corresponding path program 59 times [2019-05-23 09:25:57,308 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:57,333 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:57,339 WARN L146 ILogger]: Trace formula consists of 246 conjuncts, 125 conjunts are in the unsatisfiable core [2019-05-23 09:25:57,341 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:57,374 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 8 treesize of output 7 [2019-05-23 09:25:57,374 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:25:57,377 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:57,377 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:57,377 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:25:59,498 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:59,499 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:25:59,499 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:59,504 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:25:59,504 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:25:59,504 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:25:59,650 INFO L146 ILogger]: Checked inductivity of 5310 backedges. 0 proven. 5310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:59,650 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:59,650 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:25:59,651 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:25:59,651 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:25:59,651 INFO L146 ILogger]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:25:59,651 INFO L146 ILogger]: Start difference. First operand 184 states and 184 transitions. Second operand 66 states. [2019-05-23 09:26:07,663 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:07,663 INFO L146 ILogger]: Finished difference Result 189 states and 189 transitions. [2019-05-23 09:26:07,664 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:26:07,664 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 183 [2019-05-23 09:26:07,664 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:07,665 INFO L146 ILogger]: With dead ends: 189 [2019-05-23 09:26:07,665 INFO L146 ILogger]: Without dead ends: 189 [2019-05-23 09:26:07,666 INFO L146 ILogger]: 0 DeclaredPredicates, 184 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=204, Invalid=4352, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:26:07,666 INFO L146 ILogger]: Start minimizeSevpa. Operand 189 states. [2019-05-23 09:26:07,668 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 189 to 187. [2019-05-23 09:26:07,668 INFO L146 ILogger]: Start removeUnreachable. Operand 187 states. [2019-05-23 09:26:07,668 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-05-23 09:26:07,668 INFO L146 ILogger]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-05-23 09:26:07,669 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:07,669 INFO L146 ILogger]: Abstraction has 187 states and 187 transitions. [2019-05-23 09:26:07,669 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:26:07,669 INFO L146 ILogger]: Start isEmpty. Operand 187 states and 187 transitions. [2019-05-23 09:26:07,669 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 187 [2019-05-23 09:26:07,669 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:07,670 INFO L146 ILogger]: trace histogram [61, 61, 60, 1, 1, 1, 1] [2019-05-23 09:26:07,670 INFO L146 ILogger]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:07,670 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:07,670 INFO L146 ILogger]: Analyzing trace with hash -400031513, now seen corresponding path program 60 times [2019-05-23 09:26:07,671 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:07,692 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:07,697 WARN L146 ILogger]: Trace formula consists of 250 conjuncts, 127 conjunts are in the unsatisfiable core [2019-05-23 09:26:07,699 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:07,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 8 treesize of output 7 [2019-05-23 09:26:07,710 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:07,715 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:07,715 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:07,715 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:26:09,741 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:09,741 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:26:09,742 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:09,748 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:09,748 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,748 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:26:09,908 INFO L146 ILogger]: Checked inductivity of 5490 backedges. 0 proven. 5490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:09,909 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:09,909 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:26:09,909 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:26:09,909 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:26:09,909 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:26:09,910 INFO L146 ILogger]: Start difference. First operand 187 states and 187 transitions. Second operand 67 states. [2019-05-23 09:26:18,306 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:18,306 INFO L146 ILogger]: Finished difference Result 192 states and 192 transitions. [2019-05-23 09:26:18,307 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:26:18,307 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 186 [2019-05-23 09:26:18,307 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:18,308 INFO L146 ILogger]: With dead ends: 192 [2019-05-23 09:26:18,308 INFO L146 ILogger]: Without dead ends: 192 [2019-05-23 09:26:18,309 INFO L146 ILogger]: 0 DeclaredPredicates, 187 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=207, Invalid=4485, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:26:18,309 INFO L146 ILogger]: Start minimizeSevpa. Operand 192 states. [2019-05-23 09:26:18,311 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-05-23 09:26:18,312 INFO L146 ILogger]: Start removeUnreachable. Operand 190 states. [2019-05-23 09:26:18,312 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-05-23 09:26:18,312 INFO L146 ILogger]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-05-23 09:26:18,312 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:18,312 INFO L146 ILogger]: Abstraction has 190 states and 190 transitions. [2019-05-23 09:26:18,312 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:26:18,312 INFO L146 ILogger]: Start isEmpty. Operand 190 states and 190 transitions. [2019-05-23 09:26:18,313 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 190 [2019-05-23 09:26:18,313 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:18,313 INFO L146 ILogger]: trace histogram [62, 62, 61, 1, 1, 1, 1] [2019-05-23 09:26:18,313 INFO L146 ILogger]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:18,313 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:18,314 INFO L146 ILogger]: Analyzing trace with hash 1195478399, now seen corresponding path program 61 times [2019-05-23 09:26:18,314 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:18,337 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:18,341 WARN L146 ILogger]: Trace formula consists of 254 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 09:26:18,343 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:18,348 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 8 treesize of output 7 [2019-05-23 09:26:18,348 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:18,350 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:18,350 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:18,350 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:26:20,530 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:20,531 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:26:20,532 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:20,536 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:20,536 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:20,537 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:26:20,687 INFO L146 ILogger]: Checked inductivity of 5673 backedges. 0 proven. 5673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:20,688 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:20,688 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:26:20,688 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:26:20,688 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:26:20,689 INFO L146 ILogger]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:26:20,689 INFO L146 ILogger]: Start difference. First operand 190 states and 190 transitions. Second operand 68 states. [2019-05-23 09:26:29,568 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:29,568 INFO L146 ILogger]: Finished difference Result 195 states and 195 transitions. [2019-05-23 09:26:29,569 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:26:29,569 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 189 [2019-05-23 09:26:29,569 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:29,570 INFO L146 ILogger]: With dead ends: 195 [2019-05-23 09:26:29,570 INFO L146 ILogger]: Without dead ends: 195 [2019-05-23 09:26:29,571 INFO L146 ILogger]: 0 DeclaredPredicates, 190 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=210, Invalid=4620, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:26:29,571 INFO L146 ILogger]: Start minimizeSevpa. Operand 195 states. [2019-05-23 09:26:29,573 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-05-23 09:26:29,573 INFO L146 ILogger]: Start removeUnreachable. Operand 193 states. [2019-05-23 09:26:29,574 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-05-23 09:26:29,574 INFO L146 ILogger]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-05-23 09:26:29,574 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:29,574 INFO L146 ILogger]: Abstraction has 193 states and 193 transitions. [2019-05-23 09:26:29,574 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:26:29,574 INFO L146 ILogger]: Start isEmpty. Operand 193 states and 193 transitions. [2019-05-23 09:26:29,575 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 193 [2019-05-23 09:26:29,575 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:29,575 INFO L146 ILogger]: trace histogram [63, 63, 62, 1, 1, 1, 1] [2019-05-23 09:26:29,576 INFO L146 ILogger]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:29,576 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:29,576 INFO L146 ILogger]: Analyzing trace with hash 628201959, now seen corresponding path program 62 times [2019-05-23 09:26:29,577 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:29,605 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:29,612 WARN L146 ILogger]: Trace formula consists of 258 conjuncts, 131 conjunts are in the unsatisfiable core [2019-05-23 09:26:29,615 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:29,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 8 treesize of output 7 [2019-05-23 09:26:29,654 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:29,667 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:29,667 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:29,667 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:26:32,024 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:32,024 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:26:32,025 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:32,029 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:32,029 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:32,029 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:26:32,181 INFO L146 ILogger]: Checked inductivity of 5859 backedges. 0 proven. 5859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:32,181 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:32,181 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:26:32,181 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:26:32,182 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:26:32,182 INFO L146 ILogger]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:26:32,182 INFO L146 ILogger]: Start difference. First operand 193 states and 193 transitions. Second operand 69 states. [2019-05-23 09:26:41,050 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:41,051 INFO L146 ILogger]: Finished difference Result 198 states and 198 transitions. [2019-05-23 09:26:41,051 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:26:41,051 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 192 [2019-05-23 09:26:41,052 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:41,053 INFO L146 ILogger]: With dead ends: 198 [2019-05-23 09:26:41,053 INFO L146 ILogger]: Without dead ends: 198 [2019-05-23 09:26:41,053 INFO L146 ILogger]: 0 DeclaredPredicates, 193 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=213, Invalid=4757, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:26:41,054 INFO L146 ILogger]: Start minimizeSevpa. Operand 198 states. [2019-05-23 09:26:41,056 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-05-23 09:26:41,057 INFO L146 ILogger]: Start removeUnreachable. Operand 196 states. [2019-05-23 09:26:41,057 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-05-23 09:26:41,057 INFO L146 ILogger]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-05-23 09:26:41,057 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:41,057 INFO L146 ILogger]: Abstraction has 196 states and 196 transitions. [2019-05-23 09:26:41,057 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:26:41,058 INFO L146 ILogger]: Start isEmpty. Operand 196 states and 196 transitions. [2019-05-23 09:26:41,058 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 196 [2019-05-23 09:26:41,058 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:41,059 INFO L146 ILogger]: trace histogram [64, 64, 63, 1, 1, 1, 1] [2019-05-23 09:26:41,059 INFO L146 ILogger]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:41,059 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:41,059 INFO L146 ILogger]: Analyzing trace with hash 1592087679, now seen corresponding path program 63 times [2019-05-23 09:26:41,060 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:41,088 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:41,095 WARN L146 ILogger]: Trace formula consists of 262 conjuncts, 133 conjunts are in the unsatisfiable core [2019-05-23 09:26:41,097 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:41,112 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 8 treesize of output 7 [2019-05-23 09:26:41,113 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:41,114 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:41,114 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:41,114 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:26:43,443 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:43,444 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:26:43,444 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:43,451 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:43,451 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:43,452 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:26:43,611 INFO L146 ILogger]: Checked inductivity of 6048 backedges. 0 proven. 6048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:43,611 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:43,611 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:26:43,612 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:26:43,612 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:26:43,612 INFO L146 ILogger]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:26:43,612 INFO L146 ILogger]: Start difference. First operand 196 states and 196 transitions. Second operand 70 states. [2019-05-23 09:26:52,989 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:52,990 INFO L146 ILogger]: Finished difference Result 201 states and 201 transitions. [2019-05-23 09:26:52,990 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:26:52,990 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 195 [2019-05-23 09:26:52,991 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:52,992 INFO L146 ILogger]: With dead ends: 201 [2019-05-23 09:26:52,992 INFO L146 ILogger]: Without dead ends: 201 [2019-05-23 09:26:52,992 INFO L146 ILogger]: 0 DeclaredPredicates, 196 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=216, Invalid=4896, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:26:52,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 201 states. [2019-05-23 09:26:52,995 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-05-23 09:26:52,995 INFO L146 ILogger]: Start removeUnreachable. Operand 199 states. [2019-05-23 09:26:52,996 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-05-23 09:26:52,996 INFO L146 ILogger]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-05-23 09:26:52,996 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:52,996 INFO L146 ILogger]: Abstraction has 199 states and 199 transitions. [2019-05-23 09:26:52,996 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:26:52,997 INFO L146 ILogger]: Start isEmpty. Operand 199 states and 199 transitions. [2019-05-23 09:26:52,997 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 199 [2019-05-23 09:26:52,998 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:52,998 INFO L146 ILogger]: trace histogram [65, 65, 64, 1, 1, 1, 1] [2019-05-23 09:26:52,998 INFO L146 ILogger]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:52,998 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:52,998 INFO L146 ILogger]: Analyzing trace with hash 560231143, now seen corresponding path program 64 times [2019-05-23 09:26:52,999 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:53,031 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:53,037 WARN L146 ILogger]: Trace formula consists of 266 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 09:26:53,038 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:53,045 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 8 treesize of output 7 [2019-05-23 09:26:53,045 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:26:53,047 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:53,047 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:53,047 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:26:55,348 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:55,349 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:26:55,349 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:55,354 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:26:55,354 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:26:55,354 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:26:55,519 INFO L146 ILogger]: Checked inductivity of 6240 backedges. 0 proven. 6240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:55,519 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:55,519 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:26:55,520 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:26:55,520 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:26:55,520 INFO L146 ILogger]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:26:55,520 INFO L146 ILogger]: Start difference. First operand 199 states and 199 transitions. Second operand 71 states. [2019-05-23 09:27:05,118 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:05,118 INFO L146 ILogger]: Finished difference Result 204 states and 204 transitions. [2019-05-23 09:27:05,118 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:27:05,118 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 198 [2019-05-23 09:27:05,119 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:05,120 INFO L146 ILogger]: With dead ends: 204 [2019-05-23 09:27:05,120 INFO L146 ILogger]: Without dead ends: 204 [2019-05-23 09:27:05,120 INFO L146 ILogger]: 0 DeclaredPredicates, 199 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=219, Invalid=5037, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:27:05,120 INFO L146 ILogger]: Start minimizeSevpa. Operand 204 states. [2019-05-23 09:27:05,123 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 204 to 202. [2019-05-23 09:27:05,123 INFO L146 ILogger]: Start removeUnreachable. Operand 202 states. [2019-05-23 09:27:05,123 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-05-23 09:27:05,124 INFO L146 ILogger]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-05-23 09:27:05,124 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:05,124 INFO L146 ILogger]: Abstraction has 202 states and 202 transitions. [2019-05-23 09:27:05,124 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:27:05,124 INFO L146 ILogger]: Start isEmpty. Operand 202 states and 202 transitions. [2019-05-23 09:27:05,125 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 202 [2019-05-23 09:27:05,125 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:05,125 INFO L146 ILogger]: trace histogram [66, 66, 65, 1, 1, 1, 1] [2019-05-23 09:27:05,126 INFO L146 ILogger]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:05,126 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:05,126 INFO L146 ILogger]: Analyzing trace with hash -396895361, now seen corresponding path program 65 times [2019-05-23 09:27:05,126 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:05,157 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:05,165 WARN L146 ILogger]: Trace formula consists of 270 conjuncts, 137 conjunts are in the unsatisfiable core [2019-05-23 09:27:05,167 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:05,192 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 8 treesize of output 7 [2019-05-23 09:27:05,192 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:05,194 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:05,194 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:05,194 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:27:07,659 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:07,660 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:27:07,660 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:07,671 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:07,671 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,671 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:27:07,900 INFO L146 ILogger]: Checked inductivity of 6435 backedges. 0 proven. 6435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:07,900 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:07,901 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:27:07,901 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:27:07,901 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:27:07,901 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:27:07,901 INFO L146 ILogger]: Start difference. First operand 202 states and 202 transitions. Second operand 72 states. [2019-05-23 09:27:17,489 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:17,490 INFO L146 ILogger]: Finished difference Result 207 states and 207 transitions. [2019-05-23 09:27:17,490 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:27:17,490 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 201 [2019-05-23 09:27:17,491 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:17,492 INFO L146 ILogger]: With dead ends: 207 [2019-05-23 09:27:17,492 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 09:27:17,492 INFO L146 ILogger]: 0 DeclaredPredicates, 202 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=222, Invalid=5180, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:27:17,492 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 09:27:17,494 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-05-23 09:27:17,495 INFO L146 ILogger]: Start removeUnreachable. Operand 205 states. [2019-05-23 09:27:17,495 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-05-23 09:27:17,495 INFO L146 ILogger]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-05-23 09:27:17,495 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:17,495 INFO L146 ILogger]: Abstraction has 205 states and 205 transitions. [2019-05-23 09:27:17,496 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:27:17,496 INFO L146 ILogger]: Start isEmpty. Operand 205 states and 205 transitions. [2019-05-23 09:27:17,496 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 205 [2019-05-23 09:27:17,496 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:17,496 INFO L146 ILogger]: trace histogram [67, 67, 66, 1, 1, 1, 1] [2019-05-23 09:27:17,497 INFO L146 ILogger]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:17,497 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:17,497 INFO L146 ILogger]: Analyzing trace with hash 135302119, now seen corresponding path program 66 times [2019-05-23 09:27:17,497 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:17,523 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:17,529 WARN L146 ILogger]: Trace formula consists of 274 conjuncts, 139 conjunts are in the unsatisfiable core [2019-05-23 09:27:17,531 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:17,549 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 8 treesize of output 7 [2019-05-23 09:27:17,550 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:17,554 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:17,554 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:17,554 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:27:20,185 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:20,186 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:27:20,186 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:20,191 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:20,191 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:20,191 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:27:20,360 INFO L146 ILogger]: Checked inductivity of 6633 backedges. 0 proven. 6633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:20,360 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:20,360 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:27:20,360 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:27:20,361 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:27:20,361 INFO L146 ILogger]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:27:20,361 INFO L146 ILogger]: Start difference. First operand 205 states and 205 transitions. Second operand 73 states. [2019-05-23 09:27:30,572 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:30,573 INFO L146 ILogger]: Finished difference Result 210 states and 210 transitions. [2019-05-23 09:27:30,573 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:27:30,573 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 204 [2019-05-23 09:27:30,574 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:30,575 INFO L146 ILogger]: With dead ends: 210 [2019-05-23 09:27:30,575 INFO L146 ILogger]: Without dead ends: 210 [2019-05-23 09:27:30,575 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=225, Invalid=5325, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:27:30,576 INFO L146 ILogger]: Start minimizeSevpa. Operand 210 states. [2019-05-23 09:27:30,578 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-05-23 09:27:30,578 INFO L146 ILogger]: Start removeUnreachable. Operand 208 states. [2019-05-23 09:27:30,578 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-05-23 09:27:30,578 INFO L146 ILogger]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-05-23 09:27:30,578 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:30,579 INFO L146 ILogger]: Abstraction has 208 states and 208 transitions. [2019-05-23 09:27:30,579 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:27:30,579 INFO L146 ILogger]: Start isEmpty. Operand 208 states and 208 transitions. [2019-05-23 09:27:30,579 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 208 [2019-05-23 09:27:30,579 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:30,580 INFO L146 ILogger]: trace histogram [68, 68, 67, 1, 1, 1, 1] [2019-05-23 09:27:30,580 INFO L146 ILogger]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:30,580 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:30,580 INFO L146 ILogger]: Analyzing trace with hash 2106139263, now seen corresponding path program 67 times [2019-05-23 09:27:30,580 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:30,612 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:30,626 WARN L146 ILogger]: Trace formula consists of 278 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 09:27:30,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:30,669 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 8 treesize of output 7 [2019-05-23 09:27:30,669 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:30,673 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:30,673 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:30,674 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:27:33,167 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:33,168 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:27:33,168 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:33,177 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:33,177 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:33,178 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:27:33,467 INFO L146 ILogger]: Checked inductivity of 6834 backedges. 0 proven. 6834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:33,467 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:33,467 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:27:33,468 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:27:33,468 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:27:33,468 INFO L146 ILogger]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:27:33,468 INFO L146 ILogger]: Start difference. First operand 208 states and 208 transitions. Second operand 74 states. [2019-05-23 09:27:44,119 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:44,120 INFO L146 ILogger]: Finished difference Result 213 states and 213 transitions. [2019-05-23 09:27:44,120 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:27:44,120 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 207 [2019-05-23 09:27:44,120 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:44,121 INFO L146 ILogger]: With dead ends: 213 [2019-05-23 09:27:44,122 INFO L146 ILogger]: Without dead ends: 213 [2019-05-23 09:27:44,122 INFO L146 ILogger]: 0 DeclaredPredicates, 208 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=228, Invalid=5472, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:27:44,122 INFO L146 ILogger]: Start minimizeSevpa. Operand 213 states. [2019-05-23 09:27:44,125 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-05-23 09:27:44,125 INFO L146 ILogger]: Start removeUnreachable. Operand 211 states. [2019-05-23 09:27:44,125 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-05-23 09:27:44,125 INFO L146 ILogger]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-05-23 09:27:44,126 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:44,126 INFO L146 ILogger]: Abstraction has 211 states and 211 transitions. [2019-05-23 09:27:44,126 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:27:44,126 INFO L146 ILogger]: Start isEmpty. Operand 211 states and 211 transitions. [2019-05-23 09:27:44,127 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 211 [2019-05-23 09:27:44,127 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:44,127 INFO L146 ILogger]: trace histogram [69, 69, 68, 1, 1, 1, 1] [2019-05-23 09:27:44,127 INFO L146 ILogger]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:44,128 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:44,128 INFO L146 ILogger]: Analyzing trace with hash -1182407449, now seen corresponding path program 68 times [2019-05-23 09:27:44,128 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:44,159 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:44,167 WARN L146 ILogger]: Trace formula consists of 282 conjuncts, 143 conjunts are in the unsatisfiable core [2019-05-23 09:27:44,169 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:44,175 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 8 treesize of output 7 [2019-05-23 09:27:44,175 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:44,177 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:44,177 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,177 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:27:46,763 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:46,764 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:27:46,764 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:46,769 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:46,769 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:46,769 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:27:46,948 INFO L146 ILogger]: Checked inductivity of 7038 backedges. 0 proven. 7038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:46,948 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:46,949 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:27:46,949 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:27:46,949 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:27:46,949 INFO L146 ILogger]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:27:46,949 INFO L146 ILogger]: Start difference. First operand 211 states and 211 transitions. Second operand 75 states. [2019-05-23 09:27:57,744 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:57,744 INFO L146 ILogger]: Finished difference Result 216 states and 216 transitions. [2019-05-23 09:27:57,745 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:27:57,745 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 210 [2019-05-23 09:27:57,745 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:57,746 INFO L146 ILogger]: With dead ends: 216 [2019-05-23 09:27:57,746 INFO L146 ILogger]: Without dead ends: 216 [2019-05-23 09:27:57,747 INFO L146 ILogger]: 0 DeclaredPredicates, 211 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=231, Invalid=5621, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:27:57,747 INFO L146 ILogger]: Start minimizeSevpa. Operand 216 states. [2019-05-23 09:27:57,750 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-05-23 09:27:57,750 INFO L146 ILogger]: Start removeUnreachable. Operand 214 states. [2019-05-23 09:27:57,750 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-05-23 09:27:57,750 INFO L146 ILogger]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-05-23 09:27:57,750 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:57,751 INFO L146 ILogger]: Abstraction has 214 states and 214 transitions. [2019-05-23 09:27:57,751 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:27:57,751 INFO L146 ILogger]: Start isEmpty. Operand 214 states and 214 transitions. [2019-05-23 09:27:57,752 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 214 [2019-05-23 09:27:57,752 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:57,752 INFO L146 ILogger]: trace histogram [70, 70, 69, 1, 1, 1, 1] [2019-05-23 09:27:57,752 INFO L146 ILogger]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:57,752 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:57,753 INFO L146 ILogger]: Analyzing trace with hash -2073482881, now seen corresponding path program 69 times [2019-05-23 09:27:57,753 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:57,785 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:57,795 WARN L146 ILogger]: Trace formula consists of 286 conjuncts, 145 conjunts are in the unsatisfiable core [2019-05-23 09:27:57,797 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:57,834 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 8 treesize of output 7 [2019-05-23 09:27:57,835 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:27:57,861 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:27:57,862 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:27:57,862 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:28:00,991 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:00,992 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:28:00,992 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:00,998 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:00,999 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:00,999 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:28:01,179 INFO L146 ILogger]: Checked inductivity of 7245 backedges. 0 proven. 7245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:01,179 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:01,179 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:28:01,179 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:28:01,180 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:28:01,180 INFO L146 ILogger]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:28:01,180 INFO L146 ILogger]: Start difference. First operand 214 states and 214 transitions. Second operand 76 states. [2019-05-23 09:28:12,083 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:12,083 INFO L146 ILogger]: Finished difference Result 219 states and 219 transitions. [2019-05-23 09:28:12,083 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:28:12,084 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 213 [2019-05-23 09:28:12,084 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:12,085 INFO L146 ILogger]: With dead ends: 219 [2019-05-23 09:28:12,085 INFO L146 ILogger]: Without dead ends: 219 [2019-05-23 09:28:12,086 INFO L146 ILogger]: 0 DeclaredPredicates, 214 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=234, Invalid=5772, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:28:12,086 INFO L146 ILogger]: Start minimizeSevpa. Operand 219 states. [2019-05-23 09:28:12,088 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-05-23 09:28:12,088 INFO L146 ILogger]: Start removeUnreachable. Operand 217 states. [2019-05-23 09:28:12,088 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-05-23 09:28:12,088 INFO L146 ILogger]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-05-23 09:28:12,088 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:12,088 INFO L146 ILogger]: Abstraction has 217 states and 217 transitions. [2019-05-23 09:28:12,089 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:28:12,089 INFO L146 ILogger]: Start isEmpty. Operand 217 states and 217 transitions. [2019-05-23 09:28:12,090 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 217 [2019-05-23 09:28:12,090 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:12,090 INFO L146 ILogger]: trace histogram [71, 71, 70, 1, 1, 1, 1] [2019-05-23 09:28:12,090 INFO L146 ILogger]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:12,090 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:12,090 INFO L146 ILogger]: Analyzing trace with hash -908821017, now seen corresponding path program 70 times [2019-05-23 09:28:12,091 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:12,127 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:12,136 WARN L146 ILogger]: Trace formula consists of 290 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 09:28:12,138 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:12,174 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 8 treesize of output 7 [2019-05-23 09:28:12,175 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:12,201 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:12,201 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:12,202 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:28:15,010 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:15,011 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:28:15,011 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:15,017 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:15,017 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:15,017 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:28:15,200 INFO L146 ILogger]: Checked inductivity of 7455 backedges. 0 proven. 7455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:15,200 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:15,200 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:28:15,200 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:28:15,201 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:28:15,201 INFO L146 ILogger]: CoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:28:15,201 INFO L146 ILogger]: Start difference. First operand 217 states and 217 transitions. Second operand 77 states. [2019-05-23 09:28:26,597 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:26,598 INFO L146 ILogger]: Finished difference Result 222 states and 222 transitions. [2019-05-23 09:28:26,598 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:28:26,598 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 216 [2019-05-23 09:28:26,599 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:26,599 INFO L146 ILogger]: With dead ends: 222 [2019-05-23 09:28:26,600 INFO L146 ILogger]: Without dead ends: 222 [2019-05-23 09:28:26,600 INFO L146 ILogger]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=237, Invalid=5925, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:28:26,600 INFO L146 ILogger]: Start minimizeSevpa. Operand 222 states. [2019-05-23 09:28:26,602 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-05-23 09:28:26,603 INFO L146 ILogger]: Start removeUnreachable. Operand 220 states. [2019-05-23 09:28:26,603 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-05-23 09:28:26,603 INFO L146 ILogger]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-05-23 09:28:26,603 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:26,603 INFO L146 ILogger]: Abstraction has 220 states and 220 transitions. [2019-05-23 09:28:26,603 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:28:26,603 INFO L146 ILogger]: Start isEmpty. Operand 220 states and 220 transitions. [2019-05-23 09:28:26,604 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 220 [2019-05-23 09:28:26,604 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:26,604 INFO L146 ILogger]: trace histogram [72, 72, 71, 1, 1, 1, 1] [2019-05-23 09:28:26,605 INFO L146 ILogger]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:26,605 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:26,605 INFO L146 ILogger]: Analyzing trace with hash 786952319, now seen corresponding path program 71 times [2019-05-23 09:28:26,605 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:26,638 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:26,647 WARN L146 ILogger]: Trace formula consists of 294 conjuncts, 149 conjunts are in the unsatisfiable core [2019-05-23 09:28:26,650 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:26,680 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 8 treesize of output 7 [2019-05-23 09:28:26,680 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:26,682 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:26,682 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:26,682 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:28:29,561 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:29,561 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:28:29,562 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:29,569 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:29,569 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:29,569 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:28:29,834 INFO L146 ILogger]: Checked inductivity of 7668 backedges. 0 proven. 7668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:29,834 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:29,834 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:28:29,834 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:28:29,835 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:28:29,835 INFO L146 ILogger]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:28:29,835 INFO L146 ILogger]: Start difference. First operand 220 states and 220 transitions. Second operand 78 states. [2019-05-23 09:28:41,496 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:41,497 INFO L146 ILogger]: Finished difference Result 225 states and 225 transitions. [2019-05-23 09:28:41,497 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:28:41,497 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 219 [2019-05-23 09:28:41,497 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:41,498 INFO L146 ILogger]: With dead ends: 225 [2019-05-23 09:28:41,499 INFO L146 ILogger]: Without dead ends: 225 [2019-05-23 09:28:41,499 INFO L146 ILogger]: 0 DeclaredPredicates, 220 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=240, Invalid=6080, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:28:41,499 INFO L146 ILogger]: Start minimizeSevpa. Operand 225 states. [2019-05-23 09:28:41,501 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-05-23 09:28:41,502 INFO L146 ILogger]: Start removeUnreachable. Operand 223 states. [2019-05-23 09:28:41,502 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-05-23 09:28:41,502 INFO L146 ILogger]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-05-23 09:28:41,502 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:41,502 INFO L146 ILogger]: Abstraction has 223 states and 223 transitions. [2019-05-23 09:28:41,502 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:28:41,503 INFO L146 ILogger]: Start isEmpty. Operand 223 states and 223 transitions. [2019-05-23 09:28:41,503 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 223 [2019-05-23 09:28:41,503 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:41,503 INFO L146 ILogger]: trace histogram [73, 73, 72, 1, 1, 1, 1] [2019-05-23 09:28:41,504 INFO L146 ILogger]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:41,504 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:41,504 INFO L146 ILogger]: Analyzing trace with hash -2129897753, now seen corresponding path program 72 times [2019-05-23 09:28:41,504 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:41,543 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:41,555 WARN L146 ILogger]: Trace formula consists of 298 conjuncts, 151 conjunts are in the unsatisfiable core [2019-05-23 09:28:41,558 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:41,593 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 8 treesize of output 7 [2019-05-23 09:28:41,594 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:41,598 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:41,598 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:41,598 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:28:44,623 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:44,623 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:28:44,624 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:44,629 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:44,629 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:44,629 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:28:44,813 INFO L146 ILogger]: Checked inductivity of 7884 backedges. 0 proven. 7884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:44,814 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:44,814 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:28:44,814 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:28:44,814 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:28:44,815 INFO L146 ILogger]: CoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:28:44,815 INFO L146 ILogger]: Start difference. First operand 223 states and 223 transitions. Second operand 79 states. [2019-05-23 09:28:56,868 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:56,869 INFO L146 ILogger]: Finished difference Result 228 states and 228 transitions. [2019-05-23 09:28:56,869 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:28:56,869 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 222 [2019-05-23 09:28:56,870 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:56,871 INFO L146 ILogger]: With dead ends: 228 [2019-05-23 09:28:56,871 INFO L146 ILogger]: Without dead ends: 228 [2019-05-23 09:28:56,871 INFO L146 ILogger]: 0 DeclaredPredicates, 223 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=243, Invalid=6237, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:28:56,871 INFO L146 ILogger]: Start minimizeSevpa. Operand 228 states. [2019-05-23 09:28:56,874 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-05-23 09:28:56,874 INFO L146 ILogger]: Start removeUnreachable. Operand 226 states. [2019-05-23 09:28:56,874 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-05-23 09:28:56,875 INFO L146 ILogger]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-05-23 09:28:56,875 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:56,875 INFO L146 ILogger]: Abstraction has 226 states and 226 transitions. [2019-05-23 09:28:56,875 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:28:56,875 INFO L146 ILogger]: Start isEmpty. Operand 226 states and 226 transitions. [2019-05-23 09:28:56,876 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 226 [2019-05-23 09:28:56,876 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:56,876 INFO L146 ILogger]: trace histogram [74, 74, 73, 1, 1, 1, 1] [2019-05-23 09:28:56,877 INFO L146 ILogger]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:56,877 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:56,877 INFO L146 ILogger]: Analyzing trace with hash 2062907263, now seen corresponding path program 73 times [2019-05-23 09:28:56,877 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:56,914 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:56,923 WARN L146 ILogger]: Trace formula consists of 302 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 09:28:56,926 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:56,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 8 treesize of output 7 [2019-05-23 09:28:56,965 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:28:56,989 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:56,989 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:28:56,990 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:28:59,990 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:28:59,990 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:28:59,991 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:00,086 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:00,087 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:00,087 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:29:00,618 INFO L146 ILogger]: Checked inductivity of 8103 backedges. 0 proven. 8103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:00,618 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:00,618 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:29:00,619 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:29:00,619 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:29:00,619 INFO L146 ILogger]: CoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:29:00,619 INFO L146 ILogger]: Start difference. First operand 226 states and 226 transitions. Second operand 80 states. [2019-05-23 09:29:12,633 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:12,633 INFO L146 ILogger]: Finished difference Result 231 states and 231 transitions. [2019-05-23 09:29:12,633 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:29:12,634 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 225 [2019-05-23 09:29:12,634 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:12,635 INFO L146 ILogger]: With dead ends: 231 [2019-05-23 09:29:12,635 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:29:12,636 INFO L146 ILogger]: 0 DeclaredPredicates, 226 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=246, Invalid=6396, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:29:12,636 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:29:12,639 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-05-23 09:29:12,639 INFO L146 ILogger]: Start removeUnreachable. Operand 229 states. [2019-05-23 09:29:12,639 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-05-23 09:29:12,639 INFO L146 ILogger]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-05-23 09:29:12,640 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:12,640 INFO L146 ILogger]: Abstraction has 229 states and 229 transitions. [2019-05-23 09:29:12,640 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:29:12,640 INFO L146 ILogger]: Start isEmpty. Operand 229 states and 229 transitions. [2019-05-23 09:29:12,641 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 229 [2019-05-23 09:29:12,641 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:12,641 INFO L146 ILogger]: trace histogram [75, 75, 74, 1, 1, 1, 1] [2019-05-23 09:29:12,641 INFO L146 ILogger]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:12,642 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:12,642 INFO L146 ILogger]: Analyzing trace with hash -616730649, now seen corresponding path program 74 times [2019-05-23 09:29:12,642 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:12,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:12,688 WARN L146 ILogger]: Trace formula consists of 306 conjuncts, 155 conjunts are in the unsatisfiable core [2019-05-23 09:29:12,690 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:12,726 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 8 treesize of output 7 [2019-05-23 09:29:12,727 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:12,752 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:12,752 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:12,752 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:29:16,838 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:16,838 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:29:16,839 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:16,843 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:16,843 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:16,844 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:29:17,038 INFO L146 ILogger]: Checked inductivity of 8325 backedges. 0 proven. 8325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:17,038 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:17,038 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:29:17,038 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:29:17,039 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:29:17,039 INFO L146 ILogger]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:29:17,039 INFO L146 ILogger]: Start difference. First operand 229 states and 229 transitions. Second operand 81 states. [2019-05-23 09:29:29,625 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:29,625 INFO L146 ILogger]: Finished difference Result 234 states and 234 transitions. [2019-05-23 09:29:29,626 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:29:29,626 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 228 [2019-05-23 09:29:29,626 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:29,627 INFO L146 ILogger]: With dead ends: 234 [2019-05-23 09:29:29,627 INFO L146 ILogger]: Without dead ends: 234 [2019-05-23 09:29:29,628 INFO L146 ILogger]: 0 DeclaredPredicates, 229 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=249, Invalid=6557, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:29:29,628 INFO L146 ILogger]: Start minimizeSevpa. Operand 234 states. [2019-05-23 09:29:29,631 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-05-23 09:29:29,631 INFO L146 ILogger]: Start removeUnreachable. Operand 232 states. [2019-05-23 09:29:29,631 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-05-23 09:29:29,632 INFO L146 ILogger]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-05-23 09:29:29,632 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:29,632 INFO L146 ILogger]: Abstraction has 232 states and 232 transitions. [2019-05-23 09:29:29,632 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:29:29,632 INFO L146 ILogger]: Start isEmpty. Operand 232 states and 232 transitions. [2019-05-23 09:29:29,633 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 232 [2019-05-23 09:29:29,633 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:29,633 INFO L146 ILogger]: trace histogram [76, 76, 75, 1, 1, 1, 1] [2019-05-23 09:29:29,633 INFO L146 ILogger]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:29,634 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:29,634 INFO L146 ILogger]: Analyzing trace with hash 847363711, now seen corresponding path program 75 times [2019-05-23 09:29:29,634 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:29,671 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:29,684 WARN L146 ILogger]: Trace formula consists of 310 conjuncts, 157 conjunts are in the unsatisfiable core [2019-05-23 09:29:29,688 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:29,730 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 8 treesize of output 7 [2019-05-23 09:29:29,731 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:29,754 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:29,755 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:29,755 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:29:33,033 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:33,034 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:29:33,034 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:33,038 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:33,038 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:33,038 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:29:33,238 INFO L146 ILogger]: Checked inductivity of 8550 backedges. 0 proven. 8550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:33,239 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:33,239 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:29:33,239 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:29:33,239 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:29:33,240 INFO L146 ILogger]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:29:33,240 INFO L146 ILogger]: Start difference. First operand 232 states and 232 transitions. Second operand 82 states. [2019-05-23 09:29:45,950 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:45,950 INFO L146 ILogger]: Finished difference Result 237 states and 237 transitions. [2019-05-23 09:29:45,951 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:29:45,951 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 231 [2019-05-23 09:29:45,951 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:45,952 INFO L146 ILogger]: With dead ends: 237 [2019-05-23 09:29:45,952 INFO L146 ILogger]: Without dead ends: 237 [2019-05-23 09:29:45,953 INFO L146 ILogger]: 0 DeclaredPredicates, 232 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=252, Invalid=6720, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:29:45,953 INFO L146 ILogger]: Start minimizeSevpa. Operand 237 states. [2019-05-23 09:29:45,954 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 237 to 235. [2019-05-23 09:29:45,954 INFO L146 ILogger]: Start removeUnreachable. Operand 235 states. [2019-05-23 09:29:45,955 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-05-23 09:29:45,955 INFO L146 ILogger]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-05-23 09:29:45,955 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:45,955 INFO L146 ILogger]: Abstraction has 235 states and 235 transitions. [2019-05-23 09:29:45,955 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:29:45,955 INFO L146 ILogger]: Start isEmpty. Operand 235 states and 235 transitions. [2019-05-23 09:29:45,956 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 235 [2019-05-23 09:29:45,956 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:45,956 INFO L146 ILogger]: trace histogram [77, 77, 76, 1, 1, 1, 1] [2019-05-23 09:29:45,956 INFO L146 ILogger]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:45,956 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:45,956 INFO L146 ILogger]: Analyzing trace with hash -2005415705, now seen corresponding path program 76 times [2019-05-23 09:29:45,957 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:45,988 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:45,996 WARN L146 ILogger]: Trace formula consists of 314 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 09:29:45,998 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:46,000 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 8 treesize of output 7 [2019-05-23 09:29:46,000 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:29:46,005 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:46,005 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:46,006 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:29:49,293 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:49,294 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:29:49,294 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:49,300 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:29:49,301 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:29:49,301 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:29:49,498 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:29:49,498 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:49,498 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:29:49,498 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:29:49,499 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:29:49,499 INFO L146 ILogger]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:29:49,499 INFO L146 ILogger]: Start difference. First operand 235 states and 235 transitions. Second operand 83 states. [2019-05-23 09:30:02,401 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:02,402 INFO L146 ILogger]: Finished difference Result 240 states and 240 transitions. [2019-05-23 09:30:02,402 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:30:02,402 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 234 [2019-05-23 09:30:02,402 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:02,403 INFO L146 ILogger]: With dead ends: 240 [2019-05-23 09:30:02,404 INFO L146 ILogger]: Without dead ends: 240 [2019-05-23 09:30:02,404 INFO L146 ILogger]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=255, Invalid=6885, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:30:02,404 INFO L146 ILogger]: Start minimizeSevpa. Operand 240 states. [2019-05-23 09:30:02,406 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-05-23 09:30:02,407 INFO L146 ILogger]: Start removeUnreachable. Operand 238 states. [2019-05-23 09:30:02,407 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-05-23 09:30:02,407 INFO L146 ILogger]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-05-23 09:30:02,408 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:02,408 INFO L146 ILogger]: Abstraction has 238 states and 238 transitions. [2019-05-23 09:30:02,408 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:30:02,408 INFO L146 ILogger]: Start isEmpty. Operand 238 states and 238 transitions. [2019-05-23 09:30:02,409 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 238 [2019-05-23 09:30:02,409 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:02,409 INFO L146 ILogger]: trace histogram [78, 78, 77, 1, 1, 1, 1] [2019-05-23 09:30:02,409 INFO L146 ILogger]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:02,409 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:02,409 INFO L146 ILogger]: Analyzing trace with hash -344144513, now seen corresponding path program 77 times [2019-05-23 09:30:02,410 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:02,439 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:02,449 WARN L146 ILogger]: Trace formula consists of 318 conjuncts, 161 conjunts are in the unsatisfiable core [2019-05-23 09:30:02,451 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:02,456 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 8 treesize of output 7 [2019-05-23 09:30:02,457 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:02,460 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:02,460 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:02,460 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:30:05,666 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:05,666 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:30:05,667 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:05,671 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:05,672 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:05,672 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:30:05,873 INFO L146 ILogger]: Checked inductivity of 9009 backedges. 0 proven. 9009 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:05,873 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:05,873 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:30:05,874 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:30:05,874 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:30:05,874 INFO L146 ILogger]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:30:05,874 INFO L146 ILogger]: Start difference. First operand 238 states and 238 transitions. Second operand 84 states. [2019-05-23 09:30:18,876 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:18,877 INFO L146 ILogger]: Finished difference Result 243 states and 243 transitions. [2019-05-23 09:30:18,877 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:30:18,877 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 237 [2019-05-23 09:30:18,877 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:18,878 INFO L146 ILogger]: With dead ends: 243 [2019-05-23 09:30:18,879 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 09:30:18,879 INFO L146 ILogger]: 0 DeclaredPredicates, 238 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=258, Invalid=7052, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:30:18,879 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 09:30:18,882 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-05-23 09:30:18,882 INFO L146 ILogger]: Start removeUnreachable. Operand 241 states. [2019-05-23 09:30:18,882 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-05-23 09:30:18,882 INFO L146 ILogger]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-05-23 09:30:18,883 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:18,883 INFO L146 ILogger]: Abstraction has 241 states and 241 transitions. [2019-05-23 09:30:18,883 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:30:18,883 INFO L146 ILogger]: Start isEmpty. Operand 241 states and 241 transitions. [2019-05-23 09:30:18,884 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 241 [2019-05-23 09:30:18,884 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:18,884 INFO L146 ILogger]: trace histogram [79, 79, 78, 1, 1, 1, 1] [2019-05-23 09:30:18,884 INFO L146 ILogger]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:18,884 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:18,885 INFO L146 ILogger]: Analyzing trace with hash -322215449, now seen corresponding path program 78 times [2019-05-23 09:30:18,885 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:18,940 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:18,951 WARN L146 ILogger]: Trace formula consists of 322 conjuncts, 163 conjunts are in the unsatisfiable core [2019-05-23 09:30:18,954 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:18,982 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 8 treesize of output 7 [2019-05-23 09:30:18,983 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:19,006 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:19,007 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:19,007 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:30:22,342 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:22,342 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:30:22,343 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:22,354 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:22,354 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:22,355 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:30:22,572 INFO L146 ILogger]: Checked inductivity of 9243 backedges. 0 proven. 9243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:22,572 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:22,573 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:30:22,573 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:30:22,573 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:30:22,573 INFO L146 ILogger]: CoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:30:22,573 INFO L146 ILogger]: Start difference. First operand 241 states and 241 transitions. Second operand 85 states. [2019-05-23 09:30:35,661 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:35,661 INFO L146 ILogger]: Finished difference Result 246 states and 246 transitions. [2019-05-23 09:30:35,662 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:30:35,662 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 240 [2019-05-23 09:30:35,662 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:35,663 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 09:30:35,663 INFO L146 ILogger]: Without dead ends: 246 [2019-05-23 09:30:35,664 INFO L146 ILogger]: 0 DeclaredPredicates, 241 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=261, Invalid=7221, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:30:35,664 INFO L146 ILogger]: Start minimizeSevpa. Operand 246 states. [2019-05-23 09:30:35,666 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 246 to 244. [2019-05-23 09:30:35,666 INFO L146 ILogger]: Start removeUnreachable. Operand 244 states. [2019-05-23 09:30:35,667 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-05-23 09:30:35,667 INFO L146 ILogger]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-05-23 09:30:35,667 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:35,667 INFO L146 ILogger]: Abstraction has 244 states and 244 transitions. [2019-05-23 09:30:35,667 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:30:35,667 INFO L146 ILogger]: Start isEmpty. Operand 244 states and 244 transitions. [2019-05-23 09:30:35,668 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 244 [2019-05-23 09:30:35,668 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:35,668 INFO L146 ILogger]: trace histogram [80, 80, 79, 1, 1, 1, 1] [2019-05-23 09:30:35,668 INFO L146 ILogger]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:35,669 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:35,669 INFO L146 ILogger]: Analyzing trace with hash 131501183, now seen corresponding path program 79 times [2019-05-23 09:30:35,669 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:35,709 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:35,723 WARN L146 ILogger]: Trace formula consists of 326 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 09:30:35,726 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:35,766 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 8 treesize of output 7 [2019-05-23 09:30:35,767 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:35,789 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:35,790 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:35,790 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:30:39,381 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:39,382 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:30:39,382 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:39,388 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:39,388 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:39,389 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:30:39,610 INFO L146 ILogger]: Checked inductivity of 9480 backedges. 0 proven. 9480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:39,610 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:39,610 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:30:39,610 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:30:39,611 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:30:39,611 INFO L146 ILogger]: CoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:30:39,611 INFO L146 ILogger]: Start difference. First operand 244 states and 244 transitions. Second operand 86 states. [2019-05-23 09:30:53,343 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:53,344 INFO L146 ILogger]: Finished difference Result 249 states and 249 transitions. [2019-05-23 09:30:53,344 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:30:53,344 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 243 [2019-05-23 09:30:53,344 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:53,346 INFO L146 ILogger]: With dead ends: 249 [2019-05-23 09:30:53,346 INFO L146 ILogger]: Without dead ends: 249 [2019-05-23 09:30:53,346 INFO L146 ILogger]: 0 DeclaredPredicates, 244 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=264, Invalid=7392, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:30:53,346 INFO L146 ILogger]: Start minimizeSevpa. Operand 249 states. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 249 to 247. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Start removeUnreachable. Operand 247 states. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-05-23 09:30:53,349 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Abstraction has 247 states and 247 transitions. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:30:53,349 INFO L146 ILogger]: Start isEmpty. Operand 247 states and 247 transitions. [2019-05-23 09:30:53,350 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 247 [2019-05-23 09:30:53,350 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:53,350 INFO L146 ILogger]: trace histogram [81, 81, 80, 1, 1, 1, 1] [2019-05-23 09:30:53,351 INFO L146 ILogger]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:53,351 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:53,351 INFO L146 ILogger]: Analyzing trace with hash 541604583, now seen corresponding path program 80 times [2019-05-23 09:30:53,351 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:53,378 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:53,385 WARN L146 ILogger]: Trace formula consists of 330 conjuncts, 167 conjunts are in the unsatisfiable core [2019-05-23 09:30:53,387 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:53,392 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 8 treesize of output 7 [2019-05-23 09:30:53,392 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:30:53,396 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:53,396 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:53,396 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:30:56,764 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:56,764 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:30:56,765 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:56,770 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:30:56,771 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:30:56,771 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:30:56,987 INFO L146 ILogger]: Checked inductivity of 9720 backedges. 0 proven. 9720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:56,988 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:56,988 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:30:56,988 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:30:56,988 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:30:56,989 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:30:56,989 INFO L146 ILogger]: Start difference. First operand 247 states and 247 transitions. Second operand 87 states. [2019-05-23 09:31:10,952 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:10,952 INFO L146 ILogger]: Finished difference Result 252 states and 252 transitions. [2019-05-23 09:31:10,952 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:31:10,953 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 246 [2019-05-23 09:31:10,953 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:10,954 INFO L146 ILogger]: With dead ends: 252 [2019-05-23 09:31:10,954 INFO L146 ILogger]: Without dead ends: 252 [2019-05-23 09:31:10,955 INFO L146 ILogger]: 0 DeclaredPredicates, 247 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=267, Invalid=7565, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:31:10,955 INFO L146 ILogger]: Start minimizeSevpa. Operand 252 states. [2019-05-23 09:31:10,957 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-05-23 09:31:10,957 INFO L146 ILogger]: Start removeUnreachable. Operand 250 states. [2019-05-23 09:31:10,957 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-05-23 09:31:10,958 INFO L146 ILogger]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-05-23 09:31:10,958 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:10,958 INFO L146 ILogger]: Abstraction has 250 states and 250 transitions. [2019-05-23 09:31:10,958 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:31:10,958 INFO L146 ILogger]: Start isEmpty. Operand 250 states and 250 transitions. [2019-05-23 09:31:10,959 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 250 [2019-05-23 09:31:10,959 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:10,959 INFO L146 ILogger]: trace histogram [82, 82, 81, 1, 1, 1, 1] [2019-05-23 09:31:10,959 INFO L146 ILogger]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:10,959 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:10,959 INFO L146 ILogger]: Analyzing trace with hash -1249963137, now seen corresponding path program 81 times [2019-05-23 09:31:10,960 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:10,992 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:11,002 WARN L146 ILogger]: Trace formula consists of 334 conjuncts, 169 conjunts are in the unsatisfiable core [2019-05-23 09:31:11,003 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:11,010 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 8 treesize of output 7 [2019-05-23 09:31:11,010 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:31:11,012 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:11,012 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:11,012 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:31:14,689 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:14,689 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:31:14,690 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:14,698 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:14,698 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:14,699 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:31:14,912 INFO L146 ILogger]: Checked inductivity of 9963 backedges. 0 proven. 9963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:14,912 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:14,912 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:31:14,913 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:31:14,913 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:31:14,913 INFO L146 ILogger]: CoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:31:14,913 INFO L146 ILogger]: Start difference. First operand 250 states and 250 transitions. Second operand 88 states. [2019-05-23 09:31:29,091 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:29,092 INFO L146 ILogger]: Finished difference Result 255 states and 255 transitions. [2019-05-23 09:31:29,092 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:31:29,092 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 249 [2019-05-23 09:31:29,093 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:29,094 INFO L146 ILogger]: With dead ends: 255 [2019-05-23 09:31:29,094 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 09:31:29,094 INFO L146 ILogger]: 0 DeclaredPredicates, 250 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=270, Invalid=7740, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:31:29,095 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 09:31:29,097 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-05-23 09:31:29,097 INFO L146 ILogger]: Start removeUnreachable. Operand 253 states. [2019-05-23 09:31:29,097 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-05-23 09:31:29,097 INFO L146 ILogger]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-05-23 09:31:29,098 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:29,098 INFO L146 ILogger]: Abstraction has 253 states and 253 transitions. [2019-05-23 09:31:29,098 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:31:29,098 INFO L146 ILogger]: Start isEmpty. Operand 253 states and 253 transitions. [2019-05-23 09:31:29,099 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 253 [2019-05-23 09:31:29,099 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:29,099 INFO L146 ILogger]: trace histogram [83, 83, 82, 1, 1, 1, 1] [2019-05-23 09:31:29,099 INFO L146 ILogger]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:29,100 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:29,100 INFO L146 ILogger]: Analyzing trace with hash -285322265, now seen corresponding path program 82 times [2019-05-23 09:31:29,101 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:29,131 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:29,139 WARN L146 ILogger]: Trace formula consists of 338 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 09:31:29,140 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:29,146 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 8 treesize of output 7 [2019-05-23 09:31:29,146 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:31:29,148 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:29,148 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:29,148 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:31:32,630 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:32,630 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:31:32,631 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:32,636 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:32,637 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:32,637 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:31:32,863 INFO L146 ILogger]: Checked inductivity of 10209 backedges. 0 proven. 10209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:32,863 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:32,864 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:31:32,864 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:31:32,864 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:31:32,864 INFO L146 ILogger]: CoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:31:32,864 INFO L146 ILogger]: Start difference. First operand 253 states and 253 transitions. Second operand 89 states. [2019-05-23 09:31:47,493 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:47,493 INFO L146 ILogger]: Finished difference Result 258 states and 258 transitions. [2019-05-23 09:31:47,493 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:31:47,494 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 252 [2019-05-23 09:31:47,494 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:47,495 INFO L146 ILogger]: With dead ends: 258 [2019-05-23 09:31:47,495 INFO L146 ILogger]: Without dead ends: 258 [2019-05-23 09:31:47,496 INFO L146 ILogger]: 0 DeclaredPredicates, 253 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=273, Invalid=7917, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:31:47,496 INFO L146 ILogger]: Start minimizeSevpa. Operand 258 states. [2019-05-23 09:31:47,498 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-05-23 09:31:47,498 INFO L146 ILogger]: Start removeUnreachable. Operand 256 states. [2019-05-23 09:31:47,499 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-05-23 09:31:47,499 INFO L146 ILogger]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-05-23 09:31:47,499 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:47,499 INFO L146 ILogger]: Abstraction has 256 states and 256 transitions. [2019-05-23 09:31:47,499 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:31:47,499 INFO L146 ILogger]: Start isEmpty. Operand 256 states and 256 transitions. [2019-05-23 09:31:47,500 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 256 [2019-05-23 09:31:47,500 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:47,500 INFO L146 ILogger]: trace histogram [84, 84, 83, 1, 1, 1, 1] [2019-05-23 09:31:47,500 INFO L146 ILogger]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:47,501 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:47,501 INFO L146 ILogger]: Analyzing trace with hash -295282049, now seen corresponding path program 83 times [2019-05-23 09:31:47,501 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:47,529 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:47,537 WARN L146 ILogger]: Trace formula consists of 342 conjuncts, 173 conjunts are in the unsatisfiable core [2019-05-23 09:31:47,539 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:47,560 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 8 treesize of output 7 [2019-05-23 09:31:47,560 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:31:47,562 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:47,562 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:47,562 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:31:51,389 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:51,390 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:31:51,390 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:51,395 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:31:51,395 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:31:51,395 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:31:51,628 INFO L146 ILogger]: Checked inductivity of 10458 backedges. 0 proven. 10458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:51,628 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:51,628 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:31:51,628 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:31:51,629 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:31:51,629 INFO L146 ILogger]: CoverageRelationStatistics Valid=264, Invalid=7746, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:31:51,629 INFO L146 ILogger]: Start difference. First operand 256 states and 256 transitions. Second operand 90 states. [2019-05-23 09:32:06,590 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:06,590 INFO L146 ILogger]: Finished difference Result 261 states and 261 transitions. [2019-05-23 09:32:06,590 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:32:06,591 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 255 [2019-05-23 09:32:06,591 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:06,592 INFO L146 ILogger]: With dead ends: 261 [2019-05-23 09:32:06,592 INFO L146 ILogger]: Without dead ends: 261 [2019-05-23 09:32:06,593 INFO L146 ILogger]: 0 DeclaredPredicates, 256 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=276, Invalid=8096, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:32:06,593 INFO L146 ILogger]: Start minimizeSevpa. Operand 261 states. [2019-05-23 09:32:06,595 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 261 to 259. [2019-05-23 09:32:06,595 INFO L146 ILogger]: Start removeUnreachable. Operand 259 states. [2019-05-23 09:32:06,596 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-05-23 09:32:06,596 INFO L146 ILogger]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-05-23 09:32:06,596 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:06,596 INFO L146 ILogger]: Abstraction has 259 states and 259 transitions. [2019-05-23 09:32:06,596 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:32:06,596 INFO L146 ILogger]: Start isEmpty. Operand 259 states and 259 transitions. [2019-05-23 09:32:06,597 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 259 [2019-05-23 09:32:06,597 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:06,597 INFO L146 ILogger]: trace histogram [85, 85, 84, 1, 1, 1, 1] [2019-05-23 09:32:06,598 INFO L146 ILogger]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:06,598 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:06,598 INFO L146 ILogger]: Analyzing trace with hash -654463769, now seen corresponding path program 84 times [2019-05-23 09:32:06,598 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:06,627 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:06,639 WARN L146 ILogger]: Trace formula consists of 346 conjuncts, 175 conjunts are in the unsatisfiable core [2019-05-23 09:32:06,641 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:06,655 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 8 treesize of output 7 [2019-05-23 09:32:06,655 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:32:06,657 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:06,657 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:06,658 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:32:10,540 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:10,541 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:32:10,542 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:10,547 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:10,547 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:10,547 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:32:10,788 INFO L146 ILogger]: Checked inductivity of 10710 backedges. 0 proven. 10710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:10,788 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:10,788 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:32:10,789 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:32:10,789 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:32:10,789 INFO L146 ILogger]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:32:10,790 INFO L146 ILogger]: Start difference. First operand 259 states and 259 transitions. Second operand 91 states. [2019-05-23 09:32:26,245 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:26,246 INFO L146 ILogger]: Finished difference Result 264 states and 264 transitions. [2019-05-23 09:32:26,246 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:32:26,246 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 258 [2019-05-23 09:32:26,246 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:26,248 INFO L146 ILogger]: With dead ends: 264 [2019-05-23 09:32:26,248 INFO L146 ILogger]: Without dead ends: 264 [2019-05-23 09:32:26,248 INFO L146 ILogger]: 0 DeclaredPredicates, 259 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=279, Invalid=8277, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:32:26,248 INFO L146 ILogger]: Start minimizeSevpa. Operand 264 states. [2019-05-23 09:32:26,251 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-05-23 09:32:26,251 INFO L146 ILogger]: Start removeUnreachable. Operand 262 states. [2019-05-23 09:32:26,252 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-05-23 09:32:26,252 INFO L146 ILogger]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-05-23 09:32:26,252 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:26,252 INFO L146 ILogger]: Abstraction has 262 states and 262 transitions. [2019-05-23 09:32:26,252 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:32:26,252 INFO L146 ILogger]: Start isEmpty. Operand 262 states and 262 transitions. [2019-05-23 09:32:26,253 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 262 [2019-05-23 09:32:26,253 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:26,254 INFO L146 ILogger]: trace histogram [86, 86, 85, 1, 1, 1, 1] [2019-05-23 09:32:26,254 INFO L146 ILogger]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:26,254 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:26,254 INFO L146 ILogger]: Analyzing trace with hash 2021417343, now seen corresponding path program 85 times [2019-05-23 09:32:26,255 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:26,299 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:26,311 WARN L146 ILogger]: Trace formula consists of 350 conjuncts, 177 conjunts are in the unsatisfiable core [2019-05-23 09:32:26,314 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:26,355 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 8 treesize of output 7 [2019-05-23 09:32:26,355 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:32:26,371 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:26,371 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:26,371 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:32:30,078 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:30,079 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:32:30,079 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:30,086 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:30,086 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:30,086 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:32:30,389 INFO L146 ILogger]: Checked inductivity of 10965 backedges. 0 proven. 10965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:30,390 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:30,390 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:32:30,390 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:32:30,391 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:32:30,391 INFO L146 ILogger]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:32:30,391 INFO L146 ILogger]: Start difference. First operand 262 states and 262 transitions. Second operand 92 states. [2019-05-23 09:32:46,263 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:46,263 INFO L146 ILogger]: Finished difference Result 267 states and 267 transitions. [2019-05-23 09:32:46,264 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:32:46,264 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 261 [2019-05-23 09:32:46,264 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:46,265 INFO L146 ILogger]: With dead ends: 267 [2019-05-23 09:32:46,265 INFO L146 ILogger]: Without dead ends: 267 [2019-05-23 09:32:46,266 INFO L146 ILogger]: 0 DeclaredPredicates, 262 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=282, Invalid=8460, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:32:46,266 INFO L146 ILogger]: Start minimizeSevpa. Operand 267 states. [2019-05-23 09:32:46,269 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 267 to 265. [2019-05-23 09:32:46,269 INFO L146 ILogger]: Start removeUnreachable. Operand 265 states. [2019-05-23 09:32:46,269 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-05-23 09:32:46,270 INFO L146 ILogger]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-05-23 09:32:46,270 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:46,270 INFO L146 ILogger]: Abstraction has 265 states and 265 transitions. [2019-05-23 09:32:46,270 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:32:46,270 INFO L146 ILogger]: Start isEmpty. Operand 265 states and 265 transitions. [2019-05-23 09:32:46,271 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 265 [2019-05-23 09:32:46,271 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:46,271 INFO L146 ILogger]: trace histogram [87, 87, 86, 1, 1, 1, 1] [2019-05-23 09:32:46,272 INFO L146 ILogger]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:46,272 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:46,272 INFO L146 ILogger]: Analyzing trace with hash 307643879, now seen corresponding path program 86 times [2019-05-23 09:32:46,272 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:46,303 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:46,311 WARN L146 ILogger]: Trace formula consists of 354 conjuncts, 179 conjunts are in the unsatisfiable core [2019-05-23 09:32:46,313 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:46,318 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 8 treesize of output 7 [2019-05-23 09:32:46,318 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:32:46,321 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:46,321 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:46,321 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:32:50,204 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:50,204 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:32:50,205 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:50,209 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:32:50,210 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:32:50,210 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:32:50,447 INFO L146 ILogger]: Checked inductivity of 11223 backedges. 0 proven. 11223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:50,447 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:50,448 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:32:50,448 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:32:50,448 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:32:50,449 INFO L146 ILogger]: CoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:32:50,449 INFO L146 ILogger]: Start difference. First operand 265 states and 265 transitions. Second operand 93 states. [2019-05-23 09:33:06,702 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:06,703 INFO L146 ILogger]: Finished difference Result 270 states and 270 transitions. [2019-05-23 09:33:06,703 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:33:06,703 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 264 [2019-05-23 09:33:06,703 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:06,705 INFO L146 ILogger]: With dead ends: 270 [2019-05-23 09:33:06,705 INFO L146 ILogger]: Without dead ends: 270 [2019-05-23 09:33:06,705 INFO L146 ILogger]: 0 DeclaredPredicates, 265 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=285, Invalid=8645, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:33:06,706 INFO L146 ILogger]: Start minimizeSevpa. Operand 270 states. [2019-05-23 09:33:06,707 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 270 to 268. [2019-05-23 09:33:06,708 INFO L146 ILogger]: Start removeUnreachable. Operand 268 states. [2019-05-23 09:33:06,708 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-05-23 09:33:06,708 INFO L146 ILogger]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-05-23 09:33:06,708 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:06,708 INFO L146 ILogger]: Abstraction has 268 states and 268 transitions. [2019-05-23 09:33:06,708 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:33:06,708 INFO L146 ILogger]: Start isEmpty. Operand 268 states and 268 transitions. [2019-05-23 09:33:06,709 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 268 [2019-05-23 09:33:06,709 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:06,709 INFO L146 ILogger]: trace histogram [88, 88, 87, 1, 1, 1, 1] [2019-05-23 09:33:06,710 INFO L146 ILogger]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:06,710 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:06,710 INFO L146 ILogger]: Analyzing trace with hash -441374593, now seen corresponding path program 87 times [2019-05-23 09:33:06,710 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:06,741 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:06,750 WARN L146 ILogger]: Trace formula consists of 358 conjuncts, 181 conjunts are in the unsatisfiable core [2019-05-23 09:33:06,752 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:06,759 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 8 treesize of output 7 [2019-05-23 09:33:06,759 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:33:06,762 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:06,762 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:06,762 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:33:10,646 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:10,646 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:33:10,647 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:10,651 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:10,651 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:10,652 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:33:10,888 INFO L146 ILogger]: Checked inductivity of 11484 backedges. 0 proven. 11484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:10,888 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:10,888 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:33:10,889 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:33:10,889 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:33:10,889 INFO L146 ILogger]: CoverageRelationStatistics Valid=276, Invalid=8466, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:33:10,889 INFO L146 ILogger]: Start difference. First operand 268 states and 268 transitions. Second operand 94 states. [2019-05-23 09:33:27,497 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:27,498 INFO L146 ILogger]: Finished difference Result 273 states and 273 transitions. [2019-05-23 09:33:27,498 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:33:27,498 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 267 [2019-05-23 09:33:27,499 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:27,500 INFO L146 ILogger]: With dead ends: 273 [2019-05-23 09:33:27,500 INFO L146 ILogger]: Without dead ends: 273 [2019-05-23 09:33:27,500 INFO L146 ILogger]: 0 DeclaredPredicates, 268 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=288, Invalid=8832, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:33:27,501 INFO L146 ILogger]: Start minimizeSevpa. Operand 273 states. [2019-05-23 09:33:27,503 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-05-23 09:33:27,503 INFO L146 ILogger]: Start removeUnreachable. Operand 271 states. [2019-05-23 09:33:27,504 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-05-23 09:33:27,504 INFO L146 ILogger]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-05-23 09:33:27,504 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:27,504 INFO L146 ILogger]: Abstraction has 271 states and 271 transitions. [2019-05-23 09:33:27,504 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:33:27,504 INFO L146 ILogger]: Start isEmpty. Operand 271 states and 271 transitions. [2019-05-23 09:33:27,505 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 271 [2019-05-23 09:33:27,505 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:27,505 INFO L146 ILogger]: trace histogram [89, 89, 88, 1, 1, 1, 1] [2019-05-23 09:33:27,505 INFO L146 ILogger]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:27,505 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:27,505 INFO L146 ILogger]: Analyzing trace with hash -2095571225, now seen corresponding path program 88 times [2019-05-23 09:33:27,506 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:27,550 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:27,559 WARN L146 ILogger]: Trace formula consists of 362 conjuncts, 183 conjunts are in the unsatisfiable core [2019-05-23 09:33:27,561 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:27,571 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 8 treesize of output 7 [2019-05-23 09:33:27,571 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:33:27,576 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:27,576 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:27,576 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:33:31,523 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:31,523 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:33:31,524 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:31,528 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:31,528 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:31,528 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:33:31,936 INFO L146 ILogger]: Checked inductivity of 11748 backedges. 0 proven. 11748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:31,936 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:31,936 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:33:31,937 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:33:31,937 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:33:31,937 INFO L146 ILogger]: CoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:33:31,937 INFO L146 ILogger]: Start difference. First operand 271 states and 271 transitions. Second operand 95 states. [2019-05-23 09:33:48,699 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:48,700 INFO L146 ILogger]: Finished difference Result 276 states and 276 transitions. [2019-05-23 09:33:48,700 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:33:48,700 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 270 [2019-05-23 09:33:48,701 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:48,702 INFO L146 ILogger]: With dead ends: 276 [2019-05-23 09:33:48,702 INFO L146 ILogger]: Without dead ends: 276 [2019-05-23 09:33:48,703 INFO L146 ILogger]: 0 DeclaredPredicates, 271 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=291, Invalid=9021, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:33:48,703 INFO L146 ILogger]: Start minimizeSevpa. Operand 276 states. [2019-05-23 09:33:48,705 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 276 to 274. [2019-05-23 09:33:48,705 INFO L146 ILogger]: Start removeUnreachable. Operand 274 states. [2019-05-23 09:33:48,705 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-05-23 09:33:48,705 INFO L146 ILogger]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-05-23 09:33:48,706 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:48,706 INFO L146 ILogger]: Abstraction has 274 states and 274 transitions. [2019-05-23 09:33:48,706 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:33:48,706 INFO L146 ILogger]: Start isEmpty. Operand 274 states and 274 transitions. [2019-05-23 09:33:48,707 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 274 [2019-05-23 09:33:48,707 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:48,707 INFO L146 ILogger]: trace histogram [90, 90, 89, 1, 1, 1, 1] [2019-05-23 09:33:48,707 INFO L146 ILogger]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:48,707 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:48,707 INFO L146 ILogger]: Analyzing trace with hash -1812680833, now seen corresponding path program 89 times [2019-05-23 09:33:48,708 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:48,755 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:48,769 WARN L146 ILogger]: Trace formula consists of 366 conjuncts, 185 conjunts are in the unsatisfiable core [2019-05-23 09:33:48,771 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:48,779 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 8 treesize of output 7 [2019-05-23 09:33:48,779 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:33:48,781 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:48,781 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:48,781 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:33:53,063 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:53,064 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:33:53,064 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:53,069 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:33:53,069 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:33:53,069 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:33:53,320 INFO L146 ILogger]: Checked inductivity of 12015 backedges. 0 proven. 12015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:53,320 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:53,320 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:33:53,320 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:33:53,321 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:33:53,321 INFO L146 ILogger]: CoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:33:53,321 INFO L146 ILogger]: Start difference. First operand 274 states and 274 transitions. Second operand 96 states. [2019-05-23 09:34:10,439 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:10,439 INFO L146 ILogger]: Finished difference Result 279 states and 279 transitions. [2019-05-23 09:34:10,439 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:34:10,440 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 273 [2019-05-23 09:34:10,440 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:10,441 INFO L146 ILogger]: With dead ends: 279 [2019-05-23 09:34:10,441 INFO L146 ILogger]: Without dead ends: 279 [2019-05-23 09:34:10,442 INFO L146 ILogger]: 0 DeclaredPredicates, 274 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=294, Invalid=9212, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:34:10,442 INFO L146 ILogger]: Start minimizeSevpa. Operand 279 states. [2019-05-23 09:34:10,444 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-05-23 09:34:10,445 INFO L146 ILogger]: Start removeUnreachable. Operand 277 states. [2019-05-23 09:34:10,445 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-05-23 09:34:10,445 INFO L146 ILogger]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-05-23 09:34:10,445 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:10,445 INFO L146 ILogger]: Abstraction has 277 states and 277 transitions. [2019-05-23 09:34:10,445 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:34:10,445 INFO L146 ILogger]: Start isEmpty. Operand 277 states and 277 transitions. [2019-05-23 09:34:10,446 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 277 [2019-05-23 09:34:10,446 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:10,446 INFO L146 ILogger]: trace histogram [91, 91, 90, 1, 1, 1, 1] [2019-05-23 09:34:10,447 INFO L146 ILogger]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:10,447 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:10,447 INFO L146 ILogger]: Analyzing trace with hash -950847513, now seen corresponding path program 90 times [2019-05-23 09:34:10,447 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:10,481 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:10,490 WARN L146 ILogger]: Trace formula consists of 370 conjuncts, 187 conjunts are in the unsatisfiable core [2019-05-23 09:34:10,492 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:10,498 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 8 treesize of output 7 [2019-05-23 09:34:10,498 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:34:10,502 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:10,502 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:10,502 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:34:14,870 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:14,870 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:34:14,871 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:14,885 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:14,885 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:14,885 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:34:15,139 INFO L146 ILogger]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:15,139 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:15,140 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:34:15,140 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:34:15,140 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:34:15,140 INFO L146 ILogger]: CoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:34:15,140 INFO L146 ILogger]: Start difference. First operand 277 states and 277 transitions. Second operand 97 states. [2019-05-23 09:34:32,639 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:32,639 INFO L146 ILogger]: Finished difference Result 282 states and 282 transitions. [2019-05-23 09:34:32,639 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:34:32,639 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 276 [2019-05-23 09:34:32,640 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:32,641 INFO L146 ILogger]: With dead ends: 282 [2019-05-23 09:34:32,641 INFO L146 ILogger]: Without dead ends: 282 [2019-05-23 09:34:32,642 INFO L146 ILogger]: 0 DeclaredPredicates, 277 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=297, Invalid=9405, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:34:32,642 INFO L146 ILogger]: Start minimizeSevpa. Operand 282 states. [2019-05-23 09:34:32,644 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-05-23 09:34:32,644 INFO L146 ILogger]: Start removeUnreachable. Operand 280 states. [2019-05-23 09:34:32,644 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-05-23 09:34:32,644 INFO L146 ILogger]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-05-23 09:34:32,644 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:32,645 INFO L146 ILogger]: Abstraction has 280 states and 280 transitions. [2019-05-23 09:34:32,645 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:34:32,645 INFO L146 ILogger]: Start isEmpty. Operand 280 states and 280 transitions. [2019-05-23 09:34:32,645 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 280 [2019-05-23 09:34:32,646 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:32,646 INFO L146 ILogger]: trace histogram [92, 92, 91, 1, 1, 1, 1] [2019-05-23 09:34:32,646 INFO L146 ILogger]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:32,646 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:32,646 INFO L146 ILogger]: Analyzing trace with hash -1388906881, now seen corresponding path program 91 times [2019-05-23 09:34:32,647 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:32,682 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:32,692 WARN L146 ILogger]: Trace formula consists of 374 conjuncts, 189 conjunts are in the unsatisfiable core [2019-05-23 09:34:32,694 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:32,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 8 treesize of output 7 [2019-05-23 09:34:32,700 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:34:32,702 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:32,702 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:32,702 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:34:37,146 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:37,147 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:34:37,147 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:37,153 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:37,153 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:37,153 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:34:37,425 INFO L146 ILogger]: Checked inductivity of 12558 backedges. 0 proven. 12558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:37,425 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:37,425 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:34:37,425 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:34:37,426 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:34:37,426 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=9218, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:34:37,426 INFO L146 ILogger]: Start difference. First operand 280 states and 280 transitions. Second operand 98 states. [2019-05-23 09:34:54,953 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:54,953 INFO L146 ILogger]: Finished difference Result 285 states and 285 transitions. [2019-05-23 09:34:54,954 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:34:54,954 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 279 [2019-05-23 09:34:54,954 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:54,955 INFO L146 ILogger]: With dead ends: 285 [2019-05-23 09:34:54,955 INFO L146 ILogger]: Without dead ends: 285 [2019-05-23 09:34:54,956 INFO L146 ILogger]: 0 DeclaredPredicates, 280 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=300, Invalid=9600, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:34:54,956 INFO L146 ILogger]: Start minimizeSevpa. Operand 285 states. [2019-05-23 09:34:54,957 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-05-23 09:34:54,957 INFO L146 ILogger]: Start removeUnreachable. Operand 283 states. [2019-05-23 09:34:54,958 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-05-23 09:34:54,958 INFO L146 ILogger]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-05-23 09:34:54,958 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:54,958 INFO L146 ILogger]: Abstraction has 283 states and 283 transitions. [2019-05-23 09:34:54,958 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:34:54,958 INFO L146 ILogger]: Start isEmpty. Operand 283 states and 283 transitions. [2019-05-23 09:34:54,959 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 283 [2019-05-23 09:34:54,959 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:54,959 INFO L146 ILogger]: trace histogram [93, 93, 92, 1, 1, 1, 1] [2019-05-23 09:34:54,959 INFO L146 ILogger]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:54,960 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:54,960 INFO L146 ILogger]: Analyzing trace with hash 790073575, now seen corresponding path program 92 times [2019-05-23 09:34:54,960 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:54,994 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:55,003 WARN L146 ILogger]: Trace formula consists of 378 conjuncts, 191 conjunts are in the unsatisfiable core [2019-05-23 09:34:55,005 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:55,010 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 8 treesize of output 7 [2019-05-23 09:34:55,010 INFO L146 ILogger]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-23 09:34:55,012 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:55,012 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:55,012 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2019-05-23 09:34:59,300 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:59,301 INFO L146 ILogger]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-05-23 09:34:59,301 INFO L146 ILogger]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:59,307 INFO L146 ILogger]: treesize reduction 0, result has 100.0 percent of original size [2019-05-23 09:34:59,307 INFO L146 ILogger]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-23 09:34:59,308 INFO L146 ILogger]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-05-23 09:34:59,570 INFO L146 ILogger]: Checked inductivity of 12834 backedges. 0 proven. 12834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:59,570 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:59,570 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:34:59,571 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:34:59,571 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:34:59,571 INFO L146 ILogger]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:34:59,571 INFO L146 ILogger]: Start difference. First operand 283 states and 283 transitions. Second operand 99 states.