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/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX --icfgtransformation.map.elimination.monniaux.number.of.cells 1 -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:49:43,997 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:49:43,999 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:49:44,012 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:49:44,012 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:49:44,014 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:49:44,015 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:49:44,017 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:49:44,019 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:49:44,020 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:49:44,021 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:49:44,021 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:49:44,022 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:49:44,023 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:49:44,024 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:49:44,025 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:49:44,026 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:49:44,028 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:49:44,030 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:49:44,032 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:49:44,033 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:49:44,034 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:49:44,037 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:49:44,037 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:49:44,037 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:49:44,039 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:49:44,039 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:49:44,040 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:49:44,040 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:49:44,041 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:49:44,042 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:49:44,043 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:49:44,044 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:49:44,044 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:49:44,045 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:49:44,045 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:49:44,046 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:49:44,047 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:49:44,047 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.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: Map elimination Monniaux: number of cells -> 1 [2019-05-23 09:49:44,078 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:49:44,091 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:49:44,094 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:49:44,096 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:49:44,096 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:49:44,097 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-05-23 09:49:44,098 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-05-23 09:49:44,134 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:49:44,136 INFO L146 ILogger]: Walking toolchain with 5 elements. [2019-05-23 09:49:44,137 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:49:44,137 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:49:44,137 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:49:44,156 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,168 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,176 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:49:44,177 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:49:44,177 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:49:44,177 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:49:44,188 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,188 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,189 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,189 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,192 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,197 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,198 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,199 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:49:44,200 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:49:44,200 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:49:44,200 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:49:44,201 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (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:49:44,272 INFO L146 ILogger]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-05-23 09:49:44,273 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:49:44,273 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:49:44,657 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:49:44,657 INFO L146 ILogger]: Removed 0 assume(true) statements. [2019-05-23 09:49:44,659 INFO L146 ILogger]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44 BoogieIcfgContainer [2019-05-23 09:49:44,659 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:49:44,660 INFO L146 ILogger]: ------------------------IcfgTransformer---------------------------- [2019-05-23 09:49:44,660 INFO L146 ILogger]: Initializing IcfgTransformer... [2019-05-23 09:49:44,661 INFO L146 ILogger]: IcfgTransformer initialized [2019-05-23 09:49:44,665 INFO L146 ILogger]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,725 INFO L146 ILogger]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 09:49:44 BasicIcfg [2019-05-23 09:49:44,726 INFO L146 ILogger]: ------------------------ END IcfgTransformer---------------------------- [2019-05-23 09:49:44,727 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:49:44,727 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:49:44,730 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:49:44,730 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/3) ... [2019-05-23 09:49:44,732 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28261f9d and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:49:44, skipping insertion in model container [2019-05-23 09:49:44,732 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44" (2/3) ... [2019-05-23 09:49:44,732 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28261f9d and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:49:44, skipping insertion in model container [2019-05-23 09:49:44,733 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 09:49:44" (3/3) ... [2019-05-23 09:49:44,734 INFO L146 ILogger]: Analyzing ICFG ArrayInit02.bplME [2019-05-23 09:49:44,744 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:49:44,753 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:49:44,771 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:49:44,796 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:49:44,797 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:49:44,797 INFO L146 ILogger]: Hoare is false [2019-05-23 09:49:44,798 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:49:44,798 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:49:44,798 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:49:44,798 INFO L146 ILogger]: Difference is false [2019-05-23 09:49:44,799 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:49:44,799 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:49:44,813 INFO L146 ILogger]: Start isEmpty. Operand 8 states. [2019-05-23 09:49:44,821 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 6 [2019-05-23 09:49:44,822 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:44,823 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1] [2019-05-23 09:49:44,826 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:44,832 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:44,834 INFO L146 ILogger]: Analyzing trace with hash 68743758, now seen corresponding path program 1 times [2019-05-23 09:49:44,892 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:44,936 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:44,940 INFO L146 ILogger]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:49:44,946 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,039 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:49:45,041 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:49:45,042 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:49:45,045 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:49:45,056 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:49:45,056 INFO L146 ILogger]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:49:45,058 INFO L146 ILogger]: Start difference. First operand 8 states. Second operand 4 states. [2019-05-23 09:49:45,164 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,165 INFO L146 ILogger]: Finished difference Result 11 states and 12 transitions. [2019-05-23 09:49:45,165 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:49:45,166 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-23 09:49:45,167 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,175 INFO L146 ILogger]: With dead ends: 11 [2019-05-23 09:49:45,176 INFO L146 ILogger]: Without dead ends: 8 [2019-05-23 09:49:45,177 INFO L146 ILogger]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:49:45,190 INFO L146 ILogger]: Start minimizeSevpa. Operand 8 states. [2019-05-23 09:49:45,203 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-05-23 09:49:45,204 INFO L146 ILogger]: Start removeUnreachable. Operand 8 states. [2019-05-23 09:49:45,205 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-05-23 09:49:45,206 INFO L146 ILogger]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-05-23 09:49:45,206 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,207 INFO L146 ILogger]: Abstraction has 8 states and 9 transitions. [2019-05-23 09:49:45,207 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:49:45,207 INFO L146 ILogger]: Start isEmpty. Operand 8 states and 9 transitions. [2019-05-23 09:49:45,207 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 7 [2019-05-23 09:49:45,208 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,208 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-23 09:49:45,208 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,209 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,209 INFO L146 ILogger]: Analyzing trace with hash 2131889672, now seen corresponding path program 1 times [2019-05-23 09:49:45,210 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,225 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,227 WARN L146 ILogger]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,228 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,517 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,530 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,531 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:49:45,532 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:49:45,532 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:49:45,533 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:49:45,533 INFO L146 ILogger]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2019-05-23 09:49:45,785 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,785 INFO L146 ILogger]: Finished difference Result 11 states and 12 transitions. [2019-05-23 09:49:45,785 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:49:45,786 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 6 [2019-05-23 09:49:45,786 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,786 INFO L146 ILogger]: With dead ends: 11 [2019-05-23 09:49:45,786 INFO L146 ILogger]: Without dead ends: 11 [2019-05-23 09:49:45,787 INFO L146 ILogger]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:49:45,788 INFO L146 ILogger]: Start minimizeSevpa. Operand 11 states. [2019-05-23 09:49:45,789 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-05-23 09:49:45,789 INFO L146 ILogger]: Start removeUnreachable. Operand 10 states. [2019-05-23 09:49:45,790 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-05-23 09:49:45,790 INFO L146 ILogger]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-05-23 09:49:45,790 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,790 INFO L146 ILogger]: Abstraction has 10 states and 11 transitions. [2019-05-23 09:49:45,790 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:49:45,791 INFO L146 ILogger]: Start isEmpty. Operand 10 states and 11 transitions. [2019-05-23 09:49:45,791 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 10 [2019-05-23 09:49:45,791 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,791 INFO L146 ILogger]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:49:45,792 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,792 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,792 INFO L146 ILogger]: Analyzing trace with hash 1444841415, now seen corresponding path program 1 times [2019-05-23 09:49:45,793 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,805 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,807 INFO L146 ILogger]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,808 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,859 INFO L146 ILogger]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,859 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,860 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:49:45,860 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:49:45,860 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:49:45,861 INFO L146 ILogger]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:49:45,861 INFO L146 ILogger]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-05-23 09:49:46,013 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,013 INFO L146 ILogger]: Finished difference Result 15 states and 16 transitions. [2019-05-23 09:49:46,014 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:49:46,014 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 9 [2019-05-23 09:49:46,014 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,015 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:49:46,015 INFO L146 ILogger]: Without dead ends: 11 [2019-05-23 09:49:46,016 INFO L146 ILogger]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:46,017 INFO L146 ILogger]: Start minimizeSevpa. Operand 11 states. [2019-05-23 09:49:46,018 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-05-23 09:49:46,019 INFO L146 ILogger]: Start removeUnreachable. Operand 11 states. [2019-05-23 09:49:46,019 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-05-23 09:49:46,019 INFO L146 ILogger]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-05-23 09:49:46,020 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,020 INFO L146 ILogger]: Abstraction has 11 states and 12 transitions. [2019-05-23 09:49:46,020 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:49:46,020 INFO L146 ILogger]: Start isEmpty. Operand 11 states and 12 transitions. [2019-05-23 09:49:46,020 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 11 [2019-05-23 09:49:46,020 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,021 INFO L146 ILogger]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-05-23 09:49:46,021 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,021 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,021 INFO L146 ILogger]: Analyzing trace with hash 860829313, now seen corresponding path program 2 times [2019-05-23 09:49:46,022 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,044 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,049 INFO L146 ILogger]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,050 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,294 WARN L146 ILogger]: Spent 131.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-05-23 09:49:46,297 INFO L146 ILogger]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,297 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,297 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:49:46,297 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:49:46,298 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:49:46,298 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:46,298 INFO L146 ILogger]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-05-23 09:49:46,495 WARN L146 ILogger]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-05-23 09:49:46,654 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,654 INFO L146 ILogger]: Finished difference Result 15 states and 16 transitions. [2019-05-23 09:49:46,655 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:49:46,655 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 10 [2019-05-23 09:49:46,655 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,656 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:49:46,656 INFO L146 ILogger]: Without dead ends: 15 [2019-05-23 09:49:46,656 INFO L146 ILogger]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:49:46,657 INFO L146 ILogger]: Start minimizeSevpa. Operand 15 states. [2019-05-23 09:49:46,659 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-05-23 09:49:46,659 INFO L146 ILogger]: Start removeUnreachable. Operand 14 states. [2019-05-23 09:49:46,660 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-05-23 09:49:46,660 INFO L146 ILogger]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-05-23 09:49:46,660 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,660 INFO L146 ILogger]: Abstraction has 14 states and 15 transitions. [2019-05-23 09:49:46,660 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:49:46,661 INFO L146 ILogger]: Start isEmpty. Operand 14 states and 15 transitions. [2019-05-23 09:49:46,661 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 09:49:46,661 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,661 INFO L146 ILogger]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2019-05-23 09:49:46,662 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,662 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,662 INFO L146 ILogger]: Analyzing trace with hash -282632018, now seen corresponding path program 3 times [2019-05-23 09:49:46,663 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,679 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,681 INFO L146 ILogger]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,682 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,792 INFO L146 ILogger]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,792 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,793 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:49:46,793 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:49:46,793 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:49:46,794 INFO L146 ILogger]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:46,794 INFO L146 ILogger]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2019-05-23 09:49:46,881 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,882 INFO L146 ILogger]: Finished difference Result 22 states and 23 transitions. [2019-05-23 09:49:46,883 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:49:46,883 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 13 [2019-05-23 09:49:46,883 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,884 INFO L146 ILogger]: With dead ends: 22 [2019-05-23 09:49:46,884 INFO L146 ILogger]: Without dead ends: 15 [2019-05-23 09:49:46,884 INFO L146 ILogger]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:49:46,885 INFO L146 ILogger]: Start minimizeSevpa. Operand 15 states. [2019-05-23 09:49:46,886 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-05-23 09:49:46,887 INFO L146 ILogger]: Start removeUnreachable. Operand 15 states. [2019-05-23 09:49:46,887 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-05-23 09:49:46,887 INFO L146 ILogger]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-05-23 09:49:46,887 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,888 INFO L146 ILogger]: Abstraction has 15 states and 16 transitions. [2019-05-23 09:49:46,888 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:49:46,888 INFO L146 ILogger]: Start isEmpty. Operand 15 states and 16 transitions. [2019-05-23 09:49:46,888 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 09:49:46,888 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,889 INFO L146 ILogger]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-05-23 09:49:46,889 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,889 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,889 INFO L146 ILogger]: Analyzing trace with hash 1385046632, now seen corresponding path program 4 times [2019-05-23 09:49:46,890 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,909 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,911 INFO L146 ILogger]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,912 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,121 INFO L146 ILogger]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,121 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,122 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:49:47,122 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:49:47,122 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:49:47,123 INFO L146 ILogger]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:49:47,123 INFO L146 ILogger]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-05-23 09:49:47,289 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,290 INFO L146 ILogger]: Finished difference Result 19 states and 20 transitions. [2019-05-23 09:49:47,290 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:49:47,290 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 14 [2019-05-23 09:49:47,290 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,291 INFO L146 ILogger]: With dead ends: 19 [2019-05-23 09:49:47,292 INFO L146 ILogger]: Without dead ends: 19 [2019-05-23 09:49:47,292 INFO L146 ILogger]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:49:47,293 INFO L146 ILogger]: Start minimizeSevpa. Operand 19 states. [2019-05-23 09:49:47,295 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-05-23 09:49:47,295 INFO L146 ILogger]: Start removeUnreachable. Operand 18 states. [2019-05-23 09:49:47,296 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-05-23 09:49:47,296 INFO L146 ILogger]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-05-23 09:49:47,297 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,297 INFO L146 ILogger]: Abstraction has 18 states and 19 transitions. [2019-05-23 09:49:47,297 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:49:47,297 INFO L146 ILogger]: Start isEmpty. Operand 18 states and 19 transitions. [2019-05-23 09:49:47,298 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 18 [2019-05-23 09:49:47,298 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,298 INFO L146 ILogger]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2019-05-23 09:49:47,298 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,299 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,299 INFO L146 ILogger]: Analyzing trace with hash 174430055, now seen corresponding path program 5 times [2019-05-23 09:49:47,300 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,318 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,321 INFO L146 ILogger]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,322 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,451 INFO L146 ILogger]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,452 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,452 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:49:47,452 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:49:47,453 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:49:47,453 INFO L146 ILogger]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:49:47,453 INFO L146 ILogger]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2019-05-23 09:49:47,641 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,641 INFO L146 ILogger]: Finished difference Result 29 states and 30 transitions. [2019-05-23 09:49:47,642 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:49:47,642 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 17 [2019-05-23 09:49:47,642 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,643 INFO L146 ILogger]: With dead ends: 29 [2019-05-23 09:49:47,643 INFO L146 ILogger]: Without dead ends: 19 [2019-05-23 09:49:47,644 INFO L146 ILogger]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:47,644 INFO L146 ILogger]: Start minimizeSevpa. Operand 19 states. [2019-05-23 09:49:47,647 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-05-23 09:49:47,647 INFO L146 ILogger]: Start removeUnreachable. Operand 19 states. [2019-05-23 09:49:47,647 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-05-23 09:49:47,648 INFO L146 ILogger]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-05-23 09:49:47,648 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,648 INFO L146 ILogger]: Abstraction has 19 states and 20 transitions. [2019-05-23 09:49:47,648 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:49:47,648 INFO L146 ILogger]: Start isEmpty. Operand 19 states and 20 transitions. [2019-05-23 09:49:47,649 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 19 [2019-05-23 09:49:47,649 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,649 INFO L146 ILogger]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2019-05-23 09:49:47,649 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,649 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,650 INFO L146 ILogger]: Analyzing trace with hash -188683231, now seen corresponding path program 6 times [2019-05-23 09:49:47,650 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,672 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,675 INFO L146 ILogger]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,676 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,841 INFO L146 ILogger]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,841 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,842 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:49:47,842 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:49:47,842 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:49:47,843 INFO L146 ILogger]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:49:47,843 INFO L146 ILogger]: Start difference. First operand 19 states and 20 transitions. Second operand 12 states. [2019-05-23 09:49:48,031 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,031 INFO L146 ILogger]: Finished difference Result 23 states and 24 transitions. [2019-05-23 09:49:48,042 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:49:48,042 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 18 [2019-05-23 09:49:48,042 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,043 INFO L146 ILogger]: With dead ends: 23 [2019-05-23 09:49:48,043 INFO L146 ILogger]: Without dead ends: 23 [2019-05-23 09:49:48,044 INFO L146 ILogger]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:49:48,044 INFO L146 ILogger]: Start minimizeSevpa. Operand 23 states. [2019-05-23 09:49:48,046 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-05-23 09:49:48,046 INFO L146 ILogger]: Start removeUnreachable. Operand 22 states. [2019-05-23 09:49:48,046 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-05-23 09:49:48,047 INFO L146 ILogger]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2019-05-23 09:49:48,047 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,047 INFO L146 ILogger]: Abstraction has 22 states and 23 transitions. [2019-05-23 09:49:48,047 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:49:48,047 INFO L146 ILogger]: Start isEmpty. Operand 22 states and 23 transitions. [2019-05-23 09:49:48,048 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 09:49:48,048 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,048 INFO L146 ILogger]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2019-05-23 09:49:48,049 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,049 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,049 INFO L146 ILogger]: Analyzing trace with hash 1051084558, now seen corresponding path program 7 times [2019-05-23 09:49:48,050 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,075 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,077 INFO L146 ILogger]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,078 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,199 INFO L146 ILogger]: Checked inductivity of 36 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,199 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,199 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:49:48,199 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:49:48,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:49:48,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:49:48,200 INFO L146 ILogger]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2019-05-23 09:49:48,346 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,346 INFO L146 ILogger]: Finished difference Result 36 states and 37 transitions. [2019-05-23 09:49:48,347 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:49:48,347 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 21 [2019-05-23 09:49:48,347 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,347 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 09:49:48,348 INFO L146 ILogger]: Without dead ends: 23 [2019-05-23 09:49:48,348 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:49:48,348 INFO L146 ILogger]: Start minimizeSevpa. Operand 23 states. [2019-05-23 09:49:48,351 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-05-23 09:49:48,352 INFO L146 ILogger]: Start removeUnreachable. Operand 23 states. [2019-05-23 09:49:48,352 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-05-23 09:49:48,352 INFO L146 ILogger]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2019-05-23 09:49:48,353 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,353 INFO L146 ILogger]: Abstraction has 23 states and 24 transitions. [2019-05-23 09:49:48,353 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:49:48,353 INFO L146 ILogger]: Start isEmpty. Operand 23 states and 24 transitions. [2019-05-23 09:49:48,354 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 09:49:48,354 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,354 INFO L146 ILogger]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-05-23 09:49:48,354 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,354 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,355 INFO L146 ILogger]: Analyzing trace with hash 762621640, now seen corresponding path program 8 times [2019-05-23 09:49:48,356 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,378 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,381 INFO L146 ILogger]: Trace formula consists of 57 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,386 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,593 INFO L146 ILogger]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,593 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,593 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:49:48,594 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:49:48,594 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:49:48,594 INFO L146 ILogger]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:48,594 INFO L146 ILogger]: Start difference. First operand 23 states and 24 transitions. Second operand 14 states. [2019-05-23 09:49:49,440 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:49,440 INFO L146 ILogger]: Finished difference Result 27 states and 28 transitions. [2019-05-23 09:49:49,440 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:49:49,441 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 22 [2019-05-23 09:49:49,441 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:49,441 INFO L146 ILogger]: With dead ends: 27 [2019-05-23 09:49:49,442 INFO L146 ILogger]: Without dead ends: 27 [2019-05-23 09:49:49,442 INFO L146 ILogger]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:49:49,442 INFO L146 ILogger]: Start minimizeSevpa. Operand 27 states. [2019-05-23 09:49:49,445 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-05-23 09:49:49,445 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 09:49:49,446 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-05-23 09:49:49,446 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2019-05-23 09:49:49,446 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:49,446 INFO L146 ILogger]: Abstraction has 26 states and 27 transitions. [2019-05-23 09:49:49,446 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:49:49,447 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 27 transitions. [2019-05-23 09:49:49,447 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 26 [2019-05-23 09:49:49,447 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:49,447 INFO L146 ILogger]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2019-05-23 09:49:49,448 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:49,448 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:49,448 INFO L146 ILogger]: Analyzing trace with hash -1114689785, now seen corresponding path program 9 times [2019-05-23 09:49:49,449 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:49,466 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:49,468 INFO L146 ILogger]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:49:49,470 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:49,734 INFO L146 ILogger]: Checked inductivity of 55 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:49,735 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:49,735 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:49:49,735 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:49:49,736 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:49:49,736 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:49,736 INFO L146 ILogger]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-05-23 09:49:49,864 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:49,864 INFO L146 ILogger]: Finished difference Result 43 states and 44 transitions. [2019-05-23 09:49:49,864 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:49:49,865 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 25 [2019-05-23 09:49:49,865 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:49,866 INFO L146 ILogger]: With dead ends: 43 [2019-05-23 09:49:49,866 INFO L146 ILogger]: Without dead ends: 27 [2019-05-23 09:49:49,867 INFO L146 ILogger]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:49,867 INFO L146 ILogger]: Start minimizeSevpa. Operand 27 states. [2019-05-23 09:49:49,869 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-05-23 09:49:49,869 INFO L146 ILogger]: Start removeUnreachable. Operand 27 states. [2019-05-23 09:49:49,869 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-05-23 09:49:49,870 INFO L146 ILogger]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2019-05-23 09:49:49,870 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:49,870 INFO L146 ILogger]: Abstraction has 27 states and 28 transitions. [2019-05-23 09:49:49,870 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:49:49,870 INFO L146 ILogger]: Start isEmpty. Operand 27 states and 28 transitions. [2019-05-23 09:49:49,871 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 09:49:49,871 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:49,871 INFO L146 ILogger]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2019-05-23 09:49:49,871 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:49,871 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:49,872 INFO L146 ILogger]: Analyzing trace with hash 1259284929, now seen corresponding path program 10 times [2019-05-23 09:49:49,872 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:49,901 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:49,908 INFO L146 ILogger]: Trace formula consists of 67 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 09:49:49,912 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,155 INFO L146 ILogger]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,156 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,156 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:49:50,156 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:49:50,157 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:49:50,157 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:49:50,157 INFO L146 ILogger]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-05-23 09:49:50,506 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:50,506 INFO L146 ILogger]: Finished difference Result 31 states and 32 transitions. [2019-05-23 09:49:50,507 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:49:50,507 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 26 [2019-05-23 09:49:50,507 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:50,508 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 09:49:50,508 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 09:49:50,509 INFO L146 ILogger]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:49:50,509 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 09:49:50,512 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-05-23 09:49:50,512 INFO L146 ILogger]: Start removeUnreachable. Operand 30 states. [2019-05-23 09:49:50,512 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-05-23 09:49:50,513 INFO L146 ILogger]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2019-05-23 09:49:50,513 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:50,513 INFO L146 ILogger]: Abstraction has 30 states and 31 transitions. [2019-05-23 09:49:50,513 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:49:50,513 INFO L146 ILogger]: Start isEmpty. Operand 30 states and 31 transitions. [2019-05-23 09:49:50,514 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 30 [2019-05-23 09:49:50,514 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:50,514 INFO L146 ILogger]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1] [2019-05-23 09:49:50,515 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:50,515 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:50,515 INFO L146 ILogger]: Analyzing trace with hash -1180981906, now seen corresponding path program 11 times [2019-05-23 09:49:50,516 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:50,553 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:50,559 INFO L146 ILogger]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:49:50,561 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,766 INFO L146 ILogger]: Checked inductivity of 78 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,766 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,767 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:49:50,767 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:49:50,767 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:49:50,768 INFO L146 ILogger]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:49:50,768 INFO L146 ILogger]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-05-23 09:49:51,190 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:51,191 INFO L146 ILogger]: Finished difference Result 50 states and 51 transitions. [2019-05-23 09:49:51,194 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:49:51,194 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 29 [2019-05-23 09:49:51,194 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:51,195 INFO L146 ILogger]: With dead ends: 50 [2019-05-23 09:49:51,195 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 09:49:51,195 INFO L146 ILogger]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:49:51,196 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 09:49:51,197 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-05-23 09:49:51,198 INFO L146 ILogger]: Start removeUnreachable. Operand 31 states. [2019-05-23 09:49:51,198 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-05-23 09:49:51,198 INFO L146 ILogger]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-05-23 09:49:51,199 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:51,199 INFO L146 ILogger]: Abstraction has 31 states and 32 transitions. [2019-05-23 09:49:51,199 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:49:51,199 INFO L146 ILogger]: Start isEmpty. Operand 31 states and 32 transitions. [2019-05-23 09:49:51,200 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 31 [2019-05-23 09:49:51,200 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:51,200 INFO L146 ILogger]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2019-05-23 09:49:51,200 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:51,200 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:51,201 INFO L146 ILogger]: Analyzing trace with hash 1019982632, now seen corresponding path program 12 times [2019-05-23 09:49:51,201 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:51,220 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:51,221 INFO L146 ILogger]: Trace formula consists of 77 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:49:51,223 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:51,754 INFO L146 ILogger]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:51,754 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:51,754 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:49:51,755 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:49:51,755 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:49:51,755 INFO L146 ILogger]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:49:51,755 INFO L146 ILogger]: Start difference. First operand 31 states and 32 transitions. Second operand 18 states. [2019-05-23 09:49:52,056 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:52,056 INFO L146 ILogger]: Finished difference Result 35 states and 36 transitions. [2019-05-23 09:49:52,057 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:49:52,057 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 30 [2019-05-23 09:49:52,057 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:52,058 INFO L146 ILogger]: With dead ends: 35 [2019-05-23 09:49:52,058 INFO L146 ILogger]: Without dead ends: 35 [2019-05-23 09:49:52,059 INFO L146 ILogger]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:49:52,059 INFO L146 ILogger]: Start minimizeSevpa. Operand 35 states. [2019-05-23 09:49:52,062 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-05-23 09:49:52,062 INFO L146 ILogger]: Start removeUnreachable. Operand 34 states. [2019-05-23 09:49:52,063 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-05-23 09:49:52,063 INFO L146 ILogger]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2019-05-23 09:49:52,063 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:52,063 INFO L146 ILogger]: Abstraction has 34 states and 35 transitions. [2019-05-23 09:49:52,063 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:49:52,064 INFO L146 ILogger]: Start isEmpty. Operand 34 states and 35 transitions. [2019-05-23 09:49:52,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 34 [2019-05-23 09:49:52,064 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:52,065 INFO L146 ILogger]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1] [2019-05-23 09:49:52,065 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:52,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:52,065 INFO L146 ILogger]: Analyzing trace with hash -590000473, now seen corresponding path program 13 times [2019-05-23 09:49:52,066 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:52,081 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:52,083 INFO L146 ILogger]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:49:52,084 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:52,244 INFO L146 ILogger]: Checked inductivity of 105 backedges. 77 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:52,245 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:52,245 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:49:52,245 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:49:52,245 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:49:52,246 INFO L146 ILogger]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:49:52,246 INFO L146 ILogger]: Start difference. First operand 34 states and 35 transitions. Second operand 18 states. [2019-05-23 09:49:52,447 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:52,447 INFO L146 ILogger]: Finished difference Result 57 states and 58 transitions. [2019-05-23 09:49:52,448 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:49:52,448 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 33 [2019-05-23 09:49:52,448 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:52,449 INFO L146 ILogger]: With dead ends: 57 [2019-05-23 09:49:52,449 INFO L146 ILogger]: Without dead ends: 35 [2019-05-23 09:49:52,450 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:52,451 INFO L146 ILogger]: Start minimizeSevpa. Operand 35 states. [2019-05-23 09:49:52,452 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-05-23 09:49:52,453 INFO L146 ILogger]: Start removeUnreachable. Operand 35 states. [2019-05-23 09:49:52,453 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-05-23 09:49:52,453 INFO L146 ILogger]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2019-05-23 09:49:52,454 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:52,454 INFO L146 ILogger]: Abstraction has 35 states and 36 transitions. [2019-05-23 09:49:52,454 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:49:52,454 INFO L146 ILogger]: Start isEmpty. Operand 35 states and 36 transitions. [2019-05-23 09:49:52,455 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 35 [2019-05-23 09:49:52,455 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:52,455 INFO L146 ILogger]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2019-05-23 09:49:52,455 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:52,455 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:52,455 INFO L146 ILogger]: Analyzing trace with hash 158592865, now seen corresponding path program 14 times [2019-05-23 09:49:52,456 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:52,473 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:52,475 INFO L146 ILogger]: Trace formula consists of 87 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 09:49:52,477 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:52,725 INFO L146 ILogger]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:52,725 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:52,725 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:49:52,726 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:49:52,726 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:49:52,726 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:52,727 INFO L146 ILogger]: Start difference. First operand 35 states and 36 transitions. Second operand 20 states. [2019-05-23 09:49:53,154 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:53,154 INFO L146 ILogger]: Finished difference Result 39 states and 40 transitions. [2019-05-23 09:49:53,155 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:49:53,155 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 34 [2019-05-23 09:49:53,155 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:53,156 INFO L146 ILogger]: With dead ends: 39 [2019-05-23 09:49:53,156 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 09:49:53,157 INFO L146 ILogger]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:49:53,157 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 09:49:53,160 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-05-23 09:49:53,160 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 09:49:53,161 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-05-23 09:49:53,161 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2019-05-23 09:49:53,161 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:53,161 INFO L146 ILogger]: Abstraction has 38 states and 39 transitions. [2019-05-23 09:49:53,162 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:49:53,162 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 39 transitions. [2019-05-23 09:49:53,163 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:49:53,163 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:53,163 INFO L146 ILogger]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1] [2019-05-23 09:49:53,163 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:53,163 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:53,164 INFO L146 ILogger]: Analyzing trace with hash 177044430, now seen corresponding path program 15 times [2019-05-23 09:49:53,164 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:53,181 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:53,183 INFO L146 ILogger]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:49:53,185 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:53,645 INFO L146 ILogger]: Checked inductivity of 136 backedges. 100 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:53,645 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:53,646 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:49:53,646 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:49:53,646 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:49:53,647 INFO L146 ILogger]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:53,647 INFO L146 ILogger]: Start difference. First operand 38 states and 39 transitions. Second operand 20 states. [2019-05-23 09:49:53,902 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:53,902 INFO L146 ILogger]: Finished difference Result 64 states and 65 transitions. [2019-05-23 09:49:53,902 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:49:53,902 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 37 [2019-05-23 09:49:53,902 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:53,903 INFO L146 ILogger]: With dead ends: 64 [2019-05-23 09:49:53,903 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 09:49:53,904 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:49:53,904 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 09:49:53,907 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-05-23 09:49:53,907 INFO L146 ILogger]: Start removeUnreachable. Operand 39 states. [2019-05-23 09:49:53,907 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-05-23 09:49:53,908 INFO L146 ILogger]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2019-05-23 09:49:53,908 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:53,908 INFO L146 ILogger]: Abstraction has 39 states and 40 transitions. [2019-05-23 09:49:53,908 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:49:53,908 INFO L146 ILogger]: Start isEmpty. Operand 39 states and 40 transitions. [2019-05-23 09:49:53,909 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 39 [2019-05-23 09:49:53,909 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:53,909 INFO L146 ILogger]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2019-05-23 09:49:53,909 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:53,909 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:53,910 INFO L146 ILogger]: Analyzing trace with hash -1860620408, now seen corresponding path program 16 times [2019-05-23 09:49:53,910 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:53,927 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:53,929 INFO L146 ILogger]: Trace formula consists of 97 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 09:49:53,931 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:54,349 INFO L146 ILogger]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:54,349 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:54,349 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:49:54,350 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:49:54,350 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:49:54,350 INFO L146 ILogger]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:49:54,350 INFO L146 ILogger]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2019-05-23 09:49:55,229 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,230 INFO L146 ILogger]: Finished difference Result 43 states and 44 transitions. [2019-05-23 09:49:55,230 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:49:55,230 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 38 [2019-05-23 09:49:55,231 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,231 INFO L146 ILogger]: With dead ends: 43 [2019-05-23 09:49:55,231 INFO L146 ILogger]: Without dead ends: 43 [2019-05-23 09:49:55,232 INFO L146 ILogger]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:49:55,232 INFO L146 ILogger]: Start minimizeSevpa. Operand 43 states. [2019-05-23 09:49:55,234 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-05-23 09:49:55,234 INFO L146 ILogger]: Start removeUnreachable. Operand 42 states. [2019-05-23 09:49:55,235 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-05-23 09:49:55,235 INFO L146 ILogger]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2019-05-23 09:49:55,235 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,235 INFO L146 ILogger]: Abstraction has 42 states and 43 transitions. [2019-05-23 09:49:55,235 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:49:55,235 INFO L146 ILogger]: Start isEmpty. Operand 42 states and 43 transitions. [2019-05-23 09:49:55,236 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 42 [2019-05-23 09:49:55,236 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,236 INFO L146 ILogger]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2019-05-23 09:49:55,236 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,236 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,236 INFO L146 ILogger]: Analyzing trace with hash 1106376263, now seen corresponding path program 17 times [2019-05-23 09:49:55,237 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,251 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,253 INFO L146 ILogger]: Trace formula consists of 103 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:49:55,254 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:55,533 INFO L146 ILogger]: Checked inductivity of 171 backedges. 126 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:55,533 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:55,533 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:49:55,533 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:49:55,534 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:49:55,534 INFO L146 ILogger]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:49:55,534 INFO L146 ILogger]: Start difference. First operand 42 states and 43 transitions. Second operand 22 states. [2019-05-23 09:49:55,790 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,791 INFO L146 ILogger]: Finished difference Result 71 states and 72 transitions. [2019-05-23 09:49:55,791 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:49:55,791 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 41 [2019-05-23 09:49:55,791 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,792 INFO L146 ILogger]: With dead ends: 71 [2019-05-23 09:49:55,792 INFO L146 ILogger]: Without dead ends: 43 [2019-05-23 09:49:55,793 INFO L146 ILogger]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:49:55,794 INFO L146 ILogger]: Start minimizeSevpa. Operand 43 states. [2019-05-23 09:49:55,796 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-05-23 09:49:55,796 INFO L146 ILogger]: Start removeUnreachable. Operand 43 states. [2019-05-23 09:49:55,796 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-05-23 09:49:55,796 INFO L146 ILogger]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-05-23 09:49:55,797 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,797 INFO L146 ILogger]: Abstraction has 43 states and 44 transitions. [2019-05-23 09:49:55,797 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:49:55,797 INFO L146 ILogger]: Start isEmpty. Operand 43 states and 44 transitions. [2019-05-23 09:49:55,798 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 09:49:55,798 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,798 INFO L146 ILogger]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2019-05-23 09:49:55,798 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,798 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,799 INFO L146 ILogger]: Analyzing trace with hash 1873362177, now seen corresponding path program 18 times [2019-05-23 09:49:55,799 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,816 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,818 INFO L146 ILogger]: Trace formula consists of 107 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:49:55,820 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:56,210 INFO L146 ILogger]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:56,210 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:56,210 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:49:56,211 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:49:56,211 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:49:56,211 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:49:56,211 INFO L146 ILogger]: Start difference. First operand 43 states and 44 transitions. Second operand 24 states. [2019-05-23 09:49:56,951 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:56,951 INFO L146 ILogger]: Finished difference Result 47 states and 48 transitions. [2019-05-23 09:49:56,952 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:49:56,952 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 42 [2019-05-23 09:49:56,952 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:56,961 INFO L146 ILogger]: With dead ends: 47 [2019-05-23 09:49:56,961 INFO L146 ILogger]: Without dead ends: 47 [2019-05-23 09:49:56,962 INFO L146 ILogger]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:49:56,962 INFO L146 ILogger]: Start minimizeSevpa. Operand 47 states. [2019-05-23 09:49:56,964 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-05-23 09:49:56,964 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 09:49:56,965 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-05-23 09:49:56,965 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 42 [2019-05-23 09:49:56,965 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:56,966 INFO L146 ILogger]: Abstraction has 46 states and 47 transitions. [2019-05-23 09:49:56,966 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:49:56,966 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 47 transitions. [2019-05-23 09:49:56,966 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 46 [2019-05-23 09:49:56,967 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:56,967 INFO L146 ILogger]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2019-05-23 09:49:56,967 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:56,967 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:56,967 INFO L146 ILogger]: Analyzing trace with hash 528599598, now seen corresponding path program 19 times [2019-05-23 09:49:56,968 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:56,982 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:56,984 INFO L146 ILogger]: Trace formula consists of 113 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:49:56,986 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:57,303 INFO L146 ILogger]: Checked inductivity of 210 backedges. 155 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:57,303 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:57,303 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:49:57,304 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:49:57,304 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:49:57,304 INFO L146 ILogger]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:49:57,304 INFO L146 ILogger]: Start difference. First operand 46 states and 47 transitions. Second operand 24 states. [2019-05-23 09:49:57,589 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:57,589 INFO L146 ILogger]: Finished difference Result 78 states and 79 transitions. [2019-05-23 09:49:57,590 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:49:57,590 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 45 [2019-05-23 09:49:57,590 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:57,590 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:49:57,591 INFO L146 ILogger]: Without dead ends: 47 [2019-05-23 09:49:57,592 INFO L146 ILogger]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:49:57,592 INFO L146 ILogger]: Start minimizeSevpa. Operand 47 states. [2019-05-23 09:49:57,594 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-05-23 09:49:57,594 INFO L146 ILogger]: Start removeUnreachable. Operand 47 states. [2019-05-23 09:49:57,595 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-05-23 09:49:57,595 INFO L146 ILogger]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2019-05-23 09:49:57,595 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:57,595 INFO L146 ILogger]: Abstraction has 47 states and 48 transitions. [2019-05-23 09:49:57,595 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:49:57,595 INFO L146 ILogger]: Start isEmpty. Operand 47 states and 48 transitions. [2019-05-23 09:49:57,596 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 47 [2019-05-23 09:49:57,596 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:57,596 INFO L146 ILogger]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2019-05-23 09:49:57,596 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:57,597 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:57,597 INFO L146 ILogger]: Analyzing trace with hash 2120426472, now seen corresponding path program 20 times [2019-05-23 09:49:57,597 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:57,615 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:57,617 INFO L146 ILogger]: Trace formula consists of 117 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 09:49:57,619 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:58,136 INFO L146 ILogger]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:58,137 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:58,137 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:49:58,137 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:49:58,137 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:49:58,138 INFO L146 ILogger]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:58,138 INFO L146 ILogger]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2019-05-23 09:49:58,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:58,752 INFO L146 ILogger]: Finished difference Result 51 states and 52 transitions. [2019-05-23 09:49:58,755 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:49:58,756 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 46 [2019-05-23 09:49:58,756 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:58,756 INFO L146 ILogger]: With dead ends: 51 [2019-05-23 09:49:58,757 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:49:58,757 INFO L146 ILogger]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:49:58,758 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:49:58,760 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-05-23 09:49:58,760 INFO L146 ILogger]: Start removeUnreachable. Operand 50 states. [2019-05-23 09:49:58,760 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-05-23 09:49:58,761 INFO L146 ILogger]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2019-05-23 09:49:58,761 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:58,761 INFO L146 ILogger]: Abstraction has 50 states and 51 transitions. [2019-05-23 09:49:58,761 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:49:58,761 INFO L146 ILogger]: Start isEmpty. Operand 50 states and 51 transitions. [2019-05-23 09:49:58,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:49:58,762 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:58,762 INFO L146 ILogger]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1] [2019-05-23 09:49:58,762 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:58,762 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:58,763 INFO L146 ILogger]: Analyzing trace with hash -752933401, now seen corresponding path program 21 times [2019-05-23 09:49:58,763 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:58,778 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:58,780 INFO L146 ILogger]: Trace formula consists of 123 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:49:58,782 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:59,172 INFO L146 ILogger]: Checked inductivity of 253 backedges. 187 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:59,173 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:59,173 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:49:59,173 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:49:59,173 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:49:59,174 INFO L146 ILogger]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:59,174 INFO L146 ILogger]: Start difference. First operand 50 states and 51 transitions. Second operand 26 states. [2019-05-23 09:49:59,465 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:59,465 INFO L146 ILogger]: Finished difference Result 85 states and 86 transitions. [2019-05-23 09:49:59,465 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:49:59,465 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 49 [2019-05-23 09:49:59,466 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:59,466 INFO L146 ILogger]: With dead ends: 85 [2019-05-23 09:49:59,466 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:49:59,467 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:49:59,468 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:49:59,470 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-05-23 09:49:59,470 INFO L146 ILogger]: Start removeUnreachable. Operand 51 states. [2019-05-23 09:49:59,470 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-05-23 09:49:59,471 INFO L146 ILogger]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 49 [2019-05-23 09:49:59,471 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:59,471 INFO L146 ILogger]: Abstraction has 51 states and 52 transitions. [2019-05-23 09:49:59,471 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:49:59,471 INFO L146 ILogger]: Start isEmpty. Operand 51 states and 52 transitions. [2019-05-23 09:49:59,472 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 09:49:59,472 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:59,472 INFO L146 ILogger]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2019-05-23 09:49:59,472 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:59,473 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:59,473 INFO L146 ILogger]: Analyzing trace with hash -907472223, now seen corresponding path program 22 times [2019-05-23 09:49:59,473 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:59,490 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:59,492 INFO L146 ILogger]: Trace formula consists of 127 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 09:49:59,495 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:00,030 INFO L146 ILogger]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:00,031 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:00,031 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:50:00,031 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:50:00,031 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:50:00,032 INFO L146 ILogger]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:50:00,032 INFO L146 ILogger]: Start difference. First operand 51 states and 52 transitions. Second operand 28 states. [2019-05-23 09:50:00,738 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:00,738 INFO L146 ILogger]: Finished difference Result 55 states and 56 transitions. [2019-05-23 09:50:00,739 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:50:00,739 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 50 [2019-05-23 09:50:00,739 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:00,740 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 09:50:00,740 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:50:00,741 INFO L146 ILogger]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:50:00,741 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:50:00,744 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-05-23 09:50:00,744 INFO L146 ILogger]: Start removeUnreachable. Operand 54 states. [2019-05-23 09:50:00,744 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-05-23 09:50:00,744 INFO L146 ILogger]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2019-05-23 09:50:00,745 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:00,745 INFO L146 ILogger]: Abstraction has 54 states and 55 transitions. [2019-05-23 09:50:00,745 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:50:00,745 INFO L146 ILogger]: Start isEmpty. Operand 54 states and 55 transitions. [2019-05-23 09:50:00,745 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 54 [2019-05-23 09:50:00,746 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:00,746 INFO L146 ILogger]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1] [2019-05-23 09:50:00,746 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:00,746 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:00,746 INFO L146 ILogger]: Analyzing trace with hash -1979805554, now seen corresponding path program 23 times [2019-05-23 09:50:00,747 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:00,761 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:00,763 INFO L146 ILogger]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:50:00,765 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:01,057 INFO L146 ILogger]: Checked inductivity of 300 backedges. 222 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:01,058 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:01,058 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:50:01,058 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:50:01,058 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:50:01,059 INFO L146 ILogger]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:50:01,059 INFO L146 ILogger]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2019-05-23 09:50:01,471 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:01,471 INFO L146 ILogger]: Finished difference Result 92 states and 93 transitions. [2019-05-23 09:50:01,471 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:50:01,471 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 53 [2019-05-23 09:50:01,472 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:01,472 INFO L146 ILogger]: With dead ends: 92 [2019-05-23 09:50:01,472 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:50:01,473 INFO L146 ILogger]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:50:01,473 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:50:01,476 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-05-23 09:50:01,476 INFO L146 ILogger]: Start removeUnreachable. Operand 55 states. [2019-05-23 09:50:01,476 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-05-23 09:50:01,476 INFO L146 ILogger]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-05-23 09:50:01,477 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:01,477 INFO L146 ILogger]: Abstraction has 55 states and 56 transitions. [2019-05-23 09:50:01,477 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:50:01,477 INFO L146 ILogger]: Start isEmpty. Operand 55 states and 56 transitions. [2019-05-23 09:50:01,478 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 55 [2019-05-23 09:50:01,478 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:01,478 INFO L146 ILogger]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2019-05-23 09:50:01,478 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:01,478 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:01,478 INFO L146 ILogger]: Analyzing trace with hash -63991736, now seen corresponding path program 24 times [2019-05-23 09:50:01,479 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:01,496 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:01,498 INFO L146 ILogger]: Trace formula consists of 137 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:50:01,500 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:02,063 INFO L146 ILogger]: Checked inductivity of 313 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:02,063 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:02,063 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:50:02,063 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:50:02,063 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:50:02,064 INFO L146 ILogger]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:50:02,064 INFO L146 ILogger]: Start difference. First operand 55 states and 56 transitions. Second operand 30 states. [2019-05-23 09:50:02,837 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:02,837 INFO L146 ILogger]: Finished difference Result 59 states and 60 transitions. [2019-05-23 09:50:02,837 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:50:02,838 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 54 [2019-05-23 09:50:02,838 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:02,839 INFO L146 ILogger]: With dead ends: 59 [2019-05-23 09:50:02,839 INFO L146 ILogger]: Without dead ends: 59 [2019-05-23 09:50:02,840 INFO L146 ILogger]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:50:02,840 INFO L146 ILogger]: Start minimizeSevpa. Operand 59 states. [2019-05-23 09:50:02,843 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-05-23 09:50:02,843 INFO L146 ILogger]: Start removeUnreachable. Operand 58 states. [2019-05-23 09:50:02,844 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-05-23 09:50:02,844 INFO L146 ILogger]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2019-05-23 09:50:02,844 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:02,844 INFO L146 ILogger]: Abstraction has 58 states and 59 transitions. [2019-05-23 09:50:02,844 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:50:02,844 INFO L146 ILogger]: Start isEmpty. Operand 58 states and 59 transitions. [2019-05-23 09:50:02,845 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:50:02,845 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:02,845 INFO L146 ILogger]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1] [2019-05-23 09:50:02,845 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:02,845 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:02,846 INFO L146 ILogger]: Analyzing trace with hash 588701063, now seen corresponding path program 25 times [2019-05-23 09:50:02,846 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:02,860 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:02,863 INFO L146 ILogger]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:50:02,864 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:03,562 INFO L146 ILogger]: Checked inductivity of 351 backedges. 260 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:03,562 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:03,562 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:50:03,563 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:50:03,563 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:50:03,563 INFO L146 ILogger]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:50:03,563 INFO L146 ILogger]: Start difference. First operand 58 states and 59 transitions. Second operand 30 states. [2019-05-23 09:50:04,080 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:04,081 INFO L146 ILogger]: Finished difference Result 99 states and 100 transitions. [2019-05-23 09:50:04,081 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:50:04,082 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 57 [2019-05-23 09:50:04,082 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:04,083 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:50:04,083 INFO L146 ILogger]: Without dead ends: 59 [2019-05-23 09:50:04,084 INFO L146 ILogger]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:04,084 INFO L146 ILogger]: Start minimizeSevpa. Operand 59 states. [2019-05-23 09:50:04,086 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-05-23 09:50:04,086 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 09:50:04,087 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-05-23 09:50:04,087 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 57 [2019-05-23 09:50:04,087 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:04,087 INFO L146 ILogger]: Abstraction has 59 states and 60 transitions. [2019-05-23 09:50:04,087 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:50:04,087 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 60 transitions. [2019-05-23 09:50:04,088 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 09:50:04,088 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:04,088 INFO L146 ILogger]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2019-05-23 09:50:04,088 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:04,089 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:04,094 INFO L146 ILogger]: Analyzing trace with hash 283996225, now seen corresponding path program 26 times [2019-05-23 09:50:04,095 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:04,123 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:04,126 INFO L146 ILogger]: Trace formula consists of 147 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 09:50:04,129 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:05,609 INFO L146 ILogger]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:05,609 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:05,609 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:50:05,610 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:50:05,610 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:50:05,610 INFO L146 ILogger]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:50:05,610 INFO L146 ILogger]: Start difference. First operand 59 states and 60 transitions. Second operand 32 states. [2019-05-23 09:50:06,472 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:06,472 INFO L146 ILogger]: Finished difference Result 63 states and 64 transitions. [2019-05-23 09:50:06,472 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:50:06,473 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 58 [2019-05-23 09:50:06,473 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:06,473 INFO L146 ILogger]: With dead ends: 63 [2019-05-23 09:50:06,473 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 09:50:06,474 INFO L146 ILogger]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:50:06,475 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 09:50:06,476 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-05-23 09:50:06,476 INFO L146 ILogger]: Start removeUnreachable. Operand 62 states. [2019-05-23 09:50:06,477 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-05-23 09:50:06,477 INFO L146 ILogger]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 58 [2019-05-23 09:50:06,477 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:06,477 INFO L146 ILogger]: Abstraction has 62 states and 63 transitions. [2019-05-23 09:50:06,478 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:50:06,478 INFO L146 ILogger]: Start isEmpty. Operand 62 states and 63 transitions. [2019-05-23 09:50:06,478 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 09:50:06,478 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:06,479 INFO L146 ILogger]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1] [2019-05-23 09:50:06,479 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:06,479 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:06,479 INFO L146 ILogger]: Analyzing trace with hash -553005330, now seen corresponding path program 27 times [2019-05-23 09:50:06,480 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:06,494 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:06,497 INFO L146 ILogger]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:50:06,498 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:07,383 INFO L146 ILogger]: Checked inductivity of 406 backedges. 301 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:07,383 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:07,383 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:50:07,383 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:50:07,384 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:50:07,384 INFO L146 ILogger]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:50:07,384 INFO L146 ILogger]: Start difference. First operand 62 states and 63 transitions. Second operand 32 states. [2019-05-23 09:50:07,916 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:07,917 INFO L146 ILogger]: Finished difference Result 106 states and 107 transitions. [2019-05-23 09:50:07,921 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:50:07,921 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 61 [2019-05-23 09:50:07,921 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:07,922 INFO L146 ILogger]: With dead ends: 106 [2019-05-23 09:50:07,922 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 09:50:07,923 INFO L146 ILogger]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:50:07,923 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 09:50:07,924 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-05-23 09:50:07,924 INFO L146 ILogger]: Start removeUnreachable. Operand 63 states. [2019-05-23 09:50:07,924 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-05-23 09:50:07,925 INFO L146 ILogger]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2019-05-23 09:50:07,925 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:07,925 INFO L146 ILogger]: Abstraction has 63 states and 64 transitions. [2019-05-23 09:50:07,925 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:50:07,925 INFO L146 ILogger]: Start isEmpty. Operand 63 states and 64 transitions. [2019-05-23 09:50:07,926 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 63 [2019-05-23 09:50:07,926 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:07,926 INFO L146 ILogger]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2019-05-23 09:50:07,926 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:07,926 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:07,926 INFO L146 ILogger]: Analyzing trace with hash 92566696, now seen corresponding path program 28 times [2019-05-23 09:50:07,927 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:07,947 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:07,949 INFO L146 ILogger]: Trace formula consists of 157 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 09:50:07,952 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:08,594 INFO L146 ILogger]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:08,594 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:08,594 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:50:08,594 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:50:08,595 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:50:08,595 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:50:08,595 INFO L146 ILogger]: Start difference. First operand 63 states and 64 transitions. Second operand 34 states. [2019-05-23 09:50:09,521 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:09,522 INFO L146 ILogger]: Finished difference Result 67 states and 68 transitions. [2019-05-23 09:50:09,522 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:50:09,522 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 62 [2019-05-23 09:50:09,522 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:09,523 INFO L146 ILogger]: With dead ends: 67 [2019-05-23 09:50:09,523 INFO L146 ILogger]: Without dead ends: 67 [2019-05-23 09:50:09,524 INFO L146 ILogger]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:50:09,525 INFO L146 ILogger]: Start minimizeSevpa. Operand 67 states. [2019-05-23 09:50:09,526 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-05-23 09:50:09,527 INFO L146 ILogger]: Start removeUnreachable. Operand 66 states. [2019-05-23 09:50:09,527 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-05-23 09:50:09,527 INFO L146 ILogger]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-05-23 09:50:09,527 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:09,527 INFO L146 ILogger]: Abstraction has 66 states and 67 transitions. [2019-05-23 09:50:09,528 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:50:09,528 INFO L146 ILogger]: Start isEmpty. Operand 66 states and 67 transitions. [2019-05-23 09:50:09,528 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 66 [2019-05-23 09:50:09,528 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:09,528 INFO L146 ILogger]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1] [2019-05-23 09:50:09,529 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:09,529 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:09,529 INFO L146 ILogger]: Analyzing trace with hash 286465319, now seen corresponding path program 29 times [2019-05-23 09:50:09,530 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:09,547 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:09,549 INFO L146 ILogger]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:50:09,551 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:10,018 INFO L146 ILogger]: Checked inductivity of 465 backedges. 345 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:10,018 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:10,018 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:50:10,019 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:50:10,019 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:50:10,019 INFO L146 ILogger]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:50:10,019 INFO L146 ILogger]: Start difference. First operand 66 states and 67 transitions. Second operand 34 states. [2019-05-23 09:50:10,553 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:10,553 INFO L146 ILogger]: Finished difference Result 113 states and 114 transitions. [2019-05-23 09:50:10,553 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:50:10,554 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 65 [2019-05-23 09:50:10,554 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:10,554 INFO L146 ILogger]: With dead ends: 113 [2019-05-23 09:50:10,555 INFO L146 ILogger]: Without dead ends: 67 [2019-05-23 09:50:10,556 INFO L146 ILogger]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:10,557 INFO L146 ILogger]: Start minimizeSevpa. Operand 67 states. [2019-05-23 09:50:10,558 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-05-23 09:50:10,558 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 09:50:10,559 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-05-23 09:50:10,559 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-05-23 09:50:10,559 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:10,559 INFO L146 ILogger]: Abstraction has 67 states and 68 transitions. [2019-05-23 09:50:10,559 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:50:10,559 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 68 transitions. [2019-05-23 09:50:10,560 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 67 [2019-05-23 09:50:10,560 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:10,560 INFO L146 ILogger]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2019-05-23 09:50:10,560 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:10,560 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:10,560 INFO L146 ILogger]: Analyzing trace with hash -1980738079, now seen corresponding path program 30 times [2019-05-23 09:50:10,561 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:10,580 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:10,582 INFO L146 ILogger]: Trace formula consists of 167 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:50:10,584 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:11,761 INFO L146 ILogger]: Checked inductivity of 481 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:11,761 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:11,761 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:50:11,762 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:50:11,762 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:50:11,762 INFO L146 ILogger]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:50:11,762 INFO L146 ILogger]: Start difference. First operand 67 states and 68 transitions. Second operand 36 states. [2019-05-23 09:50:12,850 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:12,850 INFO L146 ILogger]: Finished difference Result 71 states and 72 transitions. [2019-05-23 09:50:12,851 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:50:12,851 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 66 [2019-05-23 09:50:12,851 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:12,852 INFO L146 ILogger]: With dead ends: 71 [2019-05-23 09:50:12,852 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 09:50:12,853 INFO L146 ILogger]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:50:12,853 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 09:50:12,855 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-05-23 09:50:12,855 INFO L146 ILogger]: Start removeUnreachable. Operand 70 states. [2019-05-23 09:50:12,855 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-05-23 09:50:12,855 INFO L146 ILogger]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 66 [2019-05-23 09:50:12,855 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:12,856 INFO L146 ILogger]: Abstraction has 70 states and 71 transitions. [2019-05-23 09:50:12,856 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:50:12,856 INFO L146 ILogger]: Start isEmpty. Operand 70 states and 71 transitions. [2019-05-23 09:50:12,856 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 70 [2019-05-23 09:50:12,856 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:12,856 INFO L146 ILogger]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1] [2019-05-23 09:50:12,856 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:12,857 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:12,857 INFO L146 ILogger]: Analyzing trace with hash 388597070, now seen corresponding path program 31 times [2019-05-23 09:50:12,857 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:12,872 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:12,875 INFO L146 ILogger]: Trace formula consists of 173 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:50:12,876 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:13,302 INFO L146 ILogger]: Checked inductivity of 528 backedges. 392 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:13,302 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:13,303 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:50:13,303 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:50:13,303 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:50:13,304 INFO L146 ILogger]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:50:13,304 INFO L146 ILogger]: Start difference. First operand 70 states and 71 transitions. Second operand 36 states. [2019-05-23 09:50:13,834 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:13,834 INFO L146 ILogger]: Finished difference Result 120 states and 121 transitions. [2019-05-23 09:50:13,835 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:50:13,835 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 69 [2019-05-23 09:50:13,835 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:13,836 INFO L146 ILogger]: With dead ends: 120 [2019-05-23 09:50:13,836 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 09:50:13,838 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:50:13,838 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 09:50:13,840 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-05-23 09:50:13,840 INFO L146 ILogger]: Start removeUnreachable. Operand 71 states. [2019-05-23 09:50:13,840 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-05-23 09:50:13,840 INFO L146 ILogger]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 69 [2019-05-23 09:50:13,840 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:13,841 INFO L146 ILogger]: Abstraction has 71 states and 72 transitions. [2019-05-23 09:50:13,841 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:50:13,841 INFO L146 ILogger]: Start isEmpty. Operand 71 states and 72 transitions. [2019-05-23 09:50:13,841 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 71 [2019-05-23 09:50:13,841 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:13,841 INFO L146 ILogger]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2019-05-23 09:50:13,842 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:13,842 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:13,842 INFO L146 ILogger]: Analyzing trace with hash -119025400, now seen corresponding path program 32 times [2019-05-23 09:50:13,843 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:13,860 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:13,863 INFO L146 ILogger]: Trace formula consists of 177 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 09:50:13,865 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:14,636 INFO L146 ILogger]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:14,636 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:14,637 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:50:14,637 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:50:14,637 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:50:14,637 INFO L146 ILogger]: CoverageRelationStatistics Valid=90, Invalid=1316, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:50:14,638 INFO L146 ILogger]: Start difference. First operand 71 states and 72 transitions. Second operand 38 states. [2019-05-23 09:50:15,909 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:15,909 INFO L146 ILogger]: Finished difference Result 75 states and 76 transitions. [2019-05-23 09:50:15,910 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:50:15,910 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 70 [2019-05-23 09:50:15,910 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:15,911 INFO L146 ILogger]: With dead ends: 75 [2019-05-23 09:50:15,911 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:50:15,912 INFO L146 ILogger]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:50:15,912 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:50:15,914 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-05-23 09:50:15,914 INFO L146 ILogger]: Start removeUnreachable. Operand 74 states. [2019-05-23 09:50:15,914 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-05-23 09:50:15,914 INFO L146 ILogger]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2019-05-23 09:50:15,915 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:15,915 INFO L146 ILogger]: Abstraction has 74 states and 75 transitions. [2019-05-23 09:50:15,915 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:50:15,915 INFO L146 ILogger]: Start isEmpty. Operand 74 states and 75 transitions. [2019-05-23 09:50:15,915 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 74 [2019-05-23 09:50:15,916 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:15,916 INFO L146 ILogger]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1] [2019-05-23 09:50:15,916 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:15,916 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:15,916 INFO L146 ILogger]: Analyzing trace with hash 1758323911, now seen corresponding path program 33 times [2019-05-23 09:50:15,917 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:15,932 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:15,935 INFO L146 ILogger]: Trace formula consists of 183 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:50:15,937 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:16,843 INFO L146 ILogger]: Checked inductivity of 595 backedges. 442 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:16,844 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:16,844 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:50:16,844 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:50:16,844 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:50:16,845 INFO L146 ILogger]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:50:16,845 INFO L146 ILogger]: Start difference. First operand 74 states and 75 transitions. Second operand 38 states. [2019-05-23 09:50:17,558 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:17,559 INFO L146 ILogger]: Finished difference Result 127 states and 128 transitions. [2019-05-23 09:50:17,559 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:50:17,559 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 73 [2019-05-23 09:50:17,559 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:17,560 INFO L146 ILogger]: With dead ends: 127 [2019-05-23 09:50:17,560 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:50:17,562 INFO L146 ILogger]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:50:17,562 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:50:17,563 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-05-23 09:50:17,563 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 09:50:17,563 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-05-23 09:50:17,564 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 73 [2019-05-23 09:50:17,564 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:17,564 INFO L146 ILogger]: Abstraction has 75 states and 76 transitions. [2019-05-23 09:50:17,564 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:50:17,564 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 76 transitions. [2019-05-23 09:50:17,564 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 75 [2019-05-23 09:50:17,564 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:17,564 INFO L146 ILogger]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2019-05-23 09:50:17,564 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:17,565 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:17,565 INFO L146 ILogger]: Analyzing trace with hash 1722532737, now seen corresponding path program 34 times [2019-05-23 09:50:17,565 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:17,584 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:17,587 INFO L146 ILogger]: Trace formula consists of 187 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 09:50:17,591 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:18,487 INFO L146 ILogger]: Checked inductivity of 613 backedges. 0 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:18,487 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:18,487 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:50:18,487 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:50:18,487 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:50:18,488 INFO L146 ILogger]: CoverageRelationStatistics Valid=95, Invalid=1465, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:50:18,488 INFO L146 ILogger]: Start difference. First operand 75 states and 76 transitions. Second operand 40 states. [2019-05-23 09:50:19,888 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:19,889 INFO L146 ILogger]: Finished difference Result 79 states and 80 transitions. [2019-05-23 09:50:19,889 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:50:19,889 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 74 [2019-05-23 09:50:19,890 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:19,890 INFO L146 ILogger]: With dead ends: 79 [2019-05-23 09:50:19,890 INFO L146 ILogger]: Without dead ends: 79 [2019-05-23 09:50:19,891 INFO L146 ILogger]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:50:19,891 INFO L146 ILogger]: Start minimizeSevpa. Operand 79 states. [2019-05-23 09:50:19,893 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-05-23 09:50:19,893 INFO L146 ILogger]: Start removeUnreachable. Operand 78 states. [2019-05-23 09:50:19,893 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-05-23 09:50:19,893 INFO L146 ILogger]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 74 [2019-05-23 09:50:19,894 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:19,894 INFO L146 ILogger]: Abstraction has 78 states and 79 transitions. [2019-05-23 09:50:19,894 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:50:19,894 INFO L146 ILogger]: Start isEmpty. Operand 78 states and 79 transitions. [2019-05-23 09:50:19,894 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 09:50:19,894 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:19,894 INFO L146 ILogger]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1] [2019-05-23 09:50:19,894 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:19,895 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:19,895 INFO L146 ILogger]: Analyzing trace with hash -295455826, now seen corresponding path program 35 times [2019-05-23 09:50:19,895 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:19,911 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:19,915 INFO L146 ILogger]: Trace formula consists of 193 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:50:19,916 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:21,063 INFO L146 ILogger]: Checked inductivity of 666 backedges. 495 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:21,063 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:21,064 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:50:21,064 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:50:21,064 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:50:21,065 INFO L146 ILogger]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:50:21,065 INFO L146 ILogger]: Start difference. First operand 78 states and 79 transitions. Second operand 40 states. [2019-05-23 09:50:21,604 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:21,604 INFO L146 ILogger]: Finished difference Result 134 states and 135 transitions. [2019-05-23 09:50:21,604 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:50:21,605 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 77 [2019-05-23 09:50:21,605 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:21,606 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 09:50:21,606 INFO L146 ILogger]: Without dead ends: 79 [2019-05-23 09:50:21,609 INFO L146 ILogger]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:50:21,609 INFO L146 ILogger]: Start minimizeSevpa. Operand 79 states. [2019-05-23 09:50:21,611 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-05-23 09:50:21,611 INFO L146 ILogger]: Start removeUnreachable. Operand 79 states. [2019-05-23 09:50:21,612 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-05-23 09:50:21,612 INFO L146 ILogger]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-05-23 09:50:21,612 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:21,612 INFO L146 ILogger]: Abstraction has 79 states and 80 transitions. [2019-05-23 09:50:21,612 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:50:21,612 INFO L146 ILogger]: Start isEmpty. Operand 79 states and 80 transitions. [2019-05-23 09:50:21,613 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 09:50:21,613 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:21,613 INFO L146 ILogger]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2019-05-23 09:50:21,613 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:21,613 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:21,614 INFO L146 ILogger]: Analyzing trace with hash -127949464, now seen corresponding path program 36 times [2019-05-23 09:50:21,614 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:21,636 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:21,641 INFO L146 ILogger]: Trace formula consists of 197 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:50:21,643 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:22,640 INFO L146 ILogger]: Checked inductivity of 685 backedges. 0 proven. 685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:22,641 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:22,641 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:50:22,641 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:50:22,641 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:50:22,642 INFO L146 ILogger]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:50:22,642 INFO L146 ILogger]: Start difference. First operand 79 states and 80 transitions. Second operand 42 states. [2019-05-23 09:50:24,137 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:24,137 INFO L146 ILogger]: Finished difference Result 83 states and 84 transitions. [2019-05-23 09:50:24,137 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:50:24,137 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 78 [2019-05-23 09:50:24,138 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:24,139 INFO L146 ILogger]: With dead ends: 83 [2019-05-23 09:50:24,139 INFO L146 ILogger]: Without dead ends: 83 [2019-05-23 09:50:24,140 INFO L146 ILogger]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=1701, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:50:24,140 INFO L146 ILogger]: Start minimizeSevpa. Operand 83 states. [2019-05-23 09:50:24,142 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-05-23 09:50:24,142 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 09:50:24,142 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-05-23 09:50:24,142 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2019-05-23 09:50:24,142 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:24,143 INFO L146 ILogger]: Abstraction has 82 states and 83 transitions. [2019-05-23 09:50:24,143 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:50:24,143 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 83 transitions. [2019-05-23 09:50:24,143 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 82 [2019-05-23 09:50:24,143 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:24,144 INFO L146 ILogger]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1] [2019-05-23 09:50:24,144 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:24,144 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:24,144 INFO L146 ILogger]: Analyzing trace with hash -2105461657, now seen corresponding path program 37 times [2019-05-23 09:50:24,145 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:24,164 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:24,168 INFO L146 ILogger]: Trace formula consists of 203 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:50:24,170 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:24,911 INFO L146 ILogger]: Checked inductivity of 741 backedges. 551 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:24,912 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:24,912 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:50:24,912 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:50:24,912 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:50:24,913 INFO L146 ILogger]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:50:24,913 INFO L146 ILogger]: Start difference. First operand 82 states and 83 transitions. Second operand 42 states. [2019-05-23 09:50:25,499 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:25,499 INFO L146 ILogger]: Finished difference Result 141 states and 142 transitions. [2019-05-23 09:50:25,500 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:50:25,500 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 81 [2019-05-23 09:50:25,500 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:25,501 INFO L146 ILogger]: With dead ends: 141 [2019-05-23 09:50:25,501 INFO L146 ILogger]: Without dead ends: 83 [2019-05-23 09:50:25,502 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:50:25,502 INFO L146 ILogger]: Start minimizeSevpa. Operand 83 states. [2019-05-23 09:50:25,504 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-05-23 09:50:25,504 INFO L146 ILogger]: Start removeUnreachable. Operand 83 states. [2019-05-23 09:50:25,504 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-05-23 09:50:25,504 INFO L146 ILogger]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 81 [2019-05-23 09:50:25,505 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:25,505 INFO L146 ILogger]: Abstraction has 83 states and 84 transitions. [2019-05-23 09:50:25,505 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:50:25,505 INFO L146 ILogger]: Start isEmpty. Operand 83 states and 84 transitions. [2019-05-23 09:50:25,505 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 09:50:25,505 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:25,506 INFO L146 ILogger]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2019-05-23 09:50:25,506 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:25,506 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:25,506 INFO L146 ILogger]: Analyzing trace with hash 1700378913, now seen corresponding path program 38 times [2019-05-23 09:50:25,507 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:25,527 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:25,531 INFO L146 ILogger]: Trace formula consists of 207 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 09:50:25,533 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:26,538 INFO L146 ILogger]: Checked inductivity of 761 backedges. 0 proven. 761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:26,538 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:26,538 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:50:26,539 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:50:26,539 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:50:26,539 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=1787, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:26,539 INFO L146 ILogger]: Start difference. First operand 83 states and 84 transitions. Second operand 44 states. [2019-05-23 09:50:28,258 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:28,258 INFO L146 ILogger]: Finished difference Result 87 states and 88 transitions. [2019-05-23 09:50:28,259 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:50:28,259 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 82 [2019-05-23 09:50:28,259 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:28,260 INFO L146 ILogger]: With dead ends: 87 [2019-05-23 09:50:28,260 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 09:50:28,261 INFO L146 ILogger]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=1870, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:50:28,262 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 09:50:28,264 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-05-23 09:50:28,264 INFO L146 ILogger]: Start removeUnreachable. Operand 86 states. [2019-05-23 09:50:28,264 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-05-23 09:50:28,264 INFO L146 ILogger]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 82 [2019-05-23 09:50:28,265 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:28,265 INFO L146 ILogger]: Abstraction has 86 states and 87 transitions. [2019-05-23 09:50:28,265 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:50:28,265 INFO L146 ILogger]: Start isEmpty. Operand 86 states and 87 transitions. [2019-05-23 09:50:28,265 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:50:28,266 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:28,266 INFO L146 ILogger]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1] [2019-05-23 09:50:28,266 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:28,266 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:28,266 INFO L146 ILogger]: Analyzing trace with hash 1144936974, now seen corresponding path program 39 times [2019-05-23 09:50:28,267 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:28,293 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:28,296 INFO L146 ILogger]: Trace formula consists of 213 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:50:28,298 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:29,271 INFO L146 ILogger]: Checked inductivity of 820 backedges. 610 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:29,271 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:29,272 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:50:29,272 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:50:29,272 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:50:29,272 INFO L146 ILogger]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:29,272 INFO L146 ILogger]: Start difference. First operand 86 states and 87 transitions. Second operand 44 states. [2019-05-23 09:50:29,891 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:29,891 INFO L146 ILogger]: Finished difference Result 148 states and 149 transitions. [2019-05-23 09:50:29,891 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:50:29,891 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 85 [2019-05-23 09:50:29,892 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:29,892 INFO L146 ILogger]: With dead ends: 148 [2019-05-23 09:50:29,892 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 09:50:29,893 INFO L146 ILogger]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:50:29,893 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 09:50:29,894 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-05-23 09:50:29,894 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 09:50:29,894 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-05-23 09:50:29,894 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 85 [2019-05-23 09:50:29,895 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:29,895 INFO L146 ILogger]: Abstraction has 87 states and 88 transitions. [2019-05-23 09:50:29,895 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:50:29,895 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 88 transitions. [2019-05-23 09:50:29,895 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 87 [2019-05-23 09:50:29,895 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:29,896 INFO L146 ILogger]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2019-05-23 09:50:29,896 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:29,896 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:29,896 INFO L146 ILogger]: Analyzing trace with hash 1232204232, now seen corresponding path program 40 times [2019-05-23 09:50:29,897 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:29,917 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:29,921 INFO L146 ILogger]: Trace formula consists of 217 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 09:50:29,923 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:31,026 INFO L146 ILogger]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:31,026 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:31,026 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:50:31,027 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:50:31,027 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:50:31,027 INFO L146 ILogger]: CoverageRelationStatistics Valid=110, Invalid=1960, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:50:31,027 INFO L146 ILogger]: Start difference. First operand 87 states and 88 transitions. Second operand 46 states. [2019-05-23 09:50:32,728 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:32,728 INFO L146 ILogger]: Finished difference Result 91 states and 92 transitions. [2019-05-23 09:50:32,728 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:50:32,729 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 86 [2019-05-23 09:50:32,729 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:32,729 INFO L146 ILogger]: With dead ends: 91 [2019-05-23 09:50:32,730 INFO L146 ILogger]: Without dead ends: 91 [2019-05-23 09:50:32,730 INFO L146 ILogger]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=2047, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:50:32,730 INFO L146 ILogger]: Start minimizeSevpa. Operand 91 states. [2019-05-23 09:50:32,732 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-05-23 09:50:32,732 INFO L146 ILogger]: Start removeUnreachable. Operand 90 states. [2019-05-23 09:50:32,732 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-05-23 09:50:32,732 INFO L146 ILogger]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2019-05-23 09:50:32,732 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:32,732 INFO L146 ILogger]: Abstraction has 90 states and 91 transitions. [2019-05-23 09:50:32,732 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:50:32,733 INFO L146 ILogger]: Start isEmpty. Operand 90 states and 91 transitions. [2019-05-23 09:50:32,733 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 90 [2019-05-23 09:50:32,733 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:32,733 INFO L146 ILogger]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1] [2019-05-23 09:50:32,733 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:32,733 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:32,734 INFO L146 ILogger]: Analyzing trace with hash -488174585, now seen corresponding path program 41 times [2019-05-23 09:50:32,734 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:32,752 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:32,756 INFO L146 ILogger]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:50:32,758 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:33,569 INFO L146 ILogger]: Checked inductivity of 903 backedges. 672 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:33,569 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:33,569 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:50:33,569 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:50:33,570 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:50:33,570 INFO L146 ILogger]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:50:33,570 INFO L146 ILogger]: Start difference. First operand 90 states and 91 transitions. Second operand 46 states. [2019-05-23 09:50:34,423 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:34,424 INFO L146 ILogger]: Finished difference Result 155 states and 156 transitions. [2019-05-23 09:50:34,424 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:50:34,424 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 89 [2019-05-23 09:50:34,425 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:34,425 INFO L146 ILogger]: With dead ends: 155 [2019-05-23 09:50:34,425 INFO L146 ILogger]: Without dead ends: 91 [2019-05-23 09:50:34,426 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:50:34,427 INFO L146 ILogger]: Start minimizeSevpa. Operand 91 states. [2019-05-23 09:50:34,429 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-05-23 09:50:34,429 INFO L146 ILogger]: Start removeUnreachable. Operand 91 states. [2019-05-23 09:50:34,429 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-05-23 09:50:34,429 INFO L146 ILogger]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-05-23 09:50:34,430 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:34,430 INFO L146 ILogger]: Abstraction has 91 states and 92 transitions. [2019-05-23 09:50:34,430 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:50:34,430 INFO L146 ILogger]: Start isEmpty. Operand 91 states and 92 transitions. [2019-05-23 09:50:34,430 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 91 [2019-05-23 09:50:34,430 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:34,430 INFO L146 ILogger]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2019-05-23 09:50:34,430 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:34,431 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:34,431 INFO L146 ILogger]: Analyzing trace with hash 1890858689, now seen corresponding path program 42 times [2019-05-23 09:50:34,431 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:34,453 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:34,456 INFO L146 ILogger]: Trace formula consists of 227 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:50:34,458 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:35,699 INFO L146 ILogger]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:35,700 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:35,700 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:50:35,700 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:50:35,700 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:50:35,701 INFO L146 ILogger]: CoverageRelationStatistics Valid=115, Invalid=2141, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:50:35,701 INFO L146 ILogger]: Start difference. First operand 91 states and 92 transitions. Second operand 48 states. [2019-05-23 09:50:37,633 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:37,633 INFO L146 ILogger]: Finished difference Result 95 states and 96 transitions. [2019-05-23 09:50:37,634 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:50:37,634 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 90 [2019-05-23 09:50:37,634 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:37,635 INFO L146 ILogger]: With dead ends: 95 [2019-05-23 09:50:37,635 INFO L146 ILogger]: Without dead ends: 95 [2019-05-23 09:50:37,636 INFO L146 ILogger]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=2232, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:50:37,636 INFO L146 ILogger]: Start minimizeSevpa. Operand 95 states. [2019-05-23 09:50:37,638 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-05-23 09:50:37,638 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:50:37,639 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-05-23 09:50:37,639 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 90 [2019-05-23 09:50:37,639 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:37,640 INFO L146 ILogger]: Abstraction has 94 states and 95 transitions. [2019-05-23 09:50:37,640 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:50:37,640 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 95 transitions. [2019-05-23 09:50:37,640 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 09:50:37,640 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:37,641 INFO L146 ILogger]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1] [2019-05-23 09:50:37,641 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:37,641 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:37,641 INFO L146 ILogger]: Analyzing trace with hash 2076145774, now seen corresponding path program 43 times [2019-05-23 09:50:37,642 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:37,661 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:37,665 INFO L146 ILogger]: Trace formula consists of 233 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:50:37,666 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:38,484 INFO L146 ILogger]: Checked inductivity of 990 backedges. 737 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:38,484 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:38,484 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:50:38,485 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:50:38,485 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:50:38,485 INFO L146 ILogger]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:50:38,485 INFO L146 ILogger]: Start difference. First operand 94 states and 95 transitions. Second operand 48 states. [2019-05-23 09:50:39,481 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:39,481 INFO L146 ILogger]: Finished difference Result 162 states and 163 transitions. [2019-05-23 09:50:39,481 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:50:39,482 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 93 [2019-05-23 09:50:39,482 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:39,482 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:50:39,483 INFO L146 ILogger]: Without dead ends: 95 [2019-05-23 09:50:39,483 INFO L146 ILogger]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:50:39,484 INFO L146 ILogger]: Start minimizeSevpa. Operand 95 states. [2019-05-23 09:50:39,485 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-05-23 09:50:39,485 INFO L146 ILogger]: Start removeUnreachable. Operand 95 states. [2019-05-23 09:50:39,486 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-05-23 09:50:39,486 INFO L146 ILogger]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 93 [2019-05-23 09:50:39,486 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:39,486 INFO L146 ILogger]: Abstraction has 95 states and 96 transitions. [2019-05-23 09:50:39,487 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:50:39,487 INFO L146 ILogger]: Start isEmpty. Operand 95 states and 96 transitions. [2019-05-23 09:50:39,487 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 95 [2019-05-23 09:50:39,487 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:39,487 INFO L146 ILogger]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2019-05-23 09:50:39,488 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:39,488 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:39,488 INFO L146 ILogger]: Analyzing trace with hash -1255885272, now seen corresponding path program 44 times [2019-05-23 09:50:39,488 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:39,509 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:39,513 INFO L146 ILogger]: Trace formula consists of 237 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 09:50:39,515 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:40,894 INFO L146 ILogger]: Checked inductivity of 1013 backedges. 0 proven. 1013 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:40,894 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:40,894 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:50:40,895 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:50:40,895 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:50:40,896 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=2330, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:40,896 INFO L146 ILogger]: Start difference. First operand 95 states and 96 transitions. Second operand 50 states. [2019-05-23 09:50:43,658 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:43,658 INFO L146 ILogger]: Finished difference Result 99 states and 100 transitions. [2019-05-23 09:50:43,659 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:50:43,659 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 94 [2019-05-23 09:50:43,659 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:43,660 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:50:43,660 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:50:43,661 INFO L146 ILogger]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=2425, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:50:43,661 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:50:43,663 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-05-23 09:50:43,663 INFO L146 ILogger]: Start removeUnreachable. Operand 98 states. [2019-05-23 09:50:43,664 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-05-23 09:50:43,664 INFO L146 ILogger]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 94 [2019-05-23 09:50:43,664 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:43,664 INFO L146 ILogger]: Abstraction has 98 states and 99 transitions. [2019-05-23 09:50:43,664 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:50:43,665 INFO L146 ILogger]: Start isEmpty. Operand 98 states and 99 transitions. [2019-05-23 09:50:43,665 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:50:43,665 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:43,665 INFO L146 ILogger]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1] [2019-05-23 09:50:43,665 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:43,666 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:43,666 INFO L146 ILogger]: Analyzing trace with hash -616993881, now seen corresponding path program 45 times [2019-05-23 09:50:43,666 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:43,685 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:43,690 INFO L146 ILogger]: Trace formula consists of 243 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:50:43,691 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:44,509 INFO L146 ILogger]: Checked inductivity of 1081 backedges. 805 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:44,509 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:44,509 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:50:44,510 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:50:44,510 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:50:44,510 INFO L146 ILogger]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:44,511 INFO L146 ILogger]: Start difference. First operand 98 states and 99 transitions. Second operand 50 states. [2019-05-23 09:50:45,248 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:45,248 INFO L146 ILogger]: Finished difference Result 169 states and 170 transitions. [2019-05-23 09:50:45,249 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:50:45,249 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 97 [2019-05-23 09:50:45,249 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:45,250 INFO L146 ILogger]: With dead ends: 169 [2019-05-23 09:50:45,250 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:50:45,251 INFO L146 ILogger]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:50:45,252 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:50:45,254 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-05-23 09:50:45,254 INFO L146 ILogger]: Start removeUnreachable. Operand 99 states. [2019-05-23 09:50:45,254 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-05-23 09:50:45,254 INFO L146 ILogger]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 97 [2019-05-23 09:50:45,254 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:45,255 INFO L146 ILogger]: Abstraction has 99 states and 100 transitions. [2019-05-23 09:50:45,255 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:50:45,255 INFO L146 ILogger]: Start isEmpty. Operand 99 states and 100 transitions. [2019-05-23 09:50:45,255 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 09:50:45,255 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:45,256 INFO L146 ILogger]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2019-05-23 09:50:45,256 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:45,256 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:45,256 INFO L146 ILogger]: Analyzing trace with hash 1073036385, now seen corresponding path program 46 times [2019-05-23 09:50:45,257 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:45,279 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:45,283 INFO L146 ILogger]: Trace formula consists of 247 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 09:50:45,285 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:46,571 INFO L146 ILogger]: Checked inductivity of 1105 backedges. 0 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:46,571 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:46,572 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:50:46,572 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:50:46,572 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:50:46,572 INFO L146 ILogger]: CoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:50:46,572 INFO L146 ILogger]: Start difference. First operand 99 states and 100 transitions. Second operand 52 states. [2019-05-23 09:50:49,059 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:49,060 INFO L146 ILogger]: Finished difference Result 103 states and 104 transitions. [2019-05-23 09:50:49,060 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:50:49,060 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 98 [2019-05-23 09:50:49,060 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:49,061 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 09:50:49,061 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 09:50:49,062 INFO L146 ILogger]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=130, Invalid=2626, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:50:49,062 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 09:50:49,064 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-05-23 09:50:49,064 INFO L146 ILogger]: Start removeUnreachable. Operand 102 states. [2019-05-23 09:50:49,065 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-05-23 09:50:49,065 INFO L146 ILogger]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 98 [2019-05-23 09:50:49,065 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:49,065 INFO L146 ILogger]: Abstraction has 102 states and 103 transitions. [2019-05-23 09:50:49,066 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:50:49,066 INFO L146 ILogger]: Start isEmpty. Operand 102 states and 103 transitions. [2019-05-23 09:50:49,066 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 102 [2019-05-23 09:50:49,066 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:49,066 INFO L146 ILogger]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1] [2019-05-23 09:50:49,067 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:49,067 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:49,067 INFO L146 ILogger]: Analyzing trace with hash -613609778, now seen corresponding path program 47 times [2019-05-23 09:50:49,067 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:49,088 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:49,093 INFO L146 ILogger]: Trace formula consists of 253 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:50:49,095 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:50,136 INFO L146 ILogger]: Checked inductivity of 1176 backedges. 876 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:50,137 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:50,137 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:50:50,137 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:50:50,137 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:50:50,138 INFO L146 ILogger]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:50:50,138 INFO L146 ILogger]: Start difference. First operand 102 states and 103 transitions. Second operand 52 states. [2019-05-23 09:50:51,457 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:51,458 INFO L146 ILogger]: Finished difference Result 176 states and 177 transitions. [2019-05-23 09:50:51,458 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:50:51,458 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 101 [2019-05-23 09:50:51,458 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:51,459 INFO L146 ILogger]: With dead ends: 176 [2019-05-23 09:50:51,459 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 09:50:51,460 INFO L146 ILogger]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:50:51,460 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 09:50:51,462 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-05-23 09:50:51,462 INFO L146 ILogger]: Start removeUnreachable. Operand 103 states. [2019-05-23 09:50:51,463 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-05-23 09:50:51,463 INFO L146 ILogger]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2019-05-23 09:50:51,463 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:51,463 INFO L146 ILogger]: Abstraction has 103 states and 104 transitions. [2019-05-23 09:50:51,463 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:50:51,464 INFO L146 ILogger]: Start isEmpty. Operand 103 states and 104 transitions. [2019-05-23 09:50:51,464 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 103 [2019-05-23 09:50:51,464 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:51,464 INFO L146 ILogger]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2019-05-23 09:50:51,464 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:51,465 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:51,465 INFO L146 ILogger]: Analyzing trace with hash -402787704, now seen corresponding path program 48 times [2019-05-23 09:50:51,465 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:51,489 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:51,493 INFO L146 ILogger]: Trace formula consists of 257 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:50:51,495 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:52,899 INFO L146 ILogger]: Checked inductivity of 1201 backedges. 0 proven. 1201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:52,899 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:52,900 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:50:52,900 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:50:52,900 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:50:52,901 INFO L146 ILogger]: CoverageRelationStatistics Valid=130, Invalid=2732, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:50:52,901 INFO L146 ILogger]: Start difference. First operand 103 states and 104 transitions. Second operand 54 states. [2019-05-23 09:50:55,398 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:55,398 INFO L146 ILogger]: Finished difference Result 107 states and 108 transitions. [2019-05-23 09:50:55,398 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:50:55,399 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 102 [2019-05-23 09:50:55,399 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:55,400 INFO L146 ILogger]: With dead ends: 107 [2019-05-23 09:50:55,400 INFO L146 ILogger]: Without dead ends: 107 [2019-05-23 09:50:55,401 INFO L146 ILogger]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=2835, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:50:55,401 INFO L146 ILogger]: Start minimizeSevpa. Operand 107 states. [2019-05-23 09:50:55,403 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-05-23 09:50:55,403 INFO L146 ILogger]: Start removeUnreachable. Operand 106 states. [2019-05-23 09:50:55,403 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-05-23 09:50:55,404 INFO L146 ILogger]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 102 [2019-05-23 09:50:55,404 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:55,404 INFO L146 ILogger]: Abstraction has 106 states and 107 transitions. [2019-05-23 09:50:55,404 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:50:55,404 INFO L146 ILogger]: Start isEmpty. Operand 106 states and 107 transitions. [2019-05-23 09:50:55,405 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 106 [2019-05-23 09:50:55,405 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:55,405 INFO L146 ILogger]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1] [2019-05-23 09:50:55,405 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:55,405 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:55,406 INFO L146 ILogger]: Analyzing trace with hash 691163975, now seen corresponding path program 49 times [2019-05-23 09:50:55,406 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:55,428 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:55,433 INFO L146 ILogger]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:50:55,435 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:56,634 INFO L146 ILogger]: Checked inductivity of 1275 backedges. 950 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:56,635 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:56,635 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:50:56,635 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:50:56,636 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:50:56,636 INFO L146 ILogger]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:50:56,636 INFO L146 ILogger]: Start difference. First operand 106 states and 107 transitions. Second operand 54 states. [2019-05-23 09:50:58,150 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:58,151 INFO L146 ILogger]: Finished difference Result 183 states and 184 transitions. [2019-05-23 09:50:58,151 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:50:58,151 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 105 [2019-05-23 09:50:58,152 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:58,153 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 09:50:58,153 INFO L146 ILogger]: Without dead ends: 107 [2019-05-23 09:50:58,153 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:50:58,154 INFO L146 ILogger]: Start minimizeSevpa. Operand 107 states. [2019-05-23 09:50:58,155 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-05-23 09:50:58,155 INFO L146 ILogger]: Start removeUnreachable. Operand 107 states. [2019-05-23 09:50:58,155 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-05-23 09:50:58,156 INFO L146 ILogger]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 105 [2019-05-23 09:50:58,156 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:58,156 INFO L146 ILogger]: Abstraction has 107 states and 108 transitions. [2019-05-23 09:50:58,156 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:50:58,156 INFO L146 ILogger]: Start isEmpty. Operand 107 states and 108 transitions. [2019-05-23 09:50:58,156 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 09:50:58,157 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:58,157 INFO L146 ILogger]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2019-05-23 09:50:58,157 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:58,157 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:58,157 INFO L146 ILogger]: Analyzing trace with hash -153695743, now seen corresponding path program 50 times [2019-05-23 09:50:58,158 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:58,184 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:58,188 INFO L146 ILogger]: Trace formula consists of 267 conjuncts, 109 conjunts are in the unsatisfiable core [2019-05-23 09:50:58,192 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:59,637 INFO L146 ILogger]: Checked inductivity of 1301 backedges. 0 proven. 1301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:59,637 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:59,637 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:50:59,638 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:50:59,638 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:50:59,638 INFO L146 ILogger]: CoverageRelationStatistics Valid=135, Invalid=2945, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:50:59,638 INFO L146 ILogger]: Start difference. First operand 107 states and 108 transitions. Second operand 56 states. [2019-05-23 09:51:02,268 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:02,268 INFO L146 ILogger]: Finished difference Result 111 states and 112 transitions. [2019-05-23 09:51:02,268 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:51:02,269 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 106 [2019-05-23 09:51:02,269 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:02,270 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:51:02,270 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:51:02,270 INFO L146 ILogger]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=3052, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:51:02,271 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:51:02,273 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-05-23 09:51:02,273 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 09:51:02,273 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-05-23 09:51:02,273 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 106 [2019-05-23 09:51:02,274 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:02,274 INFO L146 ILogger]: Abstraction has 110 states and 111 transitions. [2019-05-23 09:51:02,274 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:51:02,274 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 111 transitions. [2019-05-23 09:51:02,274 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 09:51:02,275 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:02,275 INFO L146 ILogger]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1] [2019-05-23 09:51:02,275 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:02,275 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:02,275 INFO L146 ILogger]: Analyzing trace with hash -313713362, now seen corresponding path program 51 times [2019-05-23 09:51:02,276 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:02,300 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:02,305 INFO L146 ILogger]: Trace formula consists of 273 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:51:02,307 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:03,591 INFO L146 ILogger]: Checked inductivity of 1378 backedges. 1027 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:03,591 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:03,591 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:51:03,591 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:51:03,592 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:51:03,592 INFO L146 ILogger]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:51:03,592 INFO L146 ILogger]: Start difference. First operand 110 states and 111 transitions. Second operand 56 states. [2019-05-23 09:51:05,154 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:05,155 INFO L146 ILogger]: Finished difference Result 190 states and 191 transitions. [2019-05-23 09:51:05,155 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:51:05,155 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 109 [2019-05-23 09:51:05,156 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:05,156 INFO L146 ILogger]: With dead ends: 190 [2019-05-23 09:51:05,156 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:51:05,157 INFO L146 ILogger]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:51:05,157 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:51:05,159 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-05-23 09:51:05,159 INFO L146 ILogger]: Start removeUnreachable. Operand 111 states. [2019-05-23 09:51:05,159 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-05-23 09:51:05,160 INFO L146 ILogger]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 109 [2019-05-23 09:51:05,160 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:05,160 INFO L146 ILogger]: Abstraction has 111 states and 112 transitions. [2019-05-23 09:51:05,160 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:51:05,160 INFO L146 ILogger]: Start isEmpty. Operand 111 states and 112 transitions. [2019-05-23 09:51:05,160 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 111 [2019-05-23 09:51:05,161 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:05,161 INFO L146 ILogger]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2019-05-23 09:51:05,161 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:05,161 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:05,161 INFO L146 ILogger]: Analyzing trace with hash -771512600, now seen corresponding path program 52 times [2019-05-23 09:51:05,162 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:05,196 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:05,200 INFO L146 ILogger]: Trace formula consists of 277 conjuncts, 113 conjunts are in the unsatisfiable core [2019-05-23 09:51:05,202 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:06,789 INFO L146 ILogger]: Checked inductivity of 1405 backedges. 0 proven. 1405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:06,790 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:06,790 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:51:06,790 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:51:06,790 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:51:06,791 INFO L146 ILogger]: CoverageRelationStatistics Valid=140, Invalid=3166, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:51:06,791 INFO L146 ILogger]: Start difference. First operand 111 states and 112 transitions. Second operand 58 states. [2019-05-23 09:51:09,811 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:09,811 INFO L146 ILogger]: Finished difference Result 115 states and 116 transitions. [2019-05-23 09:51:09,812 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:51:09,812 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 110 [2019-05-23 09:51:09,812 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:09,813 INFO L146 ILogger]: With dead ends: 115 [2019-05-23 09:51:09,813 INFO L146 ILogger]: Without dead ends: 115 [2019-05-23 09:51:09,814 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=3277, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:51:09,814 INFO L146 ILogger]: Start minimizeSevpa. Operand 115 states. [2019-05-23 09:51:09,816 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-05-23 09:51:09,816 INFO L146 ILogger]: Start removeUnreachable. Operand 114 states. [2019-05-23 09:51:09,816 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-05-23 09:51:09,817 INFO L146 ILogger]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2019-05-23 09:51:09,817 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:09,817 INFO L146 ILogger]: Abstraction has 114 states and 115 transitions. [2019-05-23 09:51:09,817 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:51:09,817 INFO L146 ILogger]: Start isEmpty. Operand 114 states and 115 transitions. [2019-05-23 09:51:09,818 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 114 [2019-05-23 09:51:09,818 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:09,818 INFO L146 ILogger]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1] [2019-05-23 09:51:09,818 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:09,818 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:09,818 INFO L146 ILogger]: Analyzing trace with hash -1760836889, now seen corresponding path program 53 times [2019-05-23 09:51:09,819 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:09,842 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:09,847 INFO L146 ILogger]: Trace formula consists of 283 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:51:09,849 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:10,892 INFO L146 ILogger]: Checked inductivity of 1485 backedges. 1107 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:10,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:10,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:51:10,893 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:51:10,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:51:10,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:51:10,894 INFO L146 ILogger]: Start difference. First operand 114 states and 115 transitions. Second operand 58 states. [2019-05-23 09:51:12,298 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:12,298 INFO L146 ILogger]: Finished difference Result 197 states and 198 transitions. [2019-05-23 09:51:12,298 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:51:12,299 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 113 [2019-05-23 09:51:12,299 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:12,300 INFO L146 ILogger]: With dead ends: 197 [2019-05-23 09:51:12,300 INFO L146 ILogger]: Without dead ends: 115 [2019-05-23 09:51:12,301 INFO L146 ILogger]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:51:12,301 INFO L146 ILogger]: Start minimizeSevpa. Operand 115 states. [2019-05-23 09:51:12,302 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-05-23 09:51:12,302 INFO L146 ILogger]: Start removeUnreachable. Operand 115 states. [2019-05-23 09:51:12,302 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-05-23 09:51:12,303 INFO L146 ILogger]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2019-05-23 09:51:12,303 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:12,303 INFO L146 ILogger]: Abstraction has 115 states and 116 transitions. [2019-05-23 09:51:12,303 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:51:12,303 INFO L146 ILogger]: Start isEmpty. Operand 115 states and 116 transitions. [2019-05-23 09:51:12,303 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 115 [2019-05-23 09:51:12,304 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:12,304 INFO L146 ILogger]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2019-05-23 09:51:12,304 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:12,304 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:12,304 INFO L146 ILogger]: Analyzing trace with hash -980230239, now seen corresponding path program 54 times [2019-05-23 09:51:12,305 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:12,334 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:12,340 INFO L146 ILogger]: Trace formula consists of 287 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 09:51:12,343 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:14,002 INFO L146 ILogger]: Checked inductivity of 1513 backedges. 0 proven. 1513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:14,002 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:14,002 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:51:14,002 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:51:14,002 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:51:14,003 INFO L146 ILogger]: CoverageRelationStatistics Valid=145, Invalid=3395, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:51:14,003 INFO L146 ILogger]: Start difference. First operand 115 states and 116 transitions. Second operand 60 states. [2019-05-23 09:51:17,122 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:17,122 INFO L146 ILogger]: Finished difference Result 119 states and 120 transitions. [2019-05-23 09:51:17,123 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:51:17,123 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 114 [2019-05-23 09:51:17,124 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:17,124 INFO L146 ILogger]: With dead ends: 119 [2019-05-23 09:51:17,125 INFO L146 ILogger]: Without dead ends: 119 [2019-05-23 09:51:17,125 INFO L146 ILogger]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=3510, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:51:17,126 INFO L146 ILogger]: Start minimizeSevpa. Operand 119 states. [2019-05-23 09:51:17,127 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-05-23 09:51:17,127 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 09:51:17,128 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-05-23 09:51:17,128 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 114 [2019-05-23 09:51:17,128 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:17,128 INFO L146 ILogger]: Abstraction has 118 states and 119 transitions. [2019-05-23 09:51:17,128 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:51:17,128 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 119 transitions. [2019-05-23 09:51:17,129 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 09:51:17,129 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:17,129 INFO L146 ILogger]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1] [2019-05-23 09:51:17,129 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:17,130 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:17,130 INFO L146 ILogger]: Analyzing trace with hash -555375730, now seen corresponding path program 55 times [2019-05-23 09:51:17,130 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:17,154 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:17,160 INFO L146 ILogger]: Trace formula consists of 293 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:51:17,162 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:18,318 INFO L146 ILogger]: Checked inductivity of 1596 backedges. 1190 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:18,318 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:18,318 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:51:18,319 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:51:18,319 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:51:18,319 INFO L146 ILogger]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:51:18,319 INFO L146 ILogger]: Start difference. First operand 118 states and 119 transitions. Second operand 60 states. [2019-05-23 09:51:19,737 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:19,737 INFO L146 ILogger]: Finished difference Result 204 states and 205 transitions. [2019-05-23 09:51:19,738 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:51:19,738 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 117 [2019-05-23 09:51:19,738 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:19,739 INFO L146 ILogger]: With dead ends: 204 [2019-05-23 09:51:19,739 INFO L146 ILogger]: Without dead ends: 119 [2019-05-23 09:51:19,740 INFO L146 ILogger]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:51:19,740 INFO L146 ILogger]: Start minimizeSevpa. Operand 119 states. [2019-05-23 09:51:19,742 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-05-23 09:51:19,742 INFO L146 ILogger]: Start removeUnreachable. Operand 119 states. [2019-05-23 09:51:19,742 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-05-23 09:51:19,742 INFO L146 ILogger]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 117 [2019-05-23 09:51:19,742 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:19,743 INFO L146 ILogger]: Abstraction has 119 states and 120 transitions. [2019-05-23 09:51:19,743 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:51:19,743 INFO L146 ILogger]: Start isEmpty. Operand 119 states and 120 transitions. [2019-05-23 09:51:19,743 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 119 [2019-05-23 09:51:19,743 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:19,744 INFO L146 ILogger]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2019-05-23 09:51:19,744 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:19,744 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:19,744 INFO L146 ILogger]: Analyzing trace with hash 112972616, now seen corresponding path program 56 times [2019-05-23 09:51:19,745 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:19,772 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:19,777 INFO L146 ILogger]: Trace formula consists of 297 conjuncts, 121 conjunts are in the unsatisfiable core [2019-05-23 09:51:19,779 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:21,564 INFO L146 ILogger]: Checked inductivity of 1625 backedges. 0 proven. 1625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:21,564 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:21,564 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:51:21,564 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:51:21,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:51:21,565 INFO L146 ILogger]: CoverageRelationStatistics Valid=150, Invalid=3632, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:51:21,565 INFO L146 ILogger]: Start difference. First operand 119 states and 120 transitions. Second operand 62 states. [2019-05-23 09:51:24,953 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:24,953 INFO L146 ILogger]: Finished difference Result 123 states and 124 transitions. [2019-05-23 09:51:24,953 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:51:24,954 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 118 [2019-05-23 09:51:24,954 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:24,954 INFO L146 ILogger]: With dead ends: 123 [2019-05-23 09:51:24,955 INFO L146 ILogger]: Without dead ends: 123 [2019-05-23 09:51:24,955 INFO L146 ILogger]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=155, Invalid=3751, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:51:24,956 INFO L146 ILogger]: Start minimizeSevpa. Operand 123 states. [2019-05-23 09:51:24,957 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-05-23 09:51:24,957 INFO L146 ILogger]: Start removeUnreachable. Operand 122 states. [2019-05-23 09:51:24,957 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-05-23 09:51:24,957 INFO L146 ILogger]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 118 [2019-05-23 09:51:24,957 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:24,957 INFO L146 ILogger]: Abstraction has 122 states and 123 transitions. [2019-05-23 09:51:24,957 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:51:24,958 INFO L146 ILogger]: Start isEmpty. Operand 122 states and 123 transitions. [2019-05-23 09:51:24,958 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 122 [2019-05-23 09:51:24,958 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:24,958 INFO L146 ILogger]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1] [2019-05-23 09:51:24,958 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:24,958 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:24,959 INFO L146 ILogger]: Analyzing trace with hash -1686127993, now seen corresponding path program 57 times [2019-05-23 09:51:24,959 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:24,983 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:24,989 INFO L146 ILogger]: Trace formula consists of 303 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:51:24,991 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:26,959 INFO L146 ILogger]: Checked inductivity of 1711 backedges. 1276 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:26,959 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:26,959 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:51:26,959 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:51:26,960 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:51:26,960 INFO L146 ILogger]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:51:26,960 INFO L146 ILogger]: Start difference. First operand 122 states and 123 transitions. Second operand 62 states. [2019-05-23 09:51:28,836 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:28,836 INFO L146 ILogger]: Finished difference Result 211 states and 212 transitions. [2019-05-23 09:51:28,837 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:51:28,837 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 121 [2019-05-23 09:51:28,837 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:28,838 INFO L146 ILogger]: With dead ends: 211 [2019-05-23 09:51:28,838 INFO L146 ILogger]: Without dead ends: 123 [2019-05-23 09:51:28,839 INFO L146 ILogger]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:51:28,839 INFO L146 ILogger]: Start minimizeSevpa. Operand 123 states. [2019-05-23 09:51:28,841 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-05-23 09:51:28,841 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 09:51:28,842 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-05-23 09:51:28,842 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 121 [2019-05-23 09:51:28,842 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:28,842 INFO L146 ILogger]: Abstraction has 123 states and 124 transitions. [2019-05-23 09:51:28,842 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:51:28,843 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 124 transitions. [2019-05-23 09:51:28,843 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 09:51:28,843 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:28,844 INFO L146 ILogger]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2019-05-23 09:51:28,844 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:28,844 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:28,844 INFO L146 ILogger]: Analyzing trace with hash -1998357183, now seen corresponding path program 58 times [2019-05-23 09:51:28,845 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:28,873 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:28,878 INFO L146 ILogger]: Trace formula consists of 307 conjuncts, 125 conjunts are in the unsatisfiable core [2019-05-23 09:51:28,882 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:30,996 INFO L146 ILogger]: Checked inductivity of 1741 backedges. 0 proven. 1741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:30,997 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:30,997 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:51:30,997 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:51:30,997 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:51:30,997 INFO L146 ILogger]: CoverageRelationStatistics Valid=155, Invalid=3877, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:51:30,997 INFO L146 ILogger]: Start difference. First operand 123 states and 124 transitions. Second operand 64 states. [2019-05-23 09:51:34,380 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:34,380 INFO L146 ILogger]: Finished difference Result 127 states and 128 transitions. [2019-05-23 09:51:34,380 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:51:34,380 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 122 [2019-05-23 09:51:34,381 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:34,381 INFO L146 ILogger]: With dead ends: 127 [2019-05-23 09:51:34,381 INFO L146 ILogger]: Without dead ends: 127 [2019-05-23 09:51:34,382 INFO L146 ILogger]: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=160, Invalid=4000, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:51:34,382 INFO L146 ILogger]: Start minimizeSevpa. Operand 127 states. [2019-05-23 09:51:34,384 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-05-23 09:51:34,384 INFO L146 ILogger]: Start removeUnreachable. Operand 126 states. [2019-05-23 09:51:34,384 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-05-23 09:51:34,384 INFO L146 ILogger]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 122 [2019-05-23 09:51:34,385 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:34,385 INFO L146 ILogger]: Abstraction has 126 states and 127 transitions. [2019-05-23 09:51:34,385 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:51:34,385 INFO L146 ILogger]: Start isEmpty. Operand 126 states and 127 transitions. [2019-05-23 09:51:34,385 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 126 [2019-05-23 09:51:34,385 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:34,386 INFO L146 ILogger]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1] [2019-05-23 09:51:34,386 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:34,386 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:34,386 INFO L146 ILogger]: Analyzing trace with hash -516120082, now seen corresponding path program 59 times [2019-05-23 09:51:34,386 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:34,409 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:34,416 INFO L146 ILogger]: Trace formula consists of 313 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:51:34,418 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:35,737 INFO L146 ILogger]: Checked inductivity of 1830 backedges. 1365 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:35,737 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:35,737 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:51:35,738 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:51:35,738 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:51:35,738 INFO L146 ILogger]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:51:35,738 INFO L146 ILogger]: Start difference. First operand 126 states and 127 transitions. Second operand 64 states. [2019-05-23 09:51:37,454 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:37,454 INFO L146 ILogger]: Finished difference Result 218 states and 219 transitions. [2019-05-23 09:51:37,455 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:51:37,455 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 125 [2019-05-23 09:51:37,455 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:37,456 INFO L146 ILogger]: With dead ends: 218 [2019-05-23 09:51:37,456 INFO L146 ILogger]: Without dead ends: 127 [2019-05-23 09:51:37,457 INFO L146 ILogger]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:51:37,457 INFO L146 ILogger]: Start minimizeSevpa. Operand 127 states. [2019-05-23 09:51:37,458 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-05-23 09:51:37,458 INFO L146 ILogger]: Start removeUnreachable. Operand 127 states. [2019-05-23 09:51:37,458 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-05-23 09:51:37,459 INFO L146 ILogger]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2019-05-23 09:51:37,459 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:37,459 INFO L146 ILogger]: Abstraction has 127 states and 128 transitions. [2019-05-23 09:51:37,459 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:51:37,459 INFO L146 ILogger]: Start isEmpty. Operand 127 states and 128 transitions. [2019-05-23 09:51:37,459 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 127 [2019-05-23 09:51:37,459 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:37,459 INFO L146 ILogger]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2019-05-23 09:51:37,460 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:37,460 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:37,460 INFO L146 ILogger]: Analyzing trace with hash 489453480, now seen corresponding path program 60 times [2019-05-23 09:51:37,460 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:37,489 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:37,494 INFO L146 ILogger]: Trace formula consists of 317 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 09:51:37,496 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:39,490 INFO L146 ILogger]: Checked inductivity of 1861 backedges. 0 proven. 1861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:39,490 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:39,490 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:51:39,490 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:51:39,491 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:51:39,491 INFO L146 ILogger]: CoverageRelationStatistics Valid=160, Invalid=4130, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:51:39,491 INFO L146 ILogger]: Start difference. First operand 127 states and 128 transitions. Second operand 66 states. [2019-05-23 09:51:43,140 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:43,141 INFO L146 ILogger]: Finished difference Result 131 states and 132 transitions. [2019-05-23 09:51:43,141 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:51:43,141 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 126 [2019-05-23 09:51:43,141 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:43,142 INFO L146 ILogger]: With dead ends: 131 [2019-05-23 09:51:43,142 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:51:43,142 INFO L146 ILogger]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=165, Invalid=4257, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:51:43,143 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:51:43,145 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-05-23 09:51:43,145 INFO L146 ILogger]: Start removeUnreachable. Operand 130 states. [2019-05-23 09:51:43,145 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-05-23 09:51:43,145 INFO L146 ILogger]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 126 [2019-05-23 09:51:43,145 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:43,145 INFO L146 ILogger]: Abstraction has 130 states and 131 transitions. [2019-05-23 09:51:43,146 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:51:43,146 INFO L146 ILogger]: Start isEmpty. Operand 130 states and 131 transitions. [2019-05-23 09:51:43,146 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 130 [2019-05-23 09:51:43,146 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:43,146 INFO L146 ILogger]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1] [2019-05-23 09:51:43,146 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:43,147 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:43,147 INFO L146 ILogger]: Analyzing trace with hash -104318425, now seen corresponding path program 61 times [2019-05-23 09:51:43,147 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:43,165 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:43,170 INFO L146 ILogger]: Trace formula consists of 323 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:51:43,172 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:44,642 INFO L146 ILogger]: Checked inductivity of 1953 backedges. 1457 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:44,643 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:44,643 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:51:44,643 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:51:44,644 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:51:44,644 INFO L146 ILogger]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:51:44,644 INFO L146 ILogger]: Start difference. First operand 130 states and 131 transitions. Second operand 66 states. [2019-05-23 09:51:46,690 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:46,690 INFO L146 ILogger]: Finished difference Result 225 states and 226 transitions. [2019-05-23 09:51:46,690 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:51:46,690 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 129 [2019-05-23 09:51:46,690 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:46,691 INFO L146 ILogger]: With dead ends: 225 [2019-05-23 09:51:46,691 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:51:46,691 INFO L146 ILogger]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:51:46,692 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Start removeUnreachable. Operand 131 states. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 129 [2019-05-23 09:51:46,693 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Abstraction has 131 states and 132 transitions. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:51:46,693 INFO L146 ILogger]: Start isEmpty. Operand 131 states and 132 transitions. [2019-05-23 09:51:46,694 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 131 [2019-05-23 09:51:46,694 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:46,694 INFO L146 ILogger]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2019-05-23 09:51:46,694 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:46,694 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:46,694 INFO L146 ILogger]: Analyzing trace with hash 1778557665, now seen corresponding path program 62 times [2019-05-23 09:51:46,695 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:46,722 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:46,728 INFO L146 ILogger]: Trace formula consists of 327 conjuncts, 133 conjunts are in the unsatisfiable core [2019-05-23 09:51:46,730 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:48,906 INFO L146 ILogger]: Checked inductivity of 1985 backedges. 0 proven. 1985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:48,906 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:48,907 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:51:48,907 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:51:48,907 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:51:48,907 INFO L146 ILogger]: CoverageRelationStatistics Valid=165, Invalid=4391, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:51:48,908 INFO L146 ILogger]: Start difference. First operand 131 states and 132 transitions. Second operand 68 states. [2019-05-23 09:51:52,904 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:52,904 INFO L146 ILogger]: Finished difference Result 135 states and 136 transitions. [2019-05-23 09:51:52,904 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:51:52,904 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 130 [2019-05-23 09:51:52,905 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:52,905 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 09:51:52,906 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 09:51:52,906 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=170, Invalid=4522, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:51:52,906 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 09:51:52,908 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-05-23 09:51:52,908 INFO L146 ILogger]: Start removeUnreachable. Operand 134 states. [2019-05-23 09:51:52,909 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-05-23 09:51:52,909 INFO L146 ILogger]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 130 [2019-05-23 09:51:52,909 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:52,909 INFO L146 ILogger]: Abstraction has 134 states and 135 transitions. [2019-05-23 09:51:52,909 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:51:52,910 INFO L146 ILogger]: Start isEmpty. Operand 134 states and 135 transitions. [2019-05-23 09:51:52,910 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:51:52,910 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:52,910 INFO L146 ILogger]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1] [2019-05-23 09:51:52,911 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:52,911 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:52,911 INFO L146 ILogger]: Analyzing trace with hash -1999103922, now seen corresponding path program 63 times [2019-05-23 09:51:52,912 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:52,933 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:52,938 INFO L146 ILogger]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:51:52,940 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:57,161 INFO L146 ILogger]: Checked inductivity of 2080 backedges. 1552 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:57,161 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:57,161 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:51:57,162 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:51:57,162 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:51:57,162 INFO L146 ILogger]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:51:57,163 INFO L146 ILogger]: Start difference. First operand 134 states and 135 transitions. Second operand 68 states. [2019-05-23 09:51:58,543 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:58,543 INFO L146 ILogger]: Finished difference Result 232 states and 233 transitions. [2019-05-23 09:51:58,544 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:51:58,544 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 133 [2019-05-23 09:51:58,544 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:58,545 INFO L146 ILogger]: With dead ends: 232 [2019-05-23 09:51:58,545 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 09:51:58,546 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:51:58,547 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 09:51:58,548 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-05-23 09:51:58,548 INFO L146 ILogger]: Start removeUnreachable. Operand 135 states. [2019-05-23 09:51:58,548 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-05-23 09:51:58,549 INFO L146 ILogger]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 133 [2019-05-23 09:51:58,549 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:58,549 INFO L146 ILogger]: Abstraction has 135 states and 136 transitions. [2019-05-23 09:51:58,549 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:51:58,549 INFO L146 ILogger]: Start isEmpty. Operand 135 states and 136 transitions. [2019-05-23 09:51:58,550 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 135 [2019-05-23 09:51:58,550 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:58,550 INFO L146 ILogger]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2019-05-23 09:51:58,550 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:58,550 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:58,550 INFO L146 ILogger]: Analyzing trace with hash 266048520, now seen corresponding path program 64 times [2019-05-23 09:51:58,551 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:58,584 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:58,589 INFO L146 ILogger]: Trace formula consists of 337 conjuncts, 137 conjunts are in the unsatisfiable core [2019-05-23 09:51:58,592 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:00,884 INFO L146 ILogger]: Checked inductivity of 2113 backedges. 0 proven. 2113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:00,885 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:00,885 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:52:00,885 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:52:00,885 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:52:00,885 INFO L146 ILogger]: CoverageRelationStatistics Valid=170, Invalid=4660, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:52:00,885 INFO L146 ILogger]: Start difference. First operand 135 states and 136 transitions. Second operand 70 states. [2019-05-23 09:52:04,903 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:04,904 INFO L146 ILogger]: Finished difference Result 139 states and 140 transitions. [2019-05-23 09:52:04,904 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:52:04,904 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 134 [2019-05-23 09:52:04,904 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:04,905 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 09:52:04,905 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:52:04,906 INFO L146 ILogger]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=175, Invalid=4795, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:52:04,906 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:52:04,908 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-05-23 09:52:04,908 INFO L146 ILogger]: Start removeUnreachable. Operand 138 states. [2019-05-23 09:52:04,909 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-05-23 09:52:04,909 INFO L146 ILogger]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2019-05-23 09:52:04,909 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:04,909 INFO L146 ILogger]: Abstraction has 138 states and 139 transitions. [2019-05-23 09:52:04,909 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:52:04,909 INFO L146 ILogger]: Start isEmpty. Operand 138 states and 139 transitions. [2019-05-23 09:52:04,910 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 138 [2019-05-23 09:52:04,910 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:04,910 INFO L146 ILogger]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1] [2019-05-23 09:52:04,910 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:04,910 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:04,911 INFO L146 ILogger]: Analyzing trace with hash 1637827015, now seen corresponding path program 65 times [2019-05-23 09:52:04,911 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:04,939 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:04,947 INFO L146 ILogger]: Trace formula consists of 343 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:52:04,949 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:06,450 INFO L146 ILogger]: Checked inductivity of 2211 backedges. 1650 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:06,450 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:06,450 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:52:06,451 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:52:06,451 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:52:06,451 INFO L146 ILogger]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:52:06,451 INFO L146 ILogger]: Start difference. First operand 138 states and 139 transitions. Second operand 70 states. [2019-05-23 09:52:07,728 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:07,729 INFO L146 ILogger]: Finished difference Result 239 states and 240 transitions. [2019-05-23 09:52:07,729 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:52:07,729 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 137 [2019-05-23 09:52:07,729 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:07,730 INFO L146 ILogger]: With dead ends: 239 [2019-05-23 09:52:07,730 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:52:07,731 INFO L146 ILogger]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:52:07,731 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:52:07,733 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-05-23 09:52:07,733 INFO L146 ILogger]: Start removeUnreachable. Operand 139 states. [2019-05-23 09:52:07,733 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-05-23 09:52:07,733 INFO L146 ILogger]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2019-05-23 09:52:07,734 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:07,734 INFO L146 ILogger]: Abstraction has 139 states and 140 transitions. [2019-05-23 09:52:07,734 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:52:07,734 INFO L146 ILogger]: Start isEmpty. Operand 139 states and 140 transitions. [2019-05-23 09:52:07,734 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 139 [2019-05-23 09:52:07,735 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:07,735 INFO L146 ILogger]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2019-05-23 09:52:07,735 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:07,735 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:07,735 INFO L146 ILogger]: Analyzing trace with hash 2125090945, now seen corresponding path program 66 times [2019-05-23 09:52:07,736 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:07,768 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:07,774 INFO L146 ILogger]: Trace formula consists of 347 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 09:52:07,777 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:10,314 INFO L146 ILogger]: Checked inductivity of 2245 backedges. 0 proven. 2245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:10,314 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:10,314 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:52:10,315 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:52:10,315 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:52:10,315 INFO L146 ILogger]: CoverageRelationStatistics Valid=175, Invalid=4937, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:52:10,315 INFO L146 ILogger]: Start difference. First operand 139 states and 140 transitions. Second operand 72 states. [2019-05-23 09:52:14,649 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:14,649 INFO L146 ILogger]: Finished difference Result 143 states and 144 transitions. [2019-05-23 09:52:14,650 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:52:14,650 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 138 [2019-05-23 09:52:14,650 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:14,651 INFO L146 ILogger]: With dead ends: 143 [2019-05-23 09:52:14,651 INFO L146 ILogger]: Without dead ends: 143 [2019-05-23 09:52:14,652 INFO L146 ILogger]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=180, Invalid=5076, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:52:14,652 INFO L146 ILogger]: Start minimizeSevpa. Operand 143 states. [2019-05-23 09:52:14,653 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-05-23 09:52:14,654 INFO L146 ILogger]: Start removeUnreachable. Operand 142 states. [2019-05-23 09:52:14,654 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-05-23 09:52:14,654 INFO L146 ILogger]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 138 [2019-05-23 09:52:14,654 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:14,654 INFO L146 ILogger]: Abstraction has 142 states and 143 transitions. [2019-05-23 09:52:14,655 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:52:14,655 INFO L146 ILogger]: Start isEmpty. Operand 142 states and 143 transitions. [2019-05-23 09:52:14,655 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 09:52:14,655 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:14,655 INFO L146 ILogger]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1] [2019-05-23 09:52:14,655 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:14,656 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:14,656 INFO L146 ILogger]: Analyzing trace with hash 767428270, now seen corresponding path program 67 times [2019-05-23 09:52:14,656 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:14,687 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:14,697 INFO L146 ILogger]: Trace formula consists of 353 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:52:14,700 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:16,235 INFO L146 ILogger]: Checked inductivity of 2346 backedges. 1751 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:16,235 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:16,235 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:52:16,236 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:52:16,236 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:52:16,236 INFO L146 ILogger]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:52:16,236 INFO L146 ILogger]: Start difference. First operand 142 states and 143 transitions. Second operand 72 states. [2019-05-23 09:52:17,953 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:17,953 INFO L146 ILogger]: Finished difference Result 246 states and 247 transitions. [2019-05-23 09:52:17,954 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:52:17,954 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 141 [2019-05-23 09:52:17,954 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:17,955 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 09:52:17,955 INFO L146 ILogger]: Without dead ends: 143 [2019-05-23 09:52:17,956 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:52:17,956 INFO L146 ILogger]: Start minimizeSevpa. Operand 143 states. [2019-05-23 09:52:17,957 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-05-23 09:52:17,958 INFO L146 ILogger]: Start removeUnreachable. Operand 143 states. [2019-05-23 09:52:17,958 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-05-23 09:52:17,958 INFO L146 ILogger]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 141 [2019-05-23 09:52:17,958 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:17,958 INFO L146 ILogger]: Abstraction has 143 states and 144 transitions. [2019-05-23 09:52:17,958 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:52:17,959 INFO L146 ILogger]: Start isEmpty. Operand 143 states and 144 transitions. [2019-05-23 09:52:17,959 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 143 [2019-05-23 09:52:17,959 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:17,959 INFO L146 ILogger]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2019-05-23 09:52:17,959 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:17,960 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:17,960 INFO L146 ILogger]: Analyzing trace with hash -1664145304, now seen corresponding path program 68 times [2019-05-23 09:52:17,960 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:17,995 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:18,002 INFO L146 ILogger]: Trace formula consists of 357 conjuncts, 145 conjunts are in the unsatisfiable core [2019-05-23 09:52:18,004 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:20,701 INFO L146 ILogger]: Checked inductivity of 2381 backedges. 0 proven. 2381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:20,701 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:20,702 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:52:20,702 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:52:20,702 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:52:20,703 INFO L146 ILogger]: CoverageRelationStatistics Valid=180, Invalid=5222, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:52:20,703 INFO L146 ILogger]: Start difference. First operand 143 states and 144 transitions. Second operand 74 states. [2019-05-23 09:52:25,731 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:25,732 INFO L146 ILogger]: Finished difference Result 147 states and 148 transitions. [2019-05-23 09:52:25,732 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:52:25,732 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 142 [2019-05-23 09:52:25,732 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:25,733 INFO L146 ILogger]: With dead ends: 147 [2019-05-23 09:52:25,734 INFO L146 ILogger]: Without dead ends: 147 [2019-05-23 09:52:25,734 INFO L146 ILogger]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=185, Invalid=5365, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:52:25,734 INFO L146 ILogger]: Start minimizeSevpa. Operand 147 states. [2019-05-23 09:52:25,736 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-05-23 09:52:25,736 INFO L146 ILogger]: Start removeUnreachable. Operand 146 states. [2019-05-23 09:52:25,737 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-05-23 09:52:25,737 INFO L146 ILogger]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 142 [2019-05-23 09:52:25,737 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:25,737 INFO L146 ILogger]: Abstraction has 146 states and 147 transitions. [2019-05-23 09:52:25,737 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:52:25,737 INFO L146 ILogger]: Start isEmpty. Operand 146 states and 147 transitions. [2019-05-23 09:52:25,738 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 146 [2019-05-23 09:52:25,738 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:25,738 INFO L146 ILogger]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1] [2019-05-23 09:52:25,738 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:25,738 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:25,738 INFO L146 ILogger]: Analyzing trace with hash 255775079, now seen corresponding path program 69 times [2019-05-23 09:52:25,739 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:25,767 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:25,773 INFO L146 ILogger]: Trace formula consists of 363 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:52:25,774 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:27,449 INFO L146 ILogger]: Checked inductivity of 2485 backedges. 1855 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:27,449 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:27,449 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:52:27,449 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:52:27,450 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:52:27,450 INFO L146 ILogger]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:52:27,450 INFO L146 ILogger]: Start difference. First operand 146 states and 147 transitions. Second operand 74 states. [2019-05-23 09:52:27,618 WARN L146 ILogger]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-05-23 09:52:29,176 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:29,176 INFO L146 ILogger]: Finished difference Result 253 states and 254 transitions. [2019-05-23 09:52:29,176 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:52:29,176 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 145 [2019-05-23 09:52:29,177 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:29,177 INFO L146 ILogger]: With dead ends: 253 [2019-05-23 09:52:29,178 INFO L146 ILogger]: Without dead ends: 147 [2019-05-23 09:52:29,178 INFO L146 ILogger]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:52:29,179 INFO L146 ILogger]: Start minimizeSevpa. Operand 147 states. [2019-05-23 09:52:29,181 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-05-23 09:52:29,181 INFO L146 ILogger]: Start removeUnreachable. Operand 147 states. [2019-05-23 09:52:29,181 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-05-23 09:52:29,181 INFO L146 ILogger]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 145 [2019-05-23 09:52:29,182 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:29,182 INFO L146 ILogger]: Abstraction has 147 states and 148 transitions. [2019-05-23 09:52:29,182 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:52:29,182 INFO L146 ILogger]: Start isEmpty. Operand 147 states and 148 transitions. [2019-05-23 09:52:29,182 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 147 [2019-05-23 09:52:29,183 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:29,183 INFO L146 ILogger]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2019-05-23 09:52:29,183 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:29,183 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:29,183 INFO L146 ILogger]: Analyzing trace with hash 1762952737, now seen corresponding path program 70 times [2019-05-23 09:52:29,184 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:29,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:29,225 INFO L146 ILogger]: Trace formula consists of 367 conjuncts, 149 conjunts are in the unsatisfiable core [2019-05-23 09:52:29,226 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:31,778 INFO L146 ILogger]: Checked inductivity of 2521 backedges. 0 proven. 2521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:31,778 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:31,778 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:52:31,779 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:52:31,779 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:52:31,779 INFO L146 ILogger]: CoverageRelationStatistics Valid=185, Invalid=5515, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:52:31,779 INFO L146 ILogger]: Start difference. First operand 147 states and 148 transitions. Second operand 76 states. [2019-05-23 09:52:36,977 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:36,977 INFO L146 ILogger]: Finished difference Result 151 states and 152 transitions. [2019-05-23 09:52:36,978 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:52:36,978 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 146 [2019-05-23 09:52:36,978 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:36,979 INFO L146 ILogger]: With dead ends: 151 [2019-05-23 09:52:36,979 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 09:52:36,980 INFO L146 ILogger]: 0 DeclaredPredicates, 146 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=190, Invalid=5662, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:52:36,980 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 09:52:36,981 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-05-23 09:52:36,982 INFO L146 ILogger]: Start removeUnreachable. Operand 150 states. [2019-05-23 09:52:36,982 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-05-23 09:52:36,982 INFO L146 ILogger]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 146 [2019-05-23 09:52:36,983 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:36,983 INFO L146 ILogger]: Abstraction has 150 states and 151 transitions. [2019-05-23 09:52:36,983 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:52:36,983 INFO L146 ILogger]: Start isEmpty. Operand 150 states and 151 transitions. [2019-05-23 09:52:36,984 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 150 [2019-05-23 09:52:36,984 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:36,984 INFO L146 ILogger]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1] [2019-05-23 09:52:36,984 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:36,984 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:36,984 INFO L146 ILogger]: Analyzing trace with hash 1265921294, now seen corresponding path program 71 times [2019-05-23 09:52:36,985 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:37,016 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:37,024 INFO L146 ILogger]: Trace formula consists of 373 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:52:37,025 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:38,949 INFO L146 ILogger]: Checked inductivity of 2628 backedges. 1962 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:38,950 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:38,950 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:52:38,950 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:52:38,950 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:52:38,951 INFO L146 ILogger]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:52:38,951 INFO L146 ILogger]: Start difference. First operand 150 states and 151 transitions. Second operand 76 states. [2019-05-23 09:52:40,377 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:40,377 INFO L146 ILogger]: Finished difference Result 260 states and 261 transitions. [2019-05-23 09:52:40,377 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:52:40,378 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 149 [2019-05-23 09:52:40,378 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:40,379 INFO L146 ILogger]: With dead ends: 260 [2019-05-23 09:52:40,379 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 09:52:40,379 INFO L146 ILogger]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:52:40,380 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 09:52:40,381 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-05-23 09:52:40,381 INFO L146 ILogger]: Start removeUnreachable. Operand 151 states. [2019-05-23 09:52:40,381 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-05-23 09:52:40,382 INFO L146 ILogger]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2019-05-23 09:52:40,382 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:40,382 INFO L146 ILogger]: Abstraction has 151 states and 152 transitions. [2019-05-23 09:52:40,382 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:52:40,382 INFO L146 ILogger]: Start isEmpty. Operand 151 states and 152 transitions. [2019-05-23 09:52:40,382 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 151 [2019-05-23 09:52:40,383 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:40,383 INFO L146 ILogger]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2019-05-23 09:52:40,383 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:40,383 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:40,383 INFO L146 ILogger]: Analyzing trace with hash -1517472568, now seen corresponding path program 72 times [2019-05-23 09:52:40,384 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:40,410 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:40,417 INFO L146 ILogger]: Trace formula consists of 377 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 09:52:40,419 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:43,188 INFO L146 ILogger]: Checked inductivity of 2665 backedges. 0 proven. 2665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:43,188 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:43,189 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:52:43,189 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:52:43,189 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:52:43,189 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=5816, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:52:43,189 INFO L146 ILogger]: Start difference. First operand 151 states and 152 transitions. Second operand 78 states. [2019-05-23 09:52:48,881 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:48,881 INFO L146 ILogger]: Finished difference Result 155 states and 156 transitions. [2019-05-23 09:52:48,882 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:52:48,882 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 150 [2019-05-23 09:52:48,882 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:48,883 INFO L146 ILogger]: With dead ends: 155 [2019-05-23 09:52:48,883 INFO L146 ILogger]: Without dead ends: 155 [2019-05-23 09:52:48,883 INFO L146 ILogger]: 0 DeclaredPredicates, 150 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=195, Invalid=5967, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:52:48,884 INFO L146 ILogger]: Start minimizeSevpa. Operand 155 states. [2019-05-23 09:52:48,886 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-05-23 09:52:48,886 INFO L146 ILogger]: Start removeUnreachable. Operand 154 states. [2019-05-23 09:52:48,886 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-05-23 09:52:48,886 INFO L146 ILogger]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2019-05-23 09:52:48,886 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:48,886 INFO L146 ILogger]: Abstraction has 154 states and 155 transitions. [2019-05-23 09:52:48,887 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:52:48,887 INFO L146 ILogger]: Start isEmpty. Operand 154 states and 155 transitions. [2019-05-23 09:52:48,887 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 154 [2019-05-23 09:52:48,887 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:48,887 INFO L146 ILogger]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1] [2019-05-23 09:52:48,887 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:48,888 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:48,888 INFO L146 ILogger]: Analyzing trace with hash 1801513223, now seen corresponding path program 73 times [2019-05-23 09:52:48,888 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:48,910 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:48,917 INFO L146 ILogger]: Trace formula consists of 383 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:52:48,918 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:50,701 INFO L146 ILogger]: Checked inductivity of 2775 backedges. 2072 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:50,701 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:50,701 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:52:50,701 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:52:50,702 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:52:50,702 INFO L146 ILogger]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:52:50,702 INFO L146 ILogger]: Start difference. First operand 154 states and 155 transitions. Second operand 78 states. [2019-05-23 09:52:52,748 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:52,749 INFO L146 ILogger]: Finished difference Result 267 states and 268 transitions. [2019-05-23 09:52:52,749 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:52:52,749 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 153 [2019-05-23 09:52:52,750 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:52,750 INFO L146 ILogger]: With dead ends: 267 [2019-05-23 09:52:52,750 INFO L146 ILogger]: Without dead ends: 155 [2019-05-23 09:52:52,751 INFO L146 ILogger]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:52:52,752 INFO L146 ILogger]: Start minimizeSevpa. Operand 155 states. [2019-05-23 09:52:52,754 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-05-23 09:52:52,754 INFO L146 ILogger]: Start removeUnreachable. Operand 155 states. [2019-05-23 09:52:52,754 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-05-23 09:52:52,754 INFO L146 ILogger]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 153 [2019-05-23 09:52:52,754 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:52,755 INFO L146 ILogger]: Abstraction has 155 states and 156 transitions. [2019-05-23 09:52:52,755 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:52:52,755 INFO L146 ILogger]: Start isEmpty. Operand 155 states and 156 transitions. [2019-05-23 09:52:52,755 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 09:52:52,755 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:52,755 INFO L146 ILogger]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2019-05-23 09:52:52,756 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:52,756 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:52,756 INFO L146 ILogger]: Analyzing trace with hash -134528063, now seen corresponding path program 74 times [2019-05-23 09:52:52,756 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:52,782 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:52,787 INFO L146 ILogger]: Trace formula consists of 387 conjuncts, 157 conjunts are in the unsatisfiable core [2019-05-23 09:52:52,789 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:55,609 INFO L146 ILogger]: Checked inductivity of 2813 backedges. 0 proven. 2813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:55,609 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:55,609 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:52:55,609 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:52:55,609 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:52:55,610 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=6125, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:52:55,610 INFO L146 ILogger]: Start difference. First operand 155 states and 156 transitions. Second operand 80 states. [2019-05-23 09:53:01,226 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:01,226 INFO L146 ILogger]: Finished difference Result 159 states and 160 transitions. [2019-05-23 09:53:01,227 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:53:01,227 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 154 [2019-05-23 09:53:01,227 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:01,228 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 09:53:01,228 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:53:01,228 INFO L146 ILogger]: 0 DeclaredPredicates, 154 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=200, Invalid=6280, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:53:01,229 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:53:01,230 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-05-23 09:53:01,230 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:53:01,230 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-05-23 09:53:01,231 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 154 [2019-05-23 09:53:01,231 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:01,231 INFO L146 ILogger]: Abstraction has 158 states and 159 transitions. [2019-05-23 09:53:01,231 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:53:01,231 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 159 transitions. [2019-05-23 09:53:01,232 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:53:01,232 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:01,232 INFO L146 ILogger]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1] [2019-05-23 09:53:01,232 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:01,232 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:01,233 INFO L146 ILogger]: Analyzing trace with hash -520008850, now seen corresponding path program 75 times [2019-05-23 09:53:01,233 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:01,261 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:01,268 INFO L146 ILogger]: Trace formula consists of 393 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:53:01,270 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:03,094 INFO L146 ILogger]: Checked inductivity of 2926 backedges. 2185 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:03,094 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:03,094 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:53:03,095 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:53:03,095 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:53:03,095 INFO L146 ILogger]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:53:03,096 INFO L146 ILogger]: Start difference. First operand 158 states and 159 transitions. Second operand 80 states. [2019-05-23 09:53:04,999 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:05,000 INFO L146 ILogger]: Finished difference Result 274 states and 275 transitions. [2019-05-23 09:53:05,000 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:53:05,000 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 157 [2019-05-23 09:53:05,001 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:05,001 INFO L146 ILogger]: With dead ends: 274 [2019-05-23 09:53:05,002 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:53:05,003 INFO L146 ILogger]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:53:05,003 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:53:05,005 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-05-23 09:53:05,005 INFO L146 ILogger]: Start removeUnreachable. Operand 159 states. [2019-05-23 09:53:05,005 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-05-23 09:53:05,005 INFO L146 ILogger]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 157 [2019-05-23 09:53:05,005 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:05,006 INFO L146 ILogger]: Abstraction has 159 states and 160 transitions. [2019-05-23 09:53:05,006 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:53:05,006 INFO L146 ILogger]: Start isEmpty. Operand 159 states and 160 transitions. [2019-05-23 09:53:05,006 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 159 [2019-05-23 09:53:05,006 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:05,007 INFO L146 ILogger]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2019-05-23 09:53:05,007 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:05,007 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:05,007 INFO L146 ILogger]: Analyzing trace with hash -1894008536, now seen corresponding path program 76 times [2019-05-23 09:53:05,008 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:05,066 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:05,073 INFO L146 ILogger]: Trace formula consists of 397 conjuncts, 161 conjunts are in the unsatisfiable core [2019-05-23 09:53:05,076 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:08,398 INFO L146 ILogger]: Checked inductivity of 2965 backedges. 0 proven. 2965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:08,398 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:08,398 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:53:08,399 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:53:08,399 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:53:08,399 INFO L146 ILogger]: CoverageRelationStatistics Valid=200, Invalid=6442, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:53:08,399 INFO L146 ILogger]: Start difference. First operand 159 states and 160 transitions. Second operand 82 states. [2019-05-23 09:53:14,321 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:14,322 INFO L146 ILogger]: Finished difference Result 163 states and 164 transitions. [2019-05-23 09:53:14,322 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:53:14,322 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 158 [2019-05-23 09:53:14,322 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:14,323 INFO L146 ILogger]: With dead ends: 163 [2019-05-23 09:53:14,323 INFO L146 ILogger]: Without dead ends: 163 [2019-05-23 09:53:14,324 INFO L146 ILogger]: 0 DeclaredPredicates, 158 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=205, Invalid=6601, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:53:14,324 INFO L146 ILogger]: Start minimizeSevpa. Operand 163 states. [2019-05-23 09:53:14,326 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-05-23 09:53:14,326 INFO L146 ILogger]: Start removeUnreachable. Operand 162 states. [2019-05-23 09:53:14,327 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-05-23 09:53:14,327 INFO L146 ILogger]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2019-05-23 09:53:14,327 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:14,327 INFO L146 ILogger]: Abstraction has 162 states and 163 transitions. [2019-05-23 09:53:14,327 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:53:14,327 INFO L146 ILogger]: Start isEmpty. Operand 162 states and 163 transitions. [2019-05-23 09:53:14,328 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 162 [2019-05-23 09:53:14,328 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:14,328 INFO L146 ILogger]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1] [2019-05-23 09:53:14,329 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:14,329 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:14,329 INFO L146 ILogger]: Analyzing trace with hash -1421899609, now seen corresponding path program 77 times [2019-05-23 09:53:14,329 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:14,358 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:14,365 INFO L146 ILogger]: Trace formula consists of 403 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:53:14,366 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:16,314 INFO L146 ILogger]: Checked inductivity of 3081 backedges. 2301 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:16,315 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:16,315 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:53:16,315 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:53:16,315 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:53:16,316 INFO L146 ILogger]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:53:16,316 INFO L146 ILogger]: Start difference. First operand 162 states and 163 transitions. Second operand 82 states. [2019-05-23 09:53:18,526 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:18,526 INFO L146 ILogger]: Finished difference Result 281 states and 282 transitions. [2019-05-23 09:53:18,526 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:53:18,526 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 161 [2019-05-23 09:53:18,527 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:18,527 INFO L146 ILogger]: With dead ends: 281 [2019-05-23 09:53:18,528 INFO L146 ILogger]: Without dead ends: 163 [2019-05-23 09:53:18,528 INFO L146 ILogger]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:53:18,529 INFO L146 ILogger]: Start minimizeSevpa. Operand 163 states. [2019-05-23 09:53:18,531 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-05-23 09:53:18,531 INFO L146 ILogger]: Start removeUnreachable. Operand 163 states. [2019-05-23 09:53:18,531 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-05-23 09:53:18,532 INFO L146 ILogger]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2019-05-23 09:53:18,532 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:18,532 INFO L146 ILogger]: Abstraction has 163 states and 164 transitions. [2019-05-23 09:53:18,532 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:53:18,532 INFO L146 ILogger]: Start isEmpty. Operand 163 states and 164 transitions. [2019-05-23 09:53:18,533 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 09:53:18,533 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:18,533 INFO L146 ILogger]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2019-05-23 09:53:18,533 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:18,533 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:18,534 INFO L146 ILogger]: Analyzing trace with hash -963081887, now seen corresponding path program 78 times [2019-05-23 09:53:18,534 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:18,580 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:18,588 INFO L146 ILogger]: Trace formula consists of 407 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 09:53:18,592 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:22,250 INFO L146 ILogger]: Checked inductivity of 3121 backedges. 0 proven. 3121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:22,251 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:22,251 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:53:22,251 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:53:22,251 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:53:22,251 INFO L146 ILogger]: CoverageRelationStatistics Valid=205, Invalid=6767, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:53:22,252 INFO L146 ILogger]: Start difference. First operand 163 states and 164 transitions. Second operand 84 states. [2019-05-23 09:53:27,802 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:27,803 INFO L146 ILogger]: Finished difference Result 167 states and 168 transitions. [2019-05-23 09:53:27,803 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:53:27,803 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 162 [2019-05-23 09:53:27,803 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:27,804 INFO L146 ILogger]: With dead ends: 167 [2019-05-23 09:53:27,804 INFO L146 ILogger]: Without dead ends: 167 [2019-05-23 09:53:27,805 INFO L146 ILogger]: 0 DeclaredPredicates, 162 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=210, Invalid=6930, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:53:27,805 INFO L146 ILogger]: Start minimizeSevpa. Operand 167 states. [2019-05-23 09:53:27,807 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-05-23 09:53:27,817 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 09:53:27,817 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-05-23 09:53:27,817 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 162 [2019-05-23 09:53:27,817 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:27,817 INFO L146 ILogger]: Abstraction has 166 states and 167 transitions. [2019-05-23 09:53:27,818 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:53:27,818 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 167 transitions. [2019-05-23 09:53:27,818 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 166 [2019-05-23 09:53:27,818 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:27,818 INFO L146 ILogger]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1] [2019-05-23 09:53:27,819 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:27,819 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:27,819 INFO L146 ILogger]: Analyzing trace with hash -789929522, now seen corresponding path program 79 times [2019-05-23 09:53:27,820 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:27,846 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:27,854 INFO L146 ILogger]: Trace formula consists of 413 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:53:27,855 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:29,924 INFO L146 ILogger]: Checked inductivity of 3240 backedges. 2420 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:29,924 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:29,924 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:53:29,924 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:53:29,925 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:53:29,925 INFO L146 ILogger]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:53:29,925 INFO L146 ILogger]: Start difference. First operand 166 states and 167 transitions. Second operand 84 states. [2019-05-23 09:53:31,582 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:31,582 INFO L146 ILogger]: Finished difference Result 288 states and 289 transitions. [2019-05-23 09:53:31,583 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:53:31,583 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 165 [2019-05-23 09:53:31,583 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:31,584 INFO L146 ILogger]: With dead ends: 288 [2019-05-23 09:53:31,584 INFO L146 ILogger]: Without dead ends: 167 [2019-05-23 09:53:31,585 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:53:31,585 INFO L146 ILogger]: Start minimizeSevpa. Operand 167 states. [2019-05-23 09:53:31,587 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-05-23 09:53:31,587 INFO L146 ILogger]: Start removeUnreachable. Operand 167 states. [2019-05-23 09:53:31,587 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-05-23 09:53:31,587 INFO L146 ILogger]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 165 [2019-05-23 09:53:31,588 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:31,588 INFO L146 ILogger]: Abstraction has 167 states and 168 transitions. [2019-05-23 09:53:31,588 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:53:31,588 INFO L146 ILogger]: Start isEmpty. Operand 167 states and 168 transitions. [2019-05-23 09:53:31,588 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 167 [2019-05-23 09:53:31,589 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:31,589 INFO L146 ILogger]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2019-05-23 09:53:31,589 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:31,589 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:31,589 INFO L146 ILogger]: Analyzing trace with hash -1577011832, now seen corresponding path program 80 times [2019-05-23 09:53:31,590 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:31,622 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:31,627 INFO L146 ILogger]: Trace formula consists of 417 conjuncts, 169 conjunts are in the unsatisfiable core [2019-05-23 09:53:31,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:34,893 INFO L146 ILogger]: Checked inductivity of 3281 backedges. 0 proven. 3281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:34,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:34,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:53:34,893 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:53:34,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:53:34,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=7100, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:53:34,894 INFO L146 ILogger]: Start difference. First operand 167 states and 168 transitions. Second operand 86 states. [2019-05-23 09:53:41,547 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:41,547 INFO L146 ILogger]: Finished difference Result 171 states and 172 transitions. [2019-05-23 09:53:41,547 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:53:41,547 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 166 [2019-05-23 09:53:41,548 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:41,548 INFO L146 ILogger]: With dead ends: 171 [2019-05-23 09:53:41,549 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:53:41,549 INFO L146 ILogger]: 0 DeclaredPredicates, 166 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=215, Invalid=7267, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:53:41,549 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:53:41,551 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-05-23 09:53:41,551 INFO L146 ILogger]: Start removeUnreachable. Operand 170 states. [2019-05-23 09:53:41,551 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-05-23 09:53:41,551 INFO L146 ILogger]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 166 [2019-05-23 09:53:41,551 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:41,552 INFO L146 ILogger]: Abstraction has 170 states and 171 transitions. [2019-05-23 09:53:41,552 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:53:41,552 INFO L146 ILogger]: Start isEmpty. Operand 170 states and 171 transitions. [2019-05-23 09:53:41,552 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:53:41,552 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:41,552 INFO L146 ILogger]: trace histogram [42, 41, 41, 41, 1, 1, 1, 1] [2019-05-23 09:53:41,553 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:41,553 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:41,553 INFO L146 ILogger]: Analyzing trace with hash 1888792647, now seen corresponding path program 81 times [2019-05-23 09:53:41,553 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:41,594 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:41,601 INFO L146 ILogger]: Trace formula consists of 423 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:53:41,603 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:43,744 INFO L146 ILogger]: Checked inductivity of 3403 backedges. 2542 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:43,744 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:43,744 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:53:43,745 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:53:43,745 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:53:43,746 INFO L146 ILogger]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:53:43,746 INFO L146 ILogger]: Start difference. First operand 170 states and 171 transitions. Second operand 86 states. [2019-05-23 09:53:47,011 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:47,012 INFO L146 ILogger]: Finished difference Result 295 states and 296 transitions. [2019-05-23 09:53:47,012 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:53:47,012 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 169 [2019-05-23 09:53:47,012 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:47,013 INFO L146 ILogger]: With dead ends: 295 [2019-05-23 09:53:47,013 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:53:47,014 INFO L146 ILogger]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:53:47,014 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:53:47,016 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-05-23 09:53:47,016 INFO L146 ILogger]: Start removeUnreachable. Operand 171 states. [2019-05-23 09:53:47,016 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-05-23 09:53:47,017 INFO L146 ILogger]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 169 [2019-05-23 09:53:47,017 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:47,017 INFO L146 ILogger]: Abstraction has 171 states and 172 transitions. [2019-05-23 09:53:47,017 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:53:47,017 INFO L146 ILogger]: Start isEmpty. Operand 171 states and 172 transitions. [2019-05-23 09:53:47,018 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 171 [2019-05-23 09:53:47,018 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:47,018 INFO L146 ILogger]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2019-05-23 09:53:47,018 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:47,018 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:47,018 INFO L146 ILogger]: Analyzing trace with hash -593078527, now seen corresponding path program 82 times [2019-05-23 09:53:47,019 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:47,071 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:47,081 INFO L146 ILogger]: Trace formula consists of 427 conjuncts, 173 conjunts are in the unsatisfiable core [2019-05-23 09:53:47,084 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:50,691 INFO L146 ILogger]: Checked inductivity of 3445 backedges. 0 proven. 3445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:50,692 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:50,692 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:53:50,692 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:53:50,692 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:53:50,693 INFO L146 ILogger]: CoverageRelationStatistics Valid=215, Invalid=7441, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:53:50,693 INFO L146 ILogger]: Start difference. First operand 171 states and 172 transitions. Second operand 88 states. [2019-05-23 09:53:57,837 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:57,837 INFO L146 ILogger]: Finished difference Result 175 states and 176 transitions. [2019-05-23 09:53:57,838 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:53:57,838 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 170 [2019-05-23 09:53:57,838 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:57,839 INFO L146 ILogger]: With dead ends: 175 [2019-05-23 09:53:57,839 INFO L146 ILogger]: Without dead ends: 175 [2019-05-23 09:53:57,840 INFO L146 ILogger]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=220, Invalid=7612, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:53:57,840 INFO L146 ILogger]: Start minimizeSevpa. Operand 175 states. [2019-05-23 09:53:57,841 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-05-23 09:53:57,842 INFO L146 ILogger]: Start removeUnreachable. Operand 174 states. [2019-05-23 09:53:57,842 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-05-23 09:53:57,842 INFO L146 ILogger]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 170 [2019-05-23 09:53:57,843 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:57,843 INFO L146 ILogger]: Abstraction has 174 states and 175 transitions. [2019-05-23 09:53:57,843 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:53:57,843 INFO L146 ILogger]: Start isEmpty. Operand 174 states and 175 transitions. [2019-05-23 09:53:57,844 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 174 [2019-05-23 09:53:57,844 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:57,844 INFO L146 ILogger]: trace histogram [43, 42, 42, 42, 1, 1, 1, 1] [2019-05-23 09:53:57,844 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:57,844 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:57,845 INFO L146 ILogger]: Analyzing trace with hash 1094086702, now seen corresponding path program 83 times [2019-05-23 09:53:57,845 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:57,886 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:57,898 INFO L146 ILogger]: Trace formula consists of 433 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:53:57,900 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:00,136 INFO L146 ILogger]: Checked inductivity of 3570 backedges. 2667 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:00,137 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:00,137 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:54:00,137 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:54:00,138 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:54:00,138 INFO L146 ILogger]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:54:00,138 INFO L146 ILogger]: Start difference. First operand 174 states and 175 transitions. Second operand 88 states. [2019-05-23 09:54:02,407 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:02,407 INFO L146 ILogger]: Finished difference Result 302 states and 303 transitions. [2019-05-23 09:54:02,407 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:54:02,408 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 173 [2019-05-23 09:54:02,408 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:02,409 INFO L146 ILogger]: With dead ends: 302 [2019-05-23 09:54:02,409 INFO L146 ILogger]: Without dead ends: 175 [2019-05-23 09:54:02,410 INFO L146 ILogger]: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:54:02,410 INFO L146 ILogger]: Start minimizeSevpa. Operand 175 states. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Start removeUnreachable. Operand 175 states. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2019-05-23 09:54:02,412 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Abstraction has 175 states and 176 transitions. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:54:02,412 INFO L146 ILogger]: Start isEmpty. Operand 175 states and 176 transitions. [2019-05-23 09:54:02,413 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 175 [2019-05-23 09:54:02,413 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:02,413 INFO L146 ILogger]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2019-05-23 09:54:02,414 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:02,414 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:02,414 INFO L146 ILogger]: Analyzing trace with hash 1782721000, now seen corresponding path program 84 times [2019-05-23 09:54:02,414 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:02,466 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:02,477 INFO L146 ILogger]: Trace formula consists of 437 conjuncts, 177 conjunts are in the unsatisfiable core [2019-05-23 09:54:02,481 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:06,117 INFO L146 ILogger]: Checked inductivity of 3613 backedges. 0 proven. 3613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:06,118 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:06,118 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:54:06,118 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:54:06,118 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:54:06,119 INFO L146 ILogger]: CoverageRelationStatistics Valid=220, Invalid=7790, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:54:06,119 INFO L146 ILogger]: Start difference. First operand 175 states and 176 transitions. Second operand 90 states. [2019-05-23 09:54:13,031 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:13,031 INFO L146 ILogger]: Finished difference Result 179 states and 180 transitions. [2019-05-23 09:54:13,031 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:54:13,031 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 174 [2019-05-23 09:54:13,032 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:13,033 INFO L146 ILogger]: With dead ends: 179 [2019-05-23 09:54:13,033 INFO L146 ILogger]: Without dead ends: 179 [2019-05-23 09:54:13,033 INFO L146 ILogger]: 0 DeclaredPredicates, 174 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=225, Invalid=7965, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:54:13,034 INFO L146 ILogger]: Start minimizeSevpa. Operand 179 states. [2019-05-23 09:54:13,036 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-05-23 09:54:13,036 INFO L146 ILogger]: Start removeUnreachable. Operand 178 states. [2019-05-23 09:54:13,036 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-05-23 09:54:13,036 INFO L146 ILogger]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 174 [2019-05-23 09:54:13,037 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:13,037 INFO L146 ILogger]: Abstraction has 178 states and 179 transitions. [2019-05-23 09:54:13,037 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:54:13,037 INFO L146 ILogger]: Start isEmpty. Operand 178 states and 179 transitions. [2019-05-23 09:54:13,038 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 178 [2019-05-23 09:54:13,038 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:13,038 INFO L146 ILogger]: trace histogram [44, 43, 43, 43, 1, 1, 1, 1] [2019-05-23 09:54:13,038 INFO L146 ILogger]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:13,038 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:13,039 INFO L146 ILogger]: Analyzing trace with hash 1771724775, now seen corresponding path program 85 times [2019-05-23 09:54:13,039 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:13,068 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:13,077 INFO L146 ILogger]: Trace formula consists of 443 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:54:13,078 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:15,377 INFO L146 ILogger]: Checked inductivity of 3741 backedges. 2795 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:15,377 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:15,377 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:54:15,377 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:54:15,378 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:54:15,378 INFO L146 ILogger]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:54:15,378 INFO L146 ILogger]: Start difference. First operand 178 states and 179 transitions. Second operand 90 states. [2019-05-23 09:54:17,180 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:17,180 INFO L146 ILogger]: Finished difference Result 309 states and 310 transitions. [2019-05-23 09:54:17,180 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:54:17,180 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 177 [2019-05-23 09:54:17,181 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:17,182 INFO L146 ILogger]: With dead ends: 309 [2019-05-23 09:54:17,182 INFO L146 ILogger]: Without dead ends: 179 [2019-05-23 09:54:17,183 INFO L146 ILogger]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 09:54:17,183 INFO L146 ILogger]: Start minimizeSevpa. Operand 179 states. [2019-05-23 09:54:17,184 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-05-23 09:54:17,184 INFO L146 ILogger]: Start removeUnreachable. Operand 179 states. [2019-05-23 09:54:17,185 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-05-23 09:54:17,185 INFO L146 ILogger]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 177 [2019-05-23 09:54:17,185 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:17,185 INFO L146 ILogger]: Abstraction has 179 states and 180 transitions. [2019-05-23 09:54:17,185 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:54:17,185 INFO L146 ILogger]: Start isEmpty. Operand 179 states and 180 transitions. [2019-05-23 09:54:17,185 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 179 [2019-05-23 09:54:17,186 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:17,186 INFO L146 ILogger]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2019-05-23 09:54:17,186 INFO L146 ILogger]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:17,186 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:17,186 INFO L146 ILogger]: Analyzing trace with hash 1314827425, now seen corresponding path program 86 times [2019-05-23 09:54:17,187 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:17,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:17,225 INFO L146 ILogger]: Trace formula consists of 447 conjuncts, 181 conjunts are in the unsatisfiable core [2019-05-23 09:54:17,227 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:20,932 INFO L146 ILogger]: Checked inductivity of 3785 backedges. 0 proven. 3785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:20,932 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:20,932 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:54:20,932 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:54:20,933 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:54:20,933 INFO L146 ILogger]: CoverageRelationStatistics Valid=225, Invalid=8147, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:54:20,933 INFO L146 ILogger]: Start difference. First operand 179 states and 180 transitions. Second operand 92 states. [2019-05-23 09:54:28,056 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:28,057 INFO L146 ILogger]: Finished difference Result 183 states and 184 transitions. [2019-05-23 09:54:28,057 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:54:28,057 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 178 [2019-05-23 09:54:28,058 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:28,058 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 09:54:28,059 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 09:54:28,059 INFO L146 ILogger]: 0 DeclaredPredicates, 178 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=230, Invalid=8326, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:54:28,059 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 09:54:28,062 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-05-23 09:54:28,062 INFO L146 ILogger]: Start removeUnreachable. Operand 182 states. [2019-05-23 09:54:28,062 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-05-23 09:54:28,062 INFO L146 ILogger]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 178 [2019-05-23 09:54:28,062 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:28,063 INFO L146 ILogger]: Abstraction has 182 states and 183 transitions. [2019-05-23 09:54:28,063 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:54:28,063 INFO L146 ILogger]: Start isEmpty. Operand 182 states and 183 transitions. [2019-05-23 09:54:28,063 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 09:54:28,063 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:28,064 INFO L146 ILogger]: trace histogram [45, 44, 44, 44, 1, 1, 1, 1] [2019-05-23 09:54:28,064 INFO L146 ILogger]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:28,064 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:28,064 INFO L146 ILogger]: Analyzing trace with hash -76892530, now seen corresponding path program 87 times [2019-05-23 09:54:28,065 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:28,105 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:28,115 INFO L146 ILogger]: Trace formula consists of 453 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:54:28,116 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:30,500 INFO L146 ILogger]: Checked inductivity of 3916 backedges. 2926 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:30,500 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:30,500 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:54:30,500 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:54:30,501 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:54:30,501 INFO L146 ILogger]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:54:30,501 INFO L146 ILogger]: Start difference. First operand 182 states and 183 transitions. Second operand 92 states. [2019-05-23 09:54:32,548 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:32,549 INFO L146 ILogger]: Finished difference Result 316 states and 317 transitions. [2019-05-23 09:54:32,549 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:54:32,549 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 181 [2019-05-23 09:54:32,549 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:32,550 INFO L146 ILogger]: With dead ends: 316 [2019-05-23 09:54:32,550 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 09:54:32,552 INFO L146 ILogger]: 0 DeclaredPredicates, 225 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:54:32,552 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 09:54:32,553 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-05-23 09:54:32,554 INFO L146 ILogger]: Start removeUnreachable. Operand 183 states. [2019-05-23 09:54:32,554 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-05-23 09:54:32,554 INFO L146 ILogger]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 181 [2019-05-23 09:54:32,554 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:32,554 INFO L146 ILogger]: Abstraction has 183 states and 184 transitions. [2019-05-23 09:54:32,554 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:54:32,554 INFO L146 ILogger]: Start isEmpty. Operand 183 states and 184 transitions. [2019-05-23 09:54:32,555 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 09:54:32,555 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:32,555 INFO L146 ILogger]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2019-05-23 09:54:32,555 INFO L146 ILogger]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:32,555 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:32,555 INFO L146 ILogger]: Analyzing trace with hash 392566344, now seen corresponding path program 88 times [2019-05-23 09:54:32,556 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:32,591 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:32,598 INFO L146 ILogger]: Trace formula consists of 457 conjuncts, 185 conjunts are in the unsatisfiable core [2019-05-23 09:54:32,600 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:36,480 INFO L146 ILogger]: Checked inductivity of 3961 backedges. 0 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:36,481 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:36,481 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:54:36,481 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:54:36,481 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:54:36,481 INFO L146 ILogger]: CoverageRelationStatistics Valid=230, Invalid=8512, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:54:36,482 INFO L146 ILogger]: Start difference. First operand 183 states and 184 transitions. Second operand 94 states. [2019-05-23 09:54:44,336 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:44,337 INFO L146 ILogger]: Finished difference Result 187 states and 188 transitions. [2019-05-23 09:54:44,337 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:54:44,337 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 182 [2019-05-23 09:54:44,337 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:44,338 INFO L146 ILogger]: With dead ends: 187 [2019-05-23 09:54:44,338 INFO L146 ILogger]: Without dead ends: 187 [2019-05-23 09:54:44,339 INFO L146 ILogger]: 0 DeclaredPredicates, 182 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=235, Invalid=8695, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:54:44,339 INFO L146 ILogger]: Start minimizeSevpa. Operand 187 states. [2019-05-23 09:54:44,341 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-05-23 09:54:44,341 INFO L146 ILogger]: Start removeUnreachable. Operand 186 states. [2019-05-23 09:54:44,341 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-05-23 09:54:44,341 INFO L146 ILogger]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 182 [2019-05-23 09:54:44,341 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:44,341 INFO L146 ILogger]: Abstraction has 186 states and 187 transitions. [2019-05-23 09:54:44,342 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:54:44,342 INFO L146 ILogger]: Start isEmpty. Operand 186 states and 187 transitions. [2019-05-23 09:54:44,342 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 186 [2019-05-23 09:54:44,342 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:44,342 INFO L146 ILogger]: trace histogram [46, 45, 45, 45, 1, 1, 1, 1] [2019-05-23 09:54:44,343 INFO L146 ILogger]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:44,343 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:44,343 INFO L146 ILogger]: Analyzing trace with hash -250964089, now seen corresponding path program 89 times [2019-05-23 09:54:44,343 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:44,387 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:44,397 INFO L146 ILogger]: Trace formula consists of 463 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:54:44,398 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:46,894 INFO L146 ILogger]: Checked inductivity of 4095 backedges. 3060 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:46,894 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:46,894 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:54:46,894 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:54:46,895 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:54:46,895 INFO L146 ILogger]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:54:46,895 INFO L146 ILogger]: Start difference. First operand 186 states and 187 transitions. Second operand 94 states. [2019-05-23 09:54:49,873 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:49,873 INFO L146 ILogger]: Finished difference Result 323 states and 324 transitions. [2019-05-23 09:54:49,874 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:54:49,874 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 185 [2019-05-23 09:54:49,874 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:49,875 INFO L146 ILogger]: With dead ends: 323 [2019-05-23 09:54:49,875 INFO L146 ILogger]: Without dead ends: 187 [2019-05-23 09:54:49,877 INFO L146 ILogger]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 09:54:49,877 INFO L146 ILogger]: Start minimizeSevpa. Operand 187 states. [2019-05-23 09:54:49,880 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-05-23 09:54:49,880 INFO L146 ILogger]: Start removeUnreachable. Operand 187 states. [2019-05-23 09:54:49,880 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-05-23 09:54:49,880 INFO L146 ILogger]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 185 [2019-05-23 09:54:49,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:49,880 INFO L146 ILogger]: Abstraction has 187 states and 188 transitions. [2019-05-23 09:54:49,881 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:54:49,881 INFO L146 ILogger]: Start isEmpty. Operand 187 states and 188 transitions. [2019-05-23 09:54:49,881 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 187 [2019-05-23 09:54:49,881 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:49,882 INFO L146 ILogger]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2019-05-23 09:54:49,882 INFO L146 ILogger]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:49,882 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:49,882 INFO L146 ILogger]: Analyzing trace with hash -595883455, now seen corresponding path program 90 times [2019-05-23 09:54:49,883 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:49,946 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:49,954 INFO L146 ILogger]: Trace formula consists of 467 conjuncts, 189 conjunts are in the unsatisfiable core [2019-05-23 09:54:49,957 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:54,008 INFO L146 ILogger]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:54,008 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:54,009 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:54:54,009 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:54:54,009 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:54:54,009 INFO L146 ILogger]: CoverageRelationStatistics Valid=235, Invalid=8885, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:54:54,009 INFO L146 ILogger]: Start difference. First operand 187 states and 188 transitions. Second operand 96 states. [2019-05-23 09:55:01,726 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:01,726 INFO L146 ILogger]: Finished difference Result 191 states and 192 transitions. [2019-05-23 09:55:01,726 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:55:01,726 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 186 [2019-05-23 09:55:01,727 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:01,728 INFO L146 ILogger]: With dead ends: 191 [2019-05-23 09:55:01,728 INFO L146 ILogger]: Without dead ends: 191 [2019-05-23 09:55:01,728 INFO L146 ILogger]: 0 DeclaredPredicates, 186 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=240, Invalid=9072, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:55:01,728 INFO L146 ILogger]: Start minimizeSevpa. Operand 191 states. [2019-05-23 09:55:01,729 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-05-23 09:55:01,729 INFO L146 ILogger]: Start removeUnreachable. Operand 190 states. [2019-05-23 09:55:01,730 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-05-23 09:55:01,730 INFO L146 ILogger]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 186 [2019-05-23 09:55:01,730 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:01,730 INFO L146 ILogger]: Abstraction has 190 states and 191 transitions. [2019-05-23 09:55:01,730 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:55:01,730 INFO L146 ILogger]: Start isEmpty. Operand 190 states and 191 transitions. [2019-05-23 09:55:01,731 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 190 [2019-05-23 09:55:01,731 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:01,731 INFO L146 ILogger]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1] [2019-05-23 09:55:01,732 INFO L146 ILogger]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:01,732 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:01,732 INFO L146 ILogger]: Analyzing trace with hash -863144722, now seen corresponding path program 91 times [2019-05-23 09:55:01,732 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:01,766 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:01,787 INFO L146 ILogger]: Trace formula consists of 473 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:55:01,789 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:04,564 INFO L146 ILogger]: Checked inductivity of 4278 backedges. 3197 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:04,564 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:04,564 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:55:04,565 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:55:04,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:55:04,565 INFO L146 ILogger]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:55:04,565 INFO L146 ILogger]: Start difference. First operand 190 states and 191 transitions. Second operand 96 states. [2019-05-23 09:55:07,386 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:07,386 INFO L146 ILogger]: Finished difference Result 330 states and 331 transitions. [2019-05-23 09:55:07,387 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:55:07,387 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 189 [2019-05-23 09:55:07,387 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:07,388 INFO L146 ILogger]: With dead ends: 330 [2019-05-23 09:55:07,388 INFO L146 ILogger]: Without dead ends: 191 [2019-05-23 09:55:07,389 INFO L146 ILogger]: 0 DeclaredPredicates, 235 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:55:07,389 INFO L146 ILogger]: Start minimizeSevpa. Operand 191 states. [2019-05-23 09:55:07,391 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-05-23 09:55:07,391 INFO L146 ILogger]: Start removeUnreachable. Operand 191 states. [2019-05-23 09:55:07,392 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-05-23 09:55:07,392 INFO L146 ILogger]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 189 [2019-05-23 09:55:07,392 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:07,392 INFO L146 ILogger]: Abstraction has 191 states and 192 transitions. [2019-05-23 09:55:07,392 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:55:07,392 INFO L146 ILogger]: Start isEmpty. Operand 191 states and 192 transitions. [2019-05-23 09:55:07,393 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 191 [2019-05-23 09:55:07,393 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:07,393 INFO L146 ILogger]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2019-05-23 09:55:07,393 INFO L146 ILogger]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:07,394 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:07,394 INFO L146 ILogger]: Analyzing trace with hash -596477272, now seen corresponding path program 92 times [2019-05-23 09:55:07,394 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:07,434 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:07,440 INFO L146 ILogger]: Trace formula consists of 477 conjuncts, 193 conjunts are in the unsatisfiable core [2019-05-23 09:55:07,442 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:11,628 INFO L146 ILogger]: Checked inductivity of 4325 backedges. 0 proven. 4325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:11,628 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:11,629 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:55:11,629 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:55:11,629 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:55:11,629 INFO L146 ILogger]: CoverageRelationStatistics Valid=240, Invalid=9266, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:55:11,629 INFO L146 ILogger]: Start difference. First operand 191 states and 192 transitions. Second operand 98 states. [2019-05-23 09:55:19,848 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:19,848 INFO L146 ILogger]: Finished difference Result 195 states and 196 transitions. [2019-05-23 09:55:19,848 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:55:19,849 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 190 [2019-05-23 09:55:19,849 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:19,850 INFO L146 ILogger]: With dead ends: 195 [2019-05-23 09:55:19,850 INFO L146 ILogger]: Without dead ends: 195 [2019-05-23 09:55:19,850 INFO L146 ILogger]: 0 DeclaredPredicates, 190 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=245, Invalid=9457, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:55:19,851 INFO L146 ILogger]: Start minimizeSevpa. Operand 195 states. [2019-05-23 09:55:19,852 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-05-23 09:55:19,853 INFO L146 ILogger]: Start removeUnreachable. Operand 194 states. [2019-05-23 09:55:19,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-05-23 09:55:19,853 INFO L146 ILogger]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 190 [2019-05-23 09:55:19,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:19,853 INFO L146 ILogger]: Abstraction has 194 states and 195 transitions. [2019-05-23 09:55:19,853 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:55:19,853 INFO L146 ILogger]: Start isEmpty. Operand 194 states and 195 transitions. [2019-05-23 09:55:19,854 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 194 [2019-05-23 09:55:19,854 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:19,854 INFO L146 ILogger]: trace histogram [48, 47, 47, 47, 1, 1, 1, 1] [2019-05-23 09:55:19,854 INFO L146 ILogger]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:19,854 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:19,855 INFO L146 ILogger]: Analyzing trace with hash -1373677785, now seen corresponding path program 93 times [2019-05-23 09:55:19,855 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:19,889 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:19,900 INFO L146 ILogger]: Trace formula consists of 483 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:55:19,901 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:22,607 INFO L146 ILogger]: Checked inductivity of 4465 backedges. 3337 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:22,607 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:22,607 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:55:22,608 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:55:22,608 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:55:22,609 INFO L146 ILogger]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:55:22,609 INFO L146 ILogger]: Start difference. First operand 194 states and 195 transitions. Second operand 98 states. [2019-05-23 09:55:25,966 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:25,967 INFO L146 ILogger]: Finished difference Result 337 states and 338 transitions. [2019-05-23 09:55:25,967 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:55:25,967 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 193 [2019-05-23 09:55:25,968 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:25,968 INFO L146 ILogger]: With dead ends: 337 [2019-05-23 09:55:25,969 INFO L146 ILogger]: Without dead ends: 195 [2019-05-23 09:55:25,970 INFO L146 ILogger]: 0 DeclaredPredicates, 240 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 09:55:25,970 INFO L146 ILogger]: Start minimizeSevpa. Operand 195 states. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Start removeUnreachable. Operand 195 states. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 193 [2019-05-23 09:55:25,972 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Abstraction has 195 states and 196 transitions. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:55:25,972 INFO L146 ILogger]: Start isEmpty. Operand 195 states and 196 transitions. [2019-05-23 09:55:25,973 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 195 [2019-05-23 09:55:25,973 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:25,973 INFO L146 ILogger]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2019-05-23 09:55:25,973 INFO L146 ILogger]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:25,973 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:25,973 INFO L146 ILogger]: Analyzing trace with hash -1808338975, now seen corresponding path program 94 times [2019-05-23 09:55:25,974 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:26,036 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:26,046 INFO L146 ILogger]: Trace formula consists of 487 conjuncts, 197 conjunts are in the unsatisfiable core [2019-05-23 09:55:26,049 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:30,443 INFO L146 ILogger]: Checked inductivity of 4513 backedges. 0 proven. 4513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:30,443 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:30,444 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:55:30,444 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:55:30,444 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:55:30,444 INFO L146 ILogger]: CoverageRelationStatistics Valid=245, Invalid=9655, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:55:30,444 INFO L146 ILogger]: Start difference. First operand 195 states and 196 transitions. Second operand 100 states. [2019-05-23 09:55:39,771 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:39,772 INFO L146 ILogger]: Finished difference Result 199 states and 200 transitions. [2019-05-23 09:55:39,772 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:55:39,772 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 194 [2019-05-23 09:55:39,772 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:39,773 INFO L146 ILogger]: With dead ends: 199 [2019-05-23 09:55:39,773 INFO L146 ILogger]: Without dead ends: 199 [2019-05-23 09:55:39,774 INFO L146 ILogger]: 0 DeclaredPredicates, 194 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=250, Invalid=9850, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:55:39,774 INFO L146 ILogger]: Start minimizeSevpa. Operand 199 states. [2019-05-23 09:55:39,777 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-05-23 09:55:39,777 INFO L146 ILogger]: Start removeUnreachable. Operand 198 states. [2019-05-23 09:55:39,777 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-05-23 09:55:39,777 INFO L146 ILogger]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 194 [2019-05-23 09:55:39,777 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:39,778 INFO L146 ILogger]: Abstraction has 198 states and 199 transitions. [2019-05-23 09:55:39,778 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:55:39,778 INFO L146 ILogger]: Start isEmpty. Operand 198 states and 199 transitions. [2019-05-23 09:55:39,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 198 [2019-05-23 09:55:39,779 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:39,779 INFO L146 ILogger]: trace histogram [49, 48, 48, 48, 1, 1, 1, 1] [2019-05-23 09:55:39,779 INFO L146 ILogger]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:39,779 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:39,779 INFO L146 ILogger]: Analyzing trace with hash -450581682, now seen corresponding path program 95 times [2019-05-23 09:55:39,780 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:39,844 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:39,855 INFO L146 ILogger]: Trace formula consists of 493 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:55:39,857 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:42,695 INFO L146 ILogger]: Checked inductivity of 4656 backedges. 3480 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:42,695 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:42,695 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:55:42,696 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:55:42,696 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:55:42,696 INFO L146 ILogger]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:55:42,697 INFO L146 ILogger]: Start difference. First operand 198 states and 199 transitions. Second operand 100 states. [2019-05-23 09:55:45,481 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:45,481 INFO L146 ILogger]: Finished difference Result 344 states and 345 transitions. [2019-05-23 09:55:45,481 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:55:45,482 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 197 [2019-05-23 09:55:45,482 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:45,494 INFO L146 ILogger]: With dead ends: 344 [2019-05-23 09:55:45,494 INFO L146 ILogger]: Without dead ends: 199 [2019-05-23 09:55:45,495 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:55:45,495 INFO L146 ILogger]: Start minimizeSevpa. Operand 199 states. [2019-05-23 09:55:45,496 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-05-23 09:55:45,496 INFO L146 ILogger]: Start removeUnreachable. Operand 199 states. [2019-05-23 09:55:45,496 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-05-23 09:55:45,496 INFO L146 ILogger]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 197 [2019-05-23 09:55:45,496 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:45,496 INFO L146 ILogger]: Abstraction has 199 states and 200 transitions. [2019-05-23 09:55:45,497 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:55:45,497 INFO L146 ILogger]: Start isEmpty. Operand 199 states and 200 transitions. [2019-05-23 09:55:45,497 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 199 [2019-05-23 09:55:45,497 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:45,497 INFO L146 ILogger]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2019-05-23 09:55:45,497 INFO L146 ILogger]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:45,498 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:45,498 INFO L146 ILogger]: Analyzing trace with hash 1340954376, now seen corresponding path program 96 times [2019-05-23 09:55:45,498 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:45,555 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:45,565 INFO L146 ILogger]: Trace formula consists of 497 conjuncts, 201 conjunts are in the unsatisfiable core [2019-05-23 09:55:45,567 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:50,071 INFO L146 ILogger]: Checked inductivity of 4705 backedges. 0 proven. 4705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:50,071 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:50,071 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:55:50,072 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:55:50,072 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:55:50,072 INFO L146 ILogger]: CoverageRelationStatistics Valid=250, Invalid=10052, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:55:50,072 INFO L146 ILogger]: Start difference. First operand 199 states and 200 transitions. Second operand 102 states. [2019-05-23 09:55:58,812 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:58,812 INFO L146 ILogger]: Finished difference Result 203 states and 204 transitions. [2019-05-23 09:55:58,813 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:55:58,813 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 198 [2019-05-23 09:55:58,813 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:58,814 INFO L146 ILogger]: With dead ends: 203 [2019-05-23 09:55:58,814 INFO L146 ILogger]: Without dead ends: 203 [2019-05-23 09:55:58,815 INFO L146 ILogger]: 0 DeclaredPredicates, 198 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=255, Invalid=10251, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:55:58,815 INFO L146 ILogger]: Start minimizeSevpa. Operand 203 states. [2019-05-23 09:55:58,817 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-05-23 09:55:58,817 INFO L146 ILogger]: Start removeUnreachable. Operand 202 states. [2019-05-23 09:55:58,817 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-05-23 09:55:58,817 INFO L146 ILogger]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 198 [2019-05-23 09:55:58,817 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:58,818 INFO L146 ILogger]: Abstraction has 202 states and 203 transitions. [2019-05-23 09:55:58,818 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:55:58,818 INFO L146 ILogger]: Start isEmpty. Operand 202 states and 203 transitions. [2019-05-23 09:55:58,818 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 202 [2019-05-23 09:55:58,818 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:58,818 INFO L146 ILogger]: trace histogram [50, 49, 49, 49, 1, 1, 1, 1] [2019-05-23 09:55:58,819 INFO L146 ILogger]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:58,819 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:58,819 INFO L146 ILogger]: Analyzing trace with hash 882024135, now seen corresponding path program 97 times [2019-05-23 09:55:58,819 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:58,860 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:58,871 INFO L146 ILogger]: Trace formula consists of 503 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:55:58,873 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:01,793 INFO L146 ILogger]: Checked inductivity of 4851 backedges. 3626 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:01,793 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:01,793 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:56:01,793 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:56:01,794 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:56:01,794 INFO L146 ILogger]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:56:01,794 INFO L146 ILogger]: Start difference. First operand 202 states and 203 transitions. Second operand 102 states. [2019-05-23 09:56:06,611 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:06,611 INFO L146 ILogger]: Finished difference Result 351 states and 352 transitions. [2019-05-23 09:56:06,611 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:56:06,611 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 201 [2019-05-23 09:56:06,612 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:06,613 INFO L146 ILogger]: With dead ends: 351 [2019-05-23 09:56:06,613 INFO L146 ILogger]: Without dead ends: 203 [2019-05-23 09:56:06,614 INFO L146 ILogger]: 0 DeclaredPredicates, 250 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 09:56:06,614 INFO L146 ILogger]: Start minimizeSevpa. Operand 203 states. [2019-05-23 09:56:06,615 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-05-23 09:56:06,616 INFO L146 ILogger]: Start removeUnreachable. Operand 203 states. [2019-05-23 09:56:06,616 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-05-23 09:56:06,616 INFO L146 ILogger]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 201 [2019-05-23 09:56:06,616 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:06,616 INFO L146 ILogger]: Abstraction has 203 states and 204 transitions. [2019-05-23 09:56:06,616 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:56:06,616 INFO L146 ILogger]: Start isEmpty. Operand 203 states and 204 transitions. [2019-05-23 09:56:06,617 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 203 [2019-05-23 09:56:06,617 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:06,617 INFO L146 ILogger]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2019-05-23 09:56:06,617 INFO L146 ILogger]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:06,617 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:06,617 INFO L146 ILogger]: Analyzing trace with hash 1867177345, now seen corresponding path program 98 times [2019-05-23 09:56:06,618 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:06,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:06,688 INFO L146 ILogger]: Trace formula consists of 507 conjuncts, 205 conjunts are in the unsatisfiable core [2019-05-23 09:56:06,690 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:11,445 INFO L146 ILogger]: Checked inductivity of 4901 backedges. 0 proven. 4901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:11,445 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:11,445 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:56:11,446 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 09:56:11,446 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 09:56:11,447 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=10457, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:56:11,447 INFO L146 ILogger]: Start difference. First operand 203 states and 204 transitions. Second operand 104 states. [2019-05-23 09:56:21,645 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:21,646 INFO L146 ILogger]: Finished difference Result 207 states and 208 transitions. [2019-05-23 09:56:21,646 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 09:56:21,646 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 202 [2019-05-23 09:56:21,646 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:21,647 INFO L146 ILogger]: With dead ends: 207 [2019-05-23 09:56:21,647 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 09:56:21,648 INFO L146 ILogger]: 0 DeclaredPredicates, 202 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=260, Invalid=10660, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:56:21,648 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 09:56:21,650 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-05-23 09:56:21,650 INFO L146 ILogger]: Start removeUnreachable. Operand 206 states. [2019-05-23 09:56:21,651 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-05-23 09:56:21,651 INFO L146 ILogger]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 202 [2019-05-23 09:56:21,651 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:21,651 INFO L146 ILogger]: Abstraction has 206 states and 207 transitions. [2019-05-23 09:56:21,651 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 09:56:21,651 INFO L146 ILogger]: Start isEmpty. Operand 206 states and 207 transitions. [2019-05-23 09:56:21,652 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 206 [2019-05-23 09:56:21,652 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:21,652 INFO L146 ILogger]: trace histogram [51, 50, 50, 50, 1, 1, 1, 1] [2019-05-23 09:56:21,652 INFO L146 ILogger]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:21,652 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:21,652 INFO L146 ILogger]: Analyzing trace with hash 959863214, now seen corresponding path program 99 times [2019-05-23 09:56:21,653 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:21,696 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:21,708 INFO L146 ILogger]: Trace formula consists of 513 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:56:21,711 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:24,825 INFO L146 ILogger]: Checked inductivity of 5050 backedges. 3775 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:24,825 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:24,825 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:56:24,825 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 09:56:24,826 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 09:56:24,826 INFO L146 ILogger]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:56:24,826 INFO L146 ILogger]: Start difference. First operand 206 states and 207 transitions. Second operand 104 states. [2019-05-23 09:56:28,601 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:28,602 INFO L146 ILogger]: Finished difference Result 358 states and 359 transitions. [2019-05-23 09:56:28,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 09:56:28,602 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 205 [2019-05-23 09:56:28,603 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:28,603 INFO L146 ILogger]: With dead ends: 358 [2019-05-23 09:56:28,604 INFO L146 ILogger]: Without dead ends: 207 [2019-05-23 09:56:28,605 INFO L146 ILogger]: 0 DeclaredPredicates, 255 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:56:28,605 INFO L146 ILogger]: Start minimizeSevpa. Operand 207 states. [2019-05-23 09:56:28,607 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-05-23 09:56:28,607 INFO L146 ILogger]: Start removeUnreachable. Operand 207 states. [2019-05-23 09:56:28,608 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-05-23 09:56:28,608 INFO L146 ILogger]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 205 [2019-05-23 09:56:28,608 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:28,608 INFO L146 ILogger]: Abstraction has 207 states and 208 transitions. [2019-05-23 09:56:28,608 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 09:56:28,608 INFO L146 ILogger]: Start isEmpty. Operand 207 states and 208 transitions. [2019-05-23 09:56:28,609 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 207 [2019-05-23 09:56:28,609 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:28,609 INFO L146 ILogger]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2019-05-23 09:56:28,609 INFO L146 ILogger]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:28,610 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:28,610 INFO L146 ILogger]: Analyzing trace with hash -874730648, now seen corresponding path program 100 times [2019-05-23 09:56:28,610 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:28,675 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:28,686 INFO L146 ILogger]: Trace formula consists of 517 conjuncts, 209 conjunts are in the unsatisfiable core [2019-05-23 09:56:28,690 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:33,633 INFO L146 ILogger]: Checked inductivity of 5101 backedges. 0 proven. 5101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:33,633 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:33,633 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:56:33,633 INFO L146 ILogger]: Interpolant automaton has 106 states [2019-05-23 09:56:33,634 INFO L146 ILogger]: Constructing interpolant automaton starting with 106 interpolants. [2019-05-23 09:56:33,634 INFO L146 ILogger]: CoverageRelationStatistics Valid=260, Invalid=10870, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:56:33,634 INFO L146 ILogger]: Start difference. First operand 207 states and 208 transitions. Second operand 106 states. [2019-05-23 09:56:43,844 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:43,844 INFO L146 ILogger]: Finished difference Result 211 states and 212 transitions. [2019-05-23 09:56:43,844 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 09:56:43,845 INFO L146 ILogger]: Start accepts. Automaton has 106 states. Word has length 206 [2019-05-23 09:56:43,845 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:43,846 INFO L146 ILogger]: With dead ends: 211 [2019-05-23 09:56:43,846 INFO L146 ILogger]: Without dead ends: 211 [2019-05-23 09:56:43,847 INFO L146 ILogger]: 0 DeclaredPredicates, 206 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=265, Invalid=11077, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:56:43,847 INFO L146 ILogger]: Start minimizeSevpa. Operand 211 states. [2019-05-23 09:56:43,849 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-05-23 09:56:43,849 INFO L146 ILogger]: Start removeUnreachable. Operand 210 states. [2019-05-23 09:56:43,849 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-05-23 09:56:43,850 INFO L146 ILogger]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 206 [2019-05-23 09:56:43,850 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:43,850 INFO L146 ILogger]: Abstraction has 210 states and 211 transitions. [2019-05-23 09:56:43,850 INFO L146 ILogger]: Interpolant automaton has 106 states. [2019-05-23 09:56:43,850 INFO L146 ILogger]: Start isEmpty. Operand 210 states and 211 transitions. [2019-05-23 09:56:43,851 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 210 [2019-05-23 09:56:43,851 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:43,851 INFO L146 ILogger]: trace histogram [52, 51, 51, 51, 1, 1, 1, 1] [2019-05-23 09:56:43,851 INFO L146 ILogger]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:43,851 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:43,852 INFO L146 ILogger]: Analyzing trace with hash -1533120921, now seen corresponding path program 101 times [2019-05-23 09:56:43,852 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:43,893 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:43,905 INFO L146 ILogger]: Trace formula consists of 523 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:56:43,906 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:47,058 INFO L146 ILogger]: Checked inductivity of 5253 backedges. 3927 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:47,058 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:47,058 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:56:47,058 INFO L146 ILogger]: Interpolant automaton has 106 states [2019-05-23 09:56:47,059 INFO L146 ILogger]: Constructing interpolant automaton starting with 106 interpolants. [2019-05-23 09:56:47,059 INFO L146 ILogger]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:56:47,059 INFO L146 ILogger]: Start difference. First operand 210 states and 211 transitions. Second operand 106 states. [2019-05-23 09:56:50,469 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:50,469 INFO L146 ILogger]: Finished difference Result 365 states and 366 transitions. [2019-05-23 09:56:50,470 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 09:56:50,470 INFO L146 ILogger]: Start accepts. Automaton has 106 states. Word has length 209 [2019-05-23 09:56:50,470 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:50,471 INFO L146 ILogger]: With dead ends: 365 [2019-05-23 09:56:50,472 INFO L146 ILogger]: Without dead ends: 211 [2019-05-23 09:56:50,473 INFO L146 ILogger]: 0 DeclaredPredicates, 260 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 09:56:50,474 INFO L146 ILogger]: Start minimizeSevpa. Operand 211 states. [2019-05-23 09:56:50,475 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-05-23 09:56:50,475 INFO L146 ILogger]: Start removeUnreachable. Operand 211 states. [2019-05-23 09:56:50,475 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-05-23 09:56:50,475 INFO L146 ILogger]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 209 [2019-05-23 09:56:50,476 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:50,476 INFO L146 ILogger]: Abstraction has 211 states and 212 transitions. [2019-05-23 09:56:50,476 INFO L146 ILogger]: Interpolant automaton has 106 states. [2019-05-23 09:56:50,476 INFO L146 ILogger]: Start isEmpty. Operand 211 states and 212 transitions. [2019-05-23 09:56:50,477 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 211 [2019-05-23 09:56:50,477 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:50,477 INFO L146 ILogger]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2019-05-23 09:56:50,477 INFO L146 ILogger]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:50,477 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:50,478 INFO L146 ILogger]: Analyzing trace with hash -202288351, now seen corresponding path program 102 times [2019-05-23 09:56:50,478 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:50,527 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:50,539 INFO L146 ILogger]: Trace formula consists of 527 conjuncts, 213 conjunts are in the unsatisfiable core [2019-05-23 09:56:50,543 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:55,743 INFO L146 ILogger]: Checked inductivity of 5305 backedges. 0 proven. 5305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:55,743 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:55,744 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:56:55,744 INFO L146 ILogger]: Interpolant automaton has 108 states [2019-05-23 09:56:55,744 INFO L146 ILogger]: Constructing interpolant automaton starting with 108 interpolants. [2019-05-23 09:56:55,745 INFO L146 ILogger]: CoverageRelationStatistics Valid=265, Invalid=11291, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:56:55,745 INFO L146 ILogger]: Start difference. First operand 211 states and 212 transitions. Second operand 108 states. [2019-05-23 09:57:06,295 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:06,295 INFO L146 ILogger]: Finished difference Result 215 states and 216 transitions. [2019-05-23 09:57:06,296 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:57:06,296 INFO L146 ILogger]: Start accepts. Automaton has 108 states. Word has length 210 [2019-05-23 09:57:06,296 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:06,297 INFO L146 ILogger]: With dead ends: 215 [2019-05-23 09:57:06,297 INFO L146 ILogger]: Without dead ends: 215 [2019-05-23 09:57:06,298 INFO L146 ILogger]: 0 DeclaredPredicates, 210 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=270, Invalid=11502, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:57:06,298 INFO L146 ILogger]: Start minimizeSevpa. Operand 215 states. [2019-05-23 09:57:06,300 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-05-23 09:57:06,301 INFO L146 ILogger]: Start removeUnreachable. Operand 214 states. [2019-05-23 09:57:06,301 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2019-05-23 09:57:06,301 INFO L146 ILogger]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 210 [2019-05-23 09:57:06,301 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:06,301 INFO L146 ILogger]: Abstraction has 214 states and 215 transitions. [2019-05-23 09:57:06,301 INFO L146 ILogger]: Interpolant automaton has 108 states. [2019-05-23 09:57:06,301 INFO L146 ILogger]: Start isEmpty. Operand 214 states and 215 transitions. [2019-05-23 09:57:06,302 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 214 [2019-05-23 09:57:06,302 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:06,303 INFO L146 ILogger]: trace histogram [53, 52, 52, 52, 1, 1, 1, 1] [2019-05-23 09:57:06,303 INFO L146 ILogger]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:06,303 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:06,303 INFO L146 ILogger]: Analyzing trace with hash -532119538, now seen corresponding path program 103 times [2019-05-23 09:57:06,304 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:06,359 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:06,372 INFO L146 ILogger]: Trace formula consists of 533 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:57:06,374 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:09,663 INFO L146 ILogger]: Checked inductivity of 5460 backedges. 4082 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:09,663 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:09,663 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:57:09,663 INFO L146 ILogger]: Interpolant automaton has 108 states [2019-05-23 09:57:09,664 INFO L146 ILogger]: Constructing interpolant automaton starting with 108 interpolants. [2019-05-23 09:57:09,664 INFO L146 ILogger]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:57:09,664 INFO L146 ILogger]: Start difference. First operand 214 states and 215 transitions. Second operand 108 states. [2019-05-23 09:57:13,449 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:13,449 INFO L146 ILogger]: Finished difference Result 372 states and 373 transitions. [2019-05-23 09:57:13,449 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:57:13,449 INFO L146 ILogger]: Start accepts. Automaton has 108 states. Word has length 213 [2019-05-23 09:57:13,450 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:13,450 INFO L146 ILogger]: With dead ends: 372 [2019-05-23 09:57:13,450 INFO L146 ILogger]: Without dead ends: 215 [2019-05-23 09:57:13,452 INFO L146 ILogger]: 0 DeclaredPredicates, 265 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:57:13,452 INFO L146 ILogger]: Start minimizeSevpa. Operand 215 states. [2019-05-23 09:57:13,454 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-05-23 09:57:13,454 INFO L146 ILogger]: Start removeUnreachable. Operand 215 states. [2019-05-23 09:57:13,455 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-05-23 09:57:13,455 INFO L146 ILogger]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 213 [2019-05-23 09:57:13,455 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:13,455 INFO L146 ILogger]: Abstraction has 215 states and 216 transitions. [2019-05-23 09:57:13,455 INFO L146 ILogger]: Interpolant automaton has 108 states. [2019-05-23 09:57:13,455 INFO L146 ILogger]: Start isEmpty. Operand 215 states and 216 transitions. [2019-05-23 09:57:13,456 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 215 [2019-05-23 09:57:13,456 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:13,456 INFO L146 ILogger]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2019-05-23 09:57:13,456 INFO L146 ILogger]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:13,457 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:13,457 INFO L146 ILogger]: Analyzing trace with hash -842631224, now seen corresponding path program 104 times [2019-05-23 09:57:13,457 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:13,520 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:13,529 INFO L146 ILogger]: Trace formula consists of 537 conjuncts, 217 conjunts are in the unsatisfiable core [2019-05-23 09:57:13,530 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:18,740 INFO L146 ILogger]: Checked inductivity of 5513 backedges. 0 proven. 5513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:18,741 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:18,741 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:57:18,741 INFO L146 ILogger]: Interpolant automaton has 110 states [2019-05-23 09:57:18,741 INFO L146 ILogger]: Constructing interpolant automaton starting with 110 interpolants. [2019-05-23 09:57:18,742 INFO L146 ILogger]: CoverageRelationStatistics Valid=270, Invalid=11720, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:57:18,742 INFO L146 ILogger]: Start difference. First operand 215 states and 216 transitions. Second operand 110 states. [2019-05-23 09:57:30,026 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:30,026 INFO L146 ILogger]: Finished difference Result 219 states and 220 transitions. [2019-05-23 09:57:30,027 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-05-23 09:57:30,027 INFO L146 ILogger]: Start accepts. Automaton has 110 states. Word has length 214 [2019-05-23 09:57:30,027 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:30,028 INFO L146 ILogger]: With dead ends: 219 [2019-05-23 09:57:30,028 INFO L146 ILogger]: Without dead ends: 219 [2019-05-23 09:57:30,029 INFO L146 ILogger]: 0 DeclaredPredicates, 214 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=275, Invalid=11935, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:57:30,029 INFO L146 ILogger]: Start minimizeSevpa. Operand 219 states. [2019-05-23 09:57:30,031 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-05-23 09:57:30,031 INFO L146 ILogger]: Start removeUnreachable. Operand 218 states. [2019-05-23 09:57:30,032 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2019-05-23 09:57:30,032 INFO L146 ILogger]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 214 [2019-05-23 09:57:30,032 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:30,032 INFO L146 ILogger]: Abstraction has 218 states and 219 transitions. [2019-05-23 09:57:30,032 INFO L146 ILogger]: Interpolant automaton has 110 states. [2019-05-23 09:57:30,032 INFO L146 ILogger]: Start isEmpty. Operand 218 states and 219 transitions. [2019-05-23 09:57:30,033 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 218 [2019-05-23 09:57:30,033 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:30,033 INFO L146 ILogger]: trace histogram [54, 53, 53, 53, 1, 1, 1, 1] [2019-05-23 09:57:30,033 INFO L146 ILogger]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:30,034 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:30,034 INFO L146 ILogger]: Analyzing trace with hash 1258079751, now seen corresponding path program 105 times [2019-05-23 09:57:30,034 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:30,081 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:30,094 INFO L146 ILogger]: Trace formula consists of 543 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:57:30,095 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:33,513 INFO L146 ILogger]: Checked inductivity of 5671 backedges. 4240 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:33,514 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:33,514 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:57:33,514 INFO L146 ILogger]: Interpolant automaton has 110 states [2019-05-23 09:57:33,514 INFO L146 ILogger]: Constructing interpolant automaton starting with 110 interpolants. [2019-05-23 09:57:33,515 INFO L146 ILogger]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:57:33,515 INFO L146 ILogger]: Start difference. First operand 218 states and 219 transitions. Second operand 110 states. [2019-05-23 09:57:38,572 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:38,572 INFO L146 ILogger]: Finished difference Result 379 states and 380 transitions. [2019-05-23 09:57:38,572 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-05-23 09:57:38,573 INFO L146 ILogger]: Start accepts. Automaton has 110 states. Word has length 217 [2019-05-23 09:57:38,573 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:38,573 INFO L146 ILogger]: With dead ends: 379 [2019-05-23 09:57:38,574 INFO L146 ILogger]: Without dead ends: 219 [2019-05-23 09:57:38,575 INFO L146 ILogger]: 0 DeclaredPredicates, 270 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 09:57:38,575 INFO L146 ILogger]: Start minimizeSevpa. Operand 219 states. [2019-05-23 09:57:38,576 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-05-23 09:57:38,577 INFO L146 ILogger]: Start removeUnreachable. Operand 219 states. [2019-05-23 09:57:38,577 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2019-05-23 09:57:38,577 INFO L146 ILogger]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 217 [2019-05-23 09:57:38,577 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:38,577 INFO L146 ILogger]: Abstraction has 219 states and 220 transitions. [2019-05-23 09:57:38,578 INFO L146 ILogger]: Interpolant automaton has 110 states. [2019-05-23 09:57:38,578 INFO L146 ILogger]: Start isEmpty. Operand 219 states and 220 transitions. [2019-05-23 09:57:38,578 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 219 [2019-05-23 09:57:38,578 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:38,578 INFO L146 ILogger]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2019-05-23 09:57:38,579 INFO L146 ILogger]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:38,579 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:38,579 INFO L146 ILogger]: Analyzing trace with hash -723234623, now seen corresponding path program 106 times [2019-05-23 09:57:38,579 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:38,628 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:38,640 INFO L146 ILogger]: Trace formula consists of 547 conjuncts, 221 conjunts are in the unsatisfiable core [2019-05-23 09:57:38,643 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:44,033 INFO L146 ILogger]: Checked inductivity of 5725 backedges. 0 proven. 5725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:44,033 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:44,034 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:57:44,034 INFO L146 ILogger]: Interpolant automaton has 112 states [2019-05-23 09:57:44,034 INFO L146 ILogger]: Constructing interpolant automaton starting with 112 interpolants. [2019-05-23 09:57:44,035 INFO L146 ILogger]: CoverageRelationStatistics Valid=275, Invalid=12157, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:57:44,035 INFO L146 ILogger]: Start difference. First operand 219 states and 220 transitions. Second operand 112 states. [2019-05-23 09:57:54,463 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:54,463 INFO L146 ILogger]: Finished difference Result 223 states and 224 transitions. [2019-05-23 09:57:54,464 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 09:57:54,464 INFO L146 ILogger]: Start accepts. Automaton has 112 states. Word has length 218 [2019-05-23 09:57:54,464 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:54,465 INFO L146 ILogger]: With dead ends: 223 [2019-05-23 09:57:54,465 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 09:57:54,466 INFO L146 ILogger]: 0 DeclaredPredicates, 218 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=280, Invalid=12376, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:57:54,466 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 09:57:54,468 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-05-23 09:57:54,468 INFO L146 ILogger]: Start removeUnreachable. Operand 222 states. [2019-05-23 09:57:54,468 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2019-05-23 09:57:54,468 INFO L146 ILogger]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 218 [2019-05-23 09:57:54,469 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:54,469 INFO L146 ILogger]: Abstraction has 222 states and 223 transitions. [2019-05-23 09:57:54,469 INFO L146 ILogger]: Interpolant automaton has 112 states. [2019-05-23 09:57:54,469 INFO L146 ILogger]: Start isEmpty. Operand 222 states and 223 transitions. [2019-05-23 09:57:54,470 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 222 [2019-05-23 09:57:54,470 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:54,470 INFO L146 ILogger]: trace histogram [55, 54, 54, 54, 1, 1, 1, 1] [2019-05-23 09:57:54,470 INFO L146 ILogger]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:54,470 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:54,471 INFO L146 ILogger]: Analyzing trace with hash 1969299054, now seen corresponding path program 107 times [2019-05-23 09:57:54,471 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:54,516 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:54,530 INFO L146 ILogger]: Trace formula consists of 553 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:57:54,531 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:58,050 INFO L146 ILogger]: Checked inductivity of 5886 backedges. 4401 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:58,050 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:58,050 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:57:58,051 INFO L146 ILogger]: Interpolant automaton has 112 states [2019-05-23 09:57:58,051 INFO L146 ILogger]: Constructing interpolant automaton starting with 112 interpolants. [2019-05-23 09:57:58,052 INFO L146 ILogger]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:57:58,052 INFO L146 ILogger]: Start difference. First operand 222 states and 223 transitions. Second operand 112 states. [2019-05-23 09:58:00,881 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:00,881 INFO L146 ILogger]: Finished difference Result 386 states and 387 transitions. [2019-05-23 09:58:00,882 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 09:58:00,882 INFO L146 ILogger]: Start accepts. Automaton has 112 states. Word has length 221 [2019-05-23 09:58:00,882 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:00,883 INFO L146 ILogger]: With dead ends: 386 [2019-05-23 09:58:00,883 INFO L146 ILogger]: Without dead ends: 223 [2019-05-23 09:58:00,885 INFO L146 ILogger]: 0 DeclaredPredicates, 275 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:58:00,885 INFO L146 ILogger]: Start minimizeSevpa. Operand 223 states. [2019-05-23 09:58:00,886 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-05-23 09:58:00,887 INFO L146 ILogger]: Start removeUnreachable. Operand 223 states. [2019-05-23 09:58:00,887 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-05-23 09:58:00,887 INFO L146 ILogger]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 221 [2019-05-23 09:58:00,887 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:00,887 INFO L146 ILogger]: Abstraction has 223 states and 224 transitions. [2019-05-23 09:58:00,887 INFO L146 ILogger]: Interpolant automaton has 112 states. [2019-05-23 09:58:00,887 INFO L146 ILogger]: Start isEmpty. Operand 223 states and 224 transitions. [2019-05-23 09:58:00,888 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 223 [2019-05-23 09:58:00,888 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:00,888 INFO L146 ILogger]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2019-05-23 09:58:00,888 INFO L146 ILogger]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:00,888 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:00,889 INFO L146 ILogger]: Analyzing trace with hash 1454423080, now seen corresponding path program 108 times [2019-05-23 09:58:00,889 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:00,942 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:00,949 INFO L146 ILogger]: Trace formula consists of 557 conjuncts, 225 conjunts are in the unsatisfiable core [2019-05-23 09:58:00,952 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:06,554 INFO L146 ILogger]: Checked inductivity of 5941 backedges. 0 proven. 5941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:06,555 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:06,555 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:58:06,555 INFO L146 ILogger]: Interpolant automaton has 114 states [2019-05-23 09:58:06,555 INFO L146 ILogger]: Constructing interpolant automaton starting with 114 interpolants. [2019-05-23 09:58:06,556 INFO L146 ILogger]: CoverageRelationStatistics Valid=280, Invalid=12602, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:58:06,556 INFO L146 ILogger]: Start difference. First operand 223 states and 224 transitions. Second operand 114 states. [2019-05-23 09:58:18,450 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:18,450 INFO L146 ILogger]: Finished difference Result 227 states and 228 transitions. [2019-05-23 09:58:18,451 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:58:18,451 INFO L146 ILogger]: Start accepts. Automaton has 114 states. Word has length 222 [2019-05-23 09:58:18,451 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:18,452 INFO L146 ILogger]: With dead ends: 227 [2019-05-23 09:58:18,452 INFO L146 ILogger]: Without dead ends: 227 [2019-05-23 09:58:18,452 INFO L146 ILogger]: 0 DeclaredPredicates, 222 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=285, Invalid=12825, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:58:18,453 INFO L146 ILogger]: Start minimizeSevpa. Operand 227 states. [2019-05-23 09:58:18,454 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-05-23 09:58:18,454 INFO L146 ILogger]: Start removeUnreachable. Operand 226 states. [2019-05-23 09:58:18,455 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2019-05-23 09:58:18,455 INFO L146 ILogger]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 222 [2019-05-23 09:58:18,455 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:18,455 INFO L146 ILogger]: Abstraction has 226 states and 227 transitions. [2019-05-23 09:58:18,455 INFO L146 ILogger]: Interpolant automaton has 114 states. [2019-05-23 09:58:18,455 INFO L146 ILogger]: Start isEmpty. Operand 226 states and 227 transitions. [2019-05-23 09:58:18,456 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 226 [2019-05-23 09:58:18,456 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:18,456 INFO L146 ILogger]: trace histogram [56, 55, 55, 55, 1, 1, 1, 1] [2019-05-23 09:58:18,457 INFO L146 ILogger]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:18,457 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:18,457 INFO L146 ILogger]: Analyzing trace with hash 1088923047, now seen corresponding path program 109 times [2019-05-23 09:58:18,457 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:18,523 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:18,547 INFO L146 ILogger]: Trace formula consists of 563 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:58:18,550 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:22,246 INFO L146 ILogger]: Checked inductivity of 6105 backedges. 4565 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:22,246 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:22,246 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:58:22,247 INFO L146 ILogger]: Interpolant automaton has 114 states [2019-05-23 09:58:22,247 INFO L146 ILogger]: Constructing interpolant automaton starting with 114 interpolants. [2019-05-23 09:58:22,248 INFO L146 ILogger]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:58:22,248 INFO L146 ILogger]: Start difference. First operand 226 states and 227 transitions. Second operand 114 states. [2019-05-23 09:58:28,111 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:28,112 INFO L146 ILogger]: Finished difference Result 393 states and 394 transitions. [2019-05-23 09:58:28,112 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:58:28,112 INFO L146 ILogger]: Start accepts. Automaton has 114 states. Word has length 225 [2019-05-23 09:58:28,112 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:28,113 INFO L146 ILogger]: With dead ends: 393 [2019-05-23 09:58:28,113 INFO L146 ILogger]: Without dead ends: 227 [2019-05-23 09:58:28,114 INFO L146 ILogger]: 0 DeclaredPredicates, 280 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 09:58:28,115 INFO L146 ILogger]: Start minimizeSevpa. Operand 227 states. [2019-05-23 09:58:28,116 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-05-23 09:58:28,117 INFO L146 ILogger]: Start removeUnreachable. Operand 227 states. [2019-05-23 09:58:28,117 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2019-05-23 09:58:28,117 INFO L146 ILogger]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 225 [2019-05-23 09:58:28,117 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:28,117 INFO L146 ILogger]: Abstraction has 227 states and 228 transitions. [2019-05-23 09:58:28,118 INFO L146 ILogger]: Interpolant automaton has 114 states. [2019-05-23 09:58:28,118 INFO L146 ILogger]: Start isEmpty. Operand 227 states and 228 transitions. [2019-05-23 09:58:28,118 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 227 [2019-05-23 09:58:28,118 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:28,118 INFO L146 ILogger]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2019-05-23 09:58:28,119 INFO L146 ILogger]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:28,119 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:28,119 INFO L146 ILogger]: Analyzing trace with hash -1856121247, now seen corresponding path program 110 times [2019-05-23 09:58:28,119 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:28,173 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:28,183 INFO L146 ILogger]: Trace formula consists of 567 conjuncts, 229 conjunts are in the unsatisfiable core [2019-05-23 09:58:28,185 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:33,993 INFO L146 ILogger]: Checked inductivity of 6161 backedges. 0 proven. 6161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:33,993 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:33,993 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:58:33,994 INFO L146 ILogger]: Interpolant automaton has 116 states [2019-05-23 09:58:33,994 INFO L146 ILogger]: Constructing interpolant automaton starting with 116 interpolants. [2019-05-23 09:58:33,994 INFO L146 ILogger]: CoverageRelationStatistics Valid=285, Invalid=13055, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:58:33,994 INFO L146 ILogger]: Start difference. First operand 227 states and 228 transitions. Second operand 116 states. [2019-05-23 09:58:45,776 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:45,776 INFO L146 ILogger]: Finished difference Result 231 states and 232 transitions. [2019-05-23 09:58:45,777 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-05-23 09:58:45,777 INFO L146 ILogger]: Start accepts. Automaton has 116 states. Word has length 226 [2019-05-23 09:58:45,777 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:45,777 INFO L146 ILogger]: With dead ends: 231 [2019-05-23 09:58:45,778 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:58:45,778 INFO L146 ILogger]: 0 DeclaredPredicates, 226 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=290, Invalid=13282, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:58:45,779 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:58:45,780 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 230. [2019-05-23 09:58:45,780 INFO L146 ILogger]: Start removeUnreachable. Operand 230 states. [2019-05-23 09:58:45,781 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2019-05-23 09:58:45,781 INFO L146 ILogger]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 226 [2019-05-23 09:58:45,781 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:45,781 INFO L146 ILogger]: Abstraction has 230 states and 231 transitions. [2019-05-23 09:58:45,781 INFO L146 ILogger]: Interpolant automaton has 116 states. [2019-05-23 09:58:45,781 INFO L146 ILogger]: Start isEmpty. Operand 230 states and 231 transitions. [2019-05-23 09:58:45,782 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 230 [2019-05-23 09:58:45,782 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:45,782 INFO L146 ILogger]: trace histogram [57, 56, 56, 56, 1, 1, 1, 1] [2019-05-23 09:58:45,782 INFO L146 ILogger]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:45,782 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:45,782 INFO L146 ILogger]: Analyzing trace with hash 1996895438, now seen corresponding path program 111 times [2019-05-23 09:58:45,782 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:45,829 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:45,843 INFO L146 ILogger]: Trace formula consists of 573 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:58:45,844 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:49,608 INFO L146 ILogger]: Checked inductivity of 6328 backedges. 4732 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:49,608 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:49,608 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:58:49,609 INFO L146 ILogger]: Interpolant automaton has 116 states [2019-05-23 09:58:49,609 INFO L146 ILogger]: Constructing interpolant automaton starting with 116 interpolants. [2019-05-23 09:58:49,610 INFO L146 ILogger]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:58:49,610 INFO L146 ILogger]: Start difference. First operand 230 states and 231 transitions. Second operand 116 states. [2019-05-23 09:58:55,067 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:55,068 INFO L146 ILogger]: Finished difference Result 400 states and 401 transitions. [2019-05-23 09:58:55,068 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-05-23 09:58:55,068 INFO L146 ILogger]: Start accepts. Automaton has 116 states. Word has length 229 [2019-05-23 09:58:55,069 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:55,069 INFO L146 ILogger]: With dead ends: 400 [2019-05-23 09:58:55,069 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:58:55,071 INFO L146 ILogger]: 0 DeclaredPredicates, 285 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:58:55,071 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:58:55,073 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-05-23 09:58:55,073 INFO L146 ILogger]: Start removeUnreachable. Operand 231 states. [2019-05-23 09:58:55,073 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-05-23 09:58:55,074 INFO L146 ILogger]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 229 [2019-05-23 09:58:55,074 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:55,074 INFO L146 ILogger]: Abstraction has 231 states and 232 transitions. [2019-05-23 09:58:55,074 INFO L146 ILogger]: Interpolant automaton has 116 states. [2019-05-23 09:58:55,074 INFO L146 ILogger]: Start isEmpty. Operand 231 states and 232 transitions. [2019-05-23 09:58:55,074 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 231 [2019-05-23 09:58:55,074 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:55,075 INFO L146 ILogger]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2019-05-23 09:58:55,075 INFO L146 ILogger]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:55,075 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:55,075 INFO L146 ILogger]: Analyzing trace with hash 1260484744, now seen corresponding path program 112 times [2019-05-23 09:58:55,075 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:55,132 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:55,145 INFO L146 ILogger]: Trace formula consists of 577 conjuncts, 233 conjunts are in the unsatisfiable core [2019-05-23 09:58:55,147 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:01,179 INFO L146 ILogger]: Checked inductivity of 6385 backedges. 0 proven. 6385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:01,180 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:01,180 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:59:01,180 INFO L146 ILogger]: Interpolant automaton has 118 states [2019-05-23 09:59:01,180 INFO L146 ILogger]: Constructing interpolant automaton starting with 118 interpolants. [2019-05-23 09:59:01,181 INFO L146 ILogger]: CoverageRelationStatistics Valid=290, Invalid=13516, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:59:01,181 INFO L146 ILogger]: Start difference. First operand 231 states and 232 transitions. Second operand 118 states. [2019-05-23 09:59:13,220 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:13,221 INFO L146 ILogger]: Finished difference Result 235 states and 236 transitions. [2019-05-23 09:59:13,221 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 09:59:13,221 INFO L146 ILogger]: Start accepts. Automaton has 118 states. Word has length 230 [2019-05-23 09:59:13,222 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:13,222 INFO L146 ILogger]: With dead ends: 235 [2019-05-23 09:59:13,222 INFO L146 ILogger]: Without dead ends: 235 [2019-05-23 09:59:13,223 INFO L146 ILogger]: 0 DeclaredPredicates, 230 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=295, Invalid=13747, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:59:13,223 INFO L146 ILogger]: Start minimizeSevpa. Operand 235 states. [2019-05-23 09:59:13,225 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-05-23 09:59:13,225 INFO L146 ILogger]: Start removeUnreachable. Operand 234 states. [2019-05-23 09:59:13,225 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2019-05-23 09:59:13,225 INFO L146 ILogger]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 230 [2019-05-23 09:59:13,226 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:13,226 INFO L146 ILogger]: Abstraction has 234 states and 235 transitions. [2019-05-23 09:59:13,226 INFO L146 ILogger]: Interpolant automaton has 118 states. [2019-05-23 09:59:13,226 INFO L146 ILogger]: Start isEmpty. Operand 234 states and 235 transitions. [2019-05-23 09:59:13,227 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 234 [2019-05-23 09:59:13,227 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:13,227 INFO L146 ILogger]: trace histogram [58, 57, 57, 57, 1, 1, 1, 1] [2019-05-23 09:59:13,227 INFO L146 ILogger]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:13,227 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:13,227 INFO L146 ILogger]: Analyzing trace with hash 202968391, now seen corresponding path program 113 times [2019-05-23 09:59:13,228 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:13,274 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:13,292 INFO L146 ILogger]: Trace formula consists of 583 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:59:13,293 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:17,282 INFO L146 ILogger]: Checked inductivity of 6555 backedges. 4902 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:17,283 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:17,283 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:59:17,283 INFO L146 ILogger]: Interpolant automaton has 118 states [2019-05-23 09:59:17,283 INFO L146 ILogger]: Constructing interpolant automaton starting with 118 interpolants. [2019-05-23 09:59:17,284 INFO L146 ILogger]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:59:17,284 INFO L146 ILogger]: Start difference. First operand 234 states and 235 transitions. Second operand 118 states. [2019-05-23 09:59:22,993 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:22,993 INFO L146 ILogger]: Finished difference Result 407 states and 408 transitions. [2019-05-23 09:59:22,994 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 09:59:22,994 INFO L146 ILogger]: Start accepts. Automaton has 118 states. Word has length 233 [2019-05-23 09:59:22,994 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:22,995 INFO L146 ILogger]: With dead ends: 407 [2019-05-23 09:59:22,995 INFO L146 ILogger]: Without dead ends: 235 [2019-05-23 09:59:22,996 INFO L146 ILogger]: 0 DeclaredPredicates, 290 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2019-05-23 09:59:22,996 INFO L146 ILogger]: Start minimizeSevpa. Operand 235 states. [2019-05-23 09:59:22,998 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-05-23 09:59:22,998 INFO L146 ILogger]: Start removeUnreachable. Operand 235 states. [2019-05-23 09:59:22,998 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2019-05-23 09:59:22,998 INFO L146 ILogger]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 233 [2019-05-23 09:59:22,998 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:22,999 INFO L146 ILogger]: Abstraction has 235 states and 236 transitions. [2019-05-23 09:59:22,999 INFO L146 ILogger]: Interpolant automaton has 118 states. [2019-05-23 09:59:22,999 INFO L146 ILogger]: Start isEmpty. Operand 235 states and 236 transitions. [2019-05-23 09:59:22,999 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 235 [2019-05-23 09:59:22,999 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:22,999 INFO L146 ILogger]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2019-05-23 09:59:22,999 INFO L146 ILogger]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:23,000 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:23,000 INFO L146 ILogger]: Analyzing trace with hash 353887233, now seen corresponding path program 114 times [2019-05-23 09:59:23,000 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:23,055 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:23,064 INFO L146 ILogger]: Trace formula consists of 587 conjuncts, 237 conjunts are in the unsatisfiable core [2019-05-23 09:59:23,066 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:29,252 INFO L146 ILogger]: Checked inductivity of 6613 backedges. 0 proven. 6613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:29,252 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:29,252 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:59:29,252 INFO L146 ILogger]: Interpolant automaton has 120 states [2019-05-23 09:59:29,253 INFO L146 ILogger]: Constructing interpolant automaton starting with 120 interpolants. [2019-05-23 09:59:29,253 INFO L146 ILogger]: CoverageRelationStatistics Valid=295, Invalid=13985, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:59:29,253 INFO L146 ILogger]: Start difference. First operand 235 states and 236 transitions. Second operand 120 states. [2019-05-23 09:59:41,997 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:41,997 INFO L146 ILogger]: Finished difference Result 239 states and 240 transitions. [2019-05-23 09:59:41,997 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:59:41,997 INFO L146 ILogger]: Start accepts. Automaton has 120 states. Word has length 234 [2019-05-23 09:59:41,998 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:41,998 INFO L146 ILogger]: With dead ends: 239 [2019-05-23 09:59:41,998 INFO L146 ILogger]: Without dead ends: 239 [2019-05-23 09:59:41,999 INFO L146 ILogger]: 0 DeclaredPredicates, 234 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=300, Invalid=14220, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:59:41,999 INFO L146 ILogger]: Start minimizeSevpa. Operand 239 states. [2019-05-23 09:59:42,001 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-05-23 09:59:42,001 INFO L146 ILogger]: Start removeUnreachable. Operand 238 states. [2019-05-23 09:59:42,001 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2019-05-23 09:59:42,001 INFO L146 ILogger]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 234 [2019-05-23 09:59:42,002 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:42,002 INFO L146 ILogger]: Abstraction has 238 states and 239 transitions. [2019-05-23 09:59:42,002 INFO L146 ILogger]: Interpolant automaton has 120 states. [2019-05-23 09:59:42,002 INFO L146 ILogger]: Start isEmpty. Operand 238 states and 239 transitions. [2019-05-23 09:59:42,003 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 238 [2019-05-23 09:59:42,003 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:42,003 INFO L146 ILogger]: trace histogram [59, 58, 58, 58, 1, 1, 1, 1] [2019-05-23 09:59:42,003 INFO L146 ILogger]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:42,003 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:42,003 INFO L146 ILogger]: Analyzing trace with hash -1489124562, now seen corresponding path program 115 times [2019-05-23 09:59:42,004 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:42,051 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:42,067 INFO L146 ILogger]: Trace formula consists of 593 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:59:42,068 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:46,108 INFO L146 ILogger]: Checked inductivity of 6786 backedges. 5075 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:46,108 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:46,108 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:59:46,109 INFO L146 ILogger]: Interpolant automaton has 120 states [2019-05-23 09:59:46,109 INFO L146 ILogger]: Constructing interpolant automaton starting with 120 interpolants. [2019-05-23 09:59:46,110 INFO L146 ILogger]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:59:46,110 INFO L146 ILogger]: Start difference. First operand 238 states and 239 transitions. Second operand 120 states. [2019-05-23 09:59:53,006 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:53,006 INFO L146 ILogger]: Finished difference Result 414 states and 415 transitions. [2019-05-23 09:59:53,006 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:59:53,007 INFO L146 ILogger]: Start accepts. Automaton has 120 states. Word has length 237 [2019-05-23 09:59:53,007 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:53,007 INFO L146 ILogger]: With dead ends: 414 [2019-05-23 09:59:53,008 INFO L146 ILogger]: Without dead ends: 239 [2019-05-23 09:59:53,009 INFO L146 ILogger]: 0 DeclaredPredicates, 295 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5075 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:59:53,010 INFO L146 ILogger]: Start minimizeSevpa. Operand 239 states. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Start removeUnreachable. Operand 239 states. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 237 [2019-05-23 09:59:53,011 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Abstraction has 239 states and 240 transitions. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Interpolant automaton has 120 states. [2019-05-23 09:59:53,011 INFO L146 ILogger]: Start isEmpty. Operand 239 states and 240 transitions. [2019-05-23 09:59:53,012 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 239 [2019-05-23 09:59:53,012 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:53,012 INFO L146 ILogger]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2019-05-23 09:59:53,012 INFO L146 ILogger]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:53,012 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:53,012 INFO L146 ILogger]: Analyzing trace with hash -752964376, now seen corresponding path program 116 times [2019-05-23 09:59:53,013 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:53,070 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:53,079 INFO L146 ILogger]: Trace formula consists of 597 conjuncts, 241 conjunts are in the unsatisfiable core [2019-05-23 09:59:53,081 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:59,523 INFO L146 ILogger]: Checked inductivity of 6845 backedges. 0 proven. 6845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:59,523 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:59,523 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:59:59,524 INFO L146 ILogger]: Interpolant automaton has 122 states [2019-05-23 09:59:59,524 INFO L146 ILogger]: Constructing interpolant automaton starting with 122 interpolants. [2019-05-23 09:59:59,524 INFO L146 ILogger]: CoverageRelationStatistics Valid=300, Invalid=14462, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:59:59,524 INFO L146 ILogger]: Start difference. First operand 239 states and 240 transitions. Second operand 122 states. [2019-05-23 10:00:11,388 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:11,388 INFO L146 ILogger]: Finished difference Result 243 states and 244 transitions. [2019-05-23 10:00:11,389 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-05-23 10:00:11,389 INFO L146 ILogger]: Start accepts. Automaton has 122 states. Word has length 238 [2019-05-23 10:00:11,389 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:11,390 INFO L146 ILogger]: With dead ends: 243 [2019-05-23 10:00:11,390 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 10:00:11,391 INFO L146 ILogger]: 0 DeclaredPredicates, 238 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=305, Invalid=14701, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 10:00:11,391 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 10:00:11,392 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-05-23 10:00:11,392 INFO L146 ILogger]: Start removeUnreachable. Operand 242 states. [2019-05-23 10:00:11,393 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-05-23 10:00:11,393 INFO L146 ILogger]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 238 [2019-05-23 10:00:11,393 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:11,393 INFO L146 ILogger]: Abstraction has 242 states and 243 transitions. [2019-05-23 10:00:11,393 INFO L146 ILogger]: Interpolant automaton has 122 states. [2019-05-23 10:00:11,393 INFO L146 ILogger]: Start isEmpty. Operand 242 states and 243 transitions. [2019-05-23 10:00:11,394 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 242 [2019-05-23 10:00:11,394 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:11,394 INFO L146 ILogger]: trace histogram [60, 59, 59, 59, 1, 1, 1, 1] [2019-05-23 10:00:11,394 INFO L146 ILogger]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:11,394 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:11,394 INFO L146 ILogger]: Analyzing trace with hash 1053490407, now seen corresponding path program 117 times [2019-05-23 10:00:11,395 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:11,445 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:11,461 INFO L146 ILogger]: Trace formula consists of 603 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 10:00:11,463 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:15,638 INFO L146 ILogger]: Checked inductivity of 7021 backedges. 5251 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:15,639 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:15,639 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 10:00:15,639 INFO L146 ILogger]: Interpolant automaton has 122 states [2019-05-23 10:00:15,639 INFO L146 ILogger]: Constructing interpolant automaton starting with 122 interpolants. [2019-05-23 10:00:15,640 INFO L146 ILogger]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 10:00:15,640 INFO L146 ILogger]: Start difference. First operand 242 states and 243 transitions. Second operand 122 states. [2019-05-23 10:00:19,823 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:19,823 INFO L146 ILogger]: Finished difference Result 421 states and 422 transitions. [2019-05-23 10:00:19,824 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-05-23 10:00:19,824 INFO L146 ILogger]: Start accepts. Automaton has 122 states. Word has length 241 [2019-05-23 10:00:19,824 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:19,825 INFO L146 ILogger]: With dead ends: 421 [2019-05-23 10:00:19,825 INFO L146 ILogger]: Without dead ends: 243 [2019-05-23 10:00:19,827 INFO L146 ILogger]: 0 DeclaredPredicates, 300 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2019-05-23 10:00:19,827 INFO L146 ILogger]: Start minimizeSevpa. Operand 243 states. [2019-05-23 10:00:19,828 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-05-23 10:00:19,828 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 10:00:19,829 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2019-05-23 10:00:19,829 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 241 [2019-05-23 10:00:19,829 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:19,829 INFO L146 ILogger]: Abstraction has 243 states and 244 transitions. [2019-05-23 10:00:19,829 INFO L146 ILogger]: Interpolant automaton has 122 states. [2019-05-23 10:00:19,829 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 244 transitions. [2019-05-23 10:00:19,830 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 243 [2019-05-23 10:00:19,830 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:19,830 INFO L146 ILogger]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2019-05-23 10:00:19,830 INFO L146 ILogger]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:19,830 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:19,830 INFO L146 ILogger]: Analyzing trace with hash 1481406881, now seen corresponding path program 118 times [2019-05-23 10:00:19,831 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:19,889 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:19,904 INFO L146 ILogger]: Trace formula consists of 607 conjuncts, 245 conjunts are in the unsatisfiable core [2019-05-23 10:00:19,908 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:26,481 INFO L146 ILogger]: Checked inductivity of 7081 backedges. 0 proven. 7081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:26,482 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:26,482 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 10:00:26,482 INFO L146 ILogger]: Interpolant automaton has 124 states [2019-05-23 10:00:26,482 INFO L146 ILogger]: Constructing interpolant automaton starting with 124 interpolants. [2019-05-23 10:00:26,483 INFO L146 ILogger]: CoverageRelationStatistics Valid=305, Invalid=14947, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 10:00:26,483 INFO L146 ILogger]: Start difference. First operand 243 states and 244 transitions. Second operand 124 states. [2019-05-23 10:00:39,714 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:39,715 INFO L146 ILogger]: Finished difference Result 247 states and 248 transitions. [2019-05-23 10:00:39,715 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-05-23 10:00:39,715 INFO L146 ILogger]: Start accepts. Automaton has 124 states. Word has length 242 [2019-05-23 10:00:39,716 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:39,716 INFO L146 ILogger]: With dead ends: 247 [2019-05-23 10:00:39,716 INFO L146 ILogger]: Without dead ends: 247 [2019-05-23 10:00:39,717 INFO L146 ILogger]: 0 DeclaredPredicates, 242 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=310, Invalid=15190, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 10:00:39,718 INFO L146 ILogger]: Start minimizeSevpa. Operand 247 states. [2019-05-23 10:00:39,719 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 247 to 246. [2019-05-23 10:00:39,719 INFO L146 ILogger]: Start removeUnreachable. Operand 246 states. [2019-05-23 10:00:39,720 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2019-05-23 10:00:39,720 INFO L146 ILogger]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 242 [2019-05-23 10:00:39,720 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:39,720 INFO L146 ILogger]: Abstraction has 246 states and 247 transitions. [2019-05-23 10:00:39,720 INFO L146 ILogger]: Interpolant automaton has 124 states. [2019-05-23 10:00:39,720 INFO L146 ILogger]: Start isEmpty. Operand 246 states and 247 transitions. [2019-05-23 10:00:39,721 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 246 [2019-05-23 10:00:39,721 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:39,721 INFO L146 ILogger]: trace histogram [61, 60, 60, 60, 1, 1, 1, 1] [2019-05-23 10:00:39,721 INFO L146 ILogger]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:39,721 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:39,721 INFO L146 ILogger]: Analyzing trace with hash 1804454286, now seen corresponding path program 119 times [2019-05-23 10:00:39,722 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:39,773 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:39,790 INFO L146 ILogger]: Trace formula consists of 613 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 10:00:39,791 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:44,098 INFO L146 ILogger]: Checked inductivity of 7260 backedges. 5430 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:44,099 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:44,099 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 10:00:44,099 INFO L146 ILogger]: Interpolant automaton has 124 states [2019-05-23 10:00:44,100 INFO L146 ILogger]: Constructing interpolant automaton starting with 124 interpolants. [2019-05-23 10:00:44,100 INFO L146 ILogger]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 10:00:44,100 INFO L146 ILogger]: Start difference. First operand 246 states and 247 transitions. Second operand 124 states. [2019-05-23 10:00:51,646 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:51,646 INFO L146 ILogger]: Finished difference Result 428 states and 429 transitions. [2019-05-23 10:00:51,646 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-05-23 10:00:51,646 INFO L146 ILogger]: Start accepts. Automaton has 124 states. Word has length 245 [2019-05-23 10:00:51,647 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:51,647 INFO L146 ILogger]: With dead ends: 428 [2019-05-23 10:00:51,648 INFO L146 ILogger]: Without dead ends: 247 [2019-05-23 10:00:51,650 INFO L146 ILogger]: 0 DeclaredPredicates, 305 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 10:00:51,650 INFO L146 ILogger]: Start minimizeSevpa. Operand 247 states. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Start removeUnreachable. Operand 247 states. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 245 [2019-05-23 10:00:51,652 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Abstraction has 247 states and 248 transitions. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Interpolant automaton has 124 states. [2019-05-23 10:00:51,652 INFO L146 ILogger]: Start isEmpty. Operand 247 states and 248 transitions. [2019-05-23 10:00:51,653 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 247 [2019-05-23 10:00:51,653 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:51,653 INFO L146 ILogger]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2019-05-23 10:00:51,653 INFO L146 ILogger]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:51,653 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:51,653 INFO L146 ILogger]: Analyzing trace with hash -1171367608, now seen corresponding path program 120 times [2019-05-23 10:00:51,654 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:51,716 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:51,725 INFO L146 ILogger]: Trace formula consists of 617 conjuncts, 249 conjunts are in the unsatisfiable core [2019-05-23 10:00:51,727 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:58,553 INFO L146 ILogger]: Checked inductivity of 7321 backedges. 0 proven. 7321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:58,554 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:58,554 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 10:00:58,554 INFO L146 ILogger]: Interpolant automaton has 126 states [2019-05-23 10:00:58,554 INFO L146 ILogger]: Constructing interpolant automaton starting with 126 interpolants. [2019-05-23 10:00:58,555 INFO L146 ILogger]: CoverageRelationStatistics Valid=310, Invalid=15440, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 10:00:58,555 INFO L146 ILogger]: Start difference. First operand 247 states and 248 transitions. Second operand 126 states. [2019-05-23 10:01:11,652 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:11,652 INFO L146 ILogger]: Finished difference Result 251 states and 252 transitions. [2019-05-23 10:01:11,653 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 10:01:11,653 INFO L146 ILogger]: Start accepts. Automaton has 126 states. Word has length 246 [2019-05-23 10:01:11,653 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:11,654 INFO L146 ILogger]: With dead ends: 251 [2019-05-23 10:01:11,654 INFO L146 ILogger]: Without dead ends: 251 [2019-05-23 10:01:11,655 INFO L146 ILogger]: 0 DeclaredPredicates, 246 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=315, Invalid=15687, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 10:01:11,655 INFO L146 ILogger]: Start minimizeSevpa. Operand 251 states. [2019-05-23 10:01:11,656 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-05-23 10:01:11,657 INFO L146 ILogger]: Start removeUnreachable. Operand 250 states. [2019-05-23 10:01:11,657 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-05-23 10:01:11,657 INFO L146 ILogger]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 246 [2019-05-23 10:01:11,657 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:11,658 INFO L146 ILogger]: Abstraction has 250 states and 251 transitions. [2019-05-23 10:01:11,658 INFO L146 ILogger]: Interpolant automaton has 126 states. [2019-05-23 10:01:11,658 INFO L146 ILogger]: Start isEmpty. Operand 250 states and 251 transitions. [2019-05-23 10:01:11,658 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 250 [2019-05-23 10:01:11,658 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:11,658 INFO L146 ILogger]: trace histogram [62, 61, 61, 61, 1, 1, 1, 1] [2019-05-23 10:01:11,659 INFO L146 ILogger]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:11,659 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:11,659 INFO L146 ILogger]: Analyzing trace with hash 397898887, now seen corresponding path program 121 times [2019-05-23 10:01:11,659 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:11,713 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:11,731 INFO L146 ILogger]: Trace formula consists of 623 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 10:01:11,732 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:16,122 INFO L146 ILogger]: Checked inductivity of 7503 backedges. 5612 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:16,122 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:16,122 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 10:01:16,123 INFO L146 ILogger]: Interpolant automaton has 126 states [2019-05-23 10:01:16,123 INFO L146 ILogger]: Constructing interpolant automaton starting with 126 interpolants. [2019-05-23 10:01:16,123 INFO L146 ILogger]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 10:01:16,124 INFO L146 ILogger]: Start difference. First operand 250 states and 251 transitions. Second operand 126 states. [2019-05-23 10:01:22,854 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:22,854 INFO L146 ILogger]: Finished difference Result 435 states and 436 transitions. [2019-05-23 10:01:22,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 10:01:22,854 INFO L146 ILogger]: Start accepts. Automaton has 126 states. Word has length 249 [2019-05-23 10:01:22,855 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:22,855 INFO L146 ILogger]: With dead ends: 435 [2019-05-23 10:01:22,855 INFO L146 ILogger]: Without dead ends: 251 [2019-05-23 10:01:22,858 INFO L146 ILogger]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5612 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2019-05-23 10:01:22,858 INFO L146 ILogger]: Start minimizeSevpa. Operand 251 states. [2019-05-23 10:01:22,859 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 251 to 251. [2019-05-23 10:01:22,860 INFO L146 ILogger]: Start removeUnreachable. Operand 251 states. [2019-05-23 10:01:22,860 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2019-05-23 10:01:22,860 INFO L146 ILogger]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 249 [2019-05-23 10:01:22,860 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:22,860 INFO L146 ILogger]: Abstraction has 251 states and 252 transitions. [2019-05-23 10:01:22,860 INFO L146 ILogger]: Interpolant automaton has 126 states. [2019-05-23 10:01:22,860 INFO L146 ILogger]: Start isEmpty. Operand 251 states and 252 transitions. [2019-05-23 10:01:22,861 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 251 [2019-05-23 10:01:22,861 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:22,861 INFO L146 ILogger]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2019-05-23 10:01:22,861 INFO L146 ILogger]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:22,861 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:22,861 INFO L146 ILogger]: Analyzing trace with hash -4876479, now seen corresponding path program 122 times [2019-05-23 10:01:22,862 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:22,929 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:22,945 INFO L146 ILogger]: Trace formula consists of 627 conjuncts, 253 conjunts are in the unsatisfiable core [2019-05-23 10:01:22,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:29,997 INFO L146 ILogger]: Checked inductivity of 7565 backedges. 0 proven. 7565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:29,997 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:29,997 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 10:01:29,998 INFO L146 ILogger]: Interpolant automaton has 128 states [2019-05-23 10:01:29,998 INFO L146 ILogger]: Constructing interpolant automaton starting with 128 interpolants. [2019-05-23 10:01:29,998 INFO L146 ILogger]: CoverageRelationStatistics Valid=315, Invalid=15941, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 10:01:29,998 INFO L146 ILogger]: Start difference. First operand 251 states and 252 transitions. Second operand 128 states. [2019-05-23 10:01:43,320 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:43,320 INFO L146 ILogger]: Finished difference Result 255 states and 256 transitions. [2019-05-23 10:01:43,321 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-05-23 10:01:43,321 INFO L146 ILogger]: Start accepts. Automaton has 128 states. Word has length 250 [2019-05-23 10:01:43,321 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:43,322 INFO L146 ILogger]: With dead ends: 255 [2019-05-23 10:01:43,322 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 10:01:43,322 INFO L146 ILogger]: 0 DeclaredPredicates, 250 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=320, Invalid=16192, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 10:01:43,323 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 10:01:43,324 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-05-23 10:01:43,324 INFO L146 ILogger]: Start removeUnreachable. Operand 254 states. [2019-05-23 10:01:43,325 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2019-05-23 10:01:43,325 INFO L146 ILogger]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 250 [2019-05-23 10:01:43,325 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:43,325 INFO L146 ILogger]: Abstraction has 254 states and 255 transitions. [2019-05-23 10:01:43,325 INFO L146 ILogger]: Interpolant automaton has 128 states. [2019-05-23 10:01:43,326 INFO L146 ILogger]: Start isEmpty. Operand 254 states and 255 transitions. [2019-05-23 10:01:43,326 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 254 [2019-05-23 10:01:43,326 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:43,326 INFO L146 ILogger]: trace histogram [63, 62, 62, 62, 1, 1, 1, 1] [2019-05-23 10:01:43,326 INFO L146 ILogger]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:43,327 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:43,327 INFO L146 ILogger]: Analyzing trace with hash 754730990, now seen corresponding path program 123 times [2019-05-23 10:01:43,327 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:43,381 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:43,399 INFO L146 ILogger]: Trace formula consists of 633 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 10:01:43,400 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:47,954 INFO L146 ILogger]: Checked inductivity of 7750 backedges. 5797 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:47,954 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:47,955 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 10:01:47,955 INFO L146 ILogger]: Interpolant automaton has 128 states [2019-05-23 10:01:47,955 INFO L146 ILogger]: Constructing interpolant automaton starting with 128 interpolants. [2019-05-23 10:01:47,956 INFO L146 ILogger]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 10:01:47,956 INFO L146 ILogger]: Start difference. First operand 254 states and 255 transitions. Second operand 128 states. [2019-05-23 10:01:54,847 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:54,847 INFO L146 ILogger]: Finished difference Result 442 states and 443 transitions. [2019-05-23 10:01:54,847 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-05-23 10:01:54,848 INFO L146 ILogger]: Start accepts. Automaton has 128 states. Word has length 253 [2019-05-23 10:01:54,848 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:54,848 INFO L146 ILogger]: With dead ends: 442 [2019-05-23 10:01:54,849 INFO L146 ILogger]: Without dead ends: 255 [2019-05-23 10:01:54,851 INFO L146 ILogger]: 0 DeclaredPredicates, 315 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5797 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 10:01:54,851 INFO L146 ILogger]: Start minimizeSevpa. Operand 255 states. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Start removeUnreachable. Operand 255 states. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 253 [2019-05-23 10:01:54,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Abstraction has 255 states and 256 transitions. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Interpolant automaton has 128 states. [2019-05-23 10:01:54,853 INFO L146 ILogger]: Start isEmpty. Operand 255 states and 256 transitions. [2019-05-23 10:01:54,854 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 255 [2019-05-23 10:01:54,854 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:54,854 INFO L146 ILogger]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2019-05-23 10:01:54,855 INFO L146 ILogger]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:54,855 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:54,855 INFO L146 ILogger]: Analyzing trace with hash -816415320, now seen corresponding path program 124 times [2019-05-23 10:01:54,855 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:54,948 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:54,958 INFO L146 ILogger]: Trace formula consists of 637 conjuncts, 257 conjunts are in the unsatisfiable core [2019-05-23 10:01:54,959 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:02,176 INFO L146 ILogger]: Checked inductivity of 7813 backedges. 0 proven. 7813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:02,177 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:02,177 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 10:02:02,177 INFO L146 ILogger]: Interpolant automaton has 130 states [2019-05-23 10:02:02,177 INFO L146 ILogger]: Constructing interpolant automaton starting with 130 interpolants. [2019-05-23 10:02:02,178 INFO L146 ILogger]: CoverageRelationStatistics Valid=320, Invalid=16450, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 10:02:02,178 INFO L146 ILogger]: Start difference. First operand 255 states and 256 transitions. Second operand 130 states. [2019-05-23 10:02:16,131 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:16,131 INFO L146 ILogger]: Finished difference Result 259 states and 260 transitions. [2019-05-23 10:02:16,132 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-05-23 10:02:16,132 INFO L146 ILogger]: Start accepts. Automaton has 130 states. Word has length 254 [2019-05-23 10:02:16,132 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:16,133 INFO L146 ILogger]: With dead ends: 259 [2019-05-23 10:02:16,133 INFO L146 ILogger]: Without dead ends: 259 [2019-05-23 10:02:16,134 INFO L146 ILogger]: 0 DeclaredPredicates, 254 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=325, Invalid=16705, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 10:02:16,134 INFO L146 ILogger]: Start minimizeSevpa. Operand 259 states. [2019-05-23 10:02:16,136 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 259 to 258. [2019-05-23 10:02:16,136 INFO L146 ILogger]: Start removeUnreachable. Operand 258 states. [2019-05-23 10:02:16,136 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2019-05-23 10:02:16,136 INFO L146 ILogger]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 254 [2019-05-23 10:02:16,136 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:16,136 INFO L146 ILogger]: Abstraction has 258 states and 259 transitions. [2019-05-23 10:02:16,136 INFO L146 ILogger]: Interpolant automaton has 130 states. [2019-05-23 10:02:16,137 INFO L146 ILogger]: Start isEmpty. Operand 258 states and 259 transitions. [2019-05-23 10:02:16,137 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 258 [2019-05-23 10:02:16,137 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:16,137 INFO L146 ILogger]: trace histogram [64, 63, 63, 63, 1, 1, 1, 1] [2019-05-23 10:02:16,137 INFO L146 ILogger]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:16,138 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:16,138 INFO L146 ILogger]: Analyzing trace with hash 572027943, now seen corresponding path program 125 times [2019-05-23 10:02:16,138 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:16,195 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:16,213 INFO L146 ILogger]: Trace formula consists of 643 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 10:02:16,215 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:20,839 INFO L146 ILogger]: Checked inductivity of 8001 backedges. 5985 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:20,840 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:20,840 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 10:02:20,840 INFO L146 ILogger]: Interpolant automaton has 130 states [2019-05-23 10:02:20,841 INFO L146 ILogger]: Constructing interpolant automaton starting with 130 interpolants. [2019-05-23 10:02:20,841 INFO L146 ILogger]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 10:02:20,841 INFO L146 ILogger]: Start difference. First operand 258 states and 259 transitions. Second operand 130 states. [2019-05-23 10:02:28,848 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:28,848 INFO L146 ILogger]: Finished difference Result 449 states and 450 transitions. [2019-05-23 10:02:28,848 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-05-23 10:02:28,848 INFO L146 ILogger]: Start accepts. Automaton has 130 states. Word has length 257 [2019-05-23 10:02:28,849 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:28,849 INFO L146 ILogger]: With dead ends: 449 [2019-05-23 10:02:28,849 INFO L146 ILogger]: Without dead ends: 259 [2019-05-23 10:02:28,850 INFO L146 ILogger]: 0 DeclaredPredicates, 320 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2019-05-23 10:02:28,851 INFO L146 ILogger]: Start minimizeSevpa. Operand 259 states. [2019-05-23 10:02:28,852 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-05-23 10:02:28,852 INFO L146 ILogger]: Start removeUnreachable. Operand 259 states. [2019-05-23 10:02:28,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2019-05-23 10:02:28,853 INFO L146 ILogger]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 257 [2019-05-23 10:02:28,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:28,853 INFO L146 ILogger]: Abstraction has 259 states and 260 transitions. [2019-05-23 10:02:28,853 INFO L146 ILogger]: Interpolant automaton has 130 states. [2019-05-23 10:02:28,854 INFO L146 ILogger]: Start isEmpty. Operand 259 states and 260 transitions. [2019-05-23 10:02:28,855 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 259 [2019-05-23 10:02:28,855 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:28,855 INFO L146 ILogger]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2019-05-23 10:02:28,856 INFO L146 ILogger]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:28,856 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:28,856 INFO L146 ILogger]: Analyzing trace with hash -57852703, now seen corresponding path program 126 times [2019-05-23 10:02:28,857 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:28,950 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:28,961 INFO L146 ILogger]: Trace formula consists of 647 conjuncts, 261 conjunts are in the unsatisfiable core [2019-05-23 10:02:28,963 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:36,279 INFO L146 ILogger]: Checked inductivity of 8065 backedges. 0 proven. 8065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:36,280 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:36,280 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 10:02:36,280 INFO L146 ILogger]: Interpolant automaton has 132 states [2019-05-23 10:02:36,281 INFO L146 ILogger]: Constructing interpolant automaton starting with 132 interpolants. [2019-05-23 10:02:36,281 INFO L146 ILogger]: CoverageRelationStatistics Valid=325, Invalid=16967, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 10:02:36,281 INFO L146 ILogger]: Start difference. First operand 259 states and 260 transitions. Second operand 132 states.