java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:21:57,129 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:21:57,133 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:21:57,152 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:21:57,152 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:21:57,153 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:21:57,156 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:21:57,158 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:21:57,162 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:21:57,163 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:21:57,164 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:21:57,164 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:21:57,166 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:21:57,167 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:21:57,168 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:21:57,169 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:21:57,170 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:21:57,172 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:21:57,174 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:21:57,176 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:21:57,177 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:21:57,178 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:21:57,181 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:21:57,181 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:21:57,182 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:21:57,183 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:21:57,183 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:21:57,184 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:21:57,184 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:21:57,185 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:21:57,186 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:21:57,187 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:21:57,188 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:21:57,189 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:21:57,189 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:21:57,190 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:21:57,190 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:21:57,191 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:21:57,192 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:21:57,222 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:21:57,238 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:21:57,244 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:21:57,246 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:21:57,247 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:21:57,248 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-05-23 09:21:57,248 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-05-23 09:21:57,284 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:21:57,285 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:21:57,286 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,286 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:21:57,287 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:21:57,303 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,314 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,323 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:21:57,324 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,324 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:21:57,324 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:21:57,335 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,335 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,336 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,336 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,340 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,342 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,342 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... [2019-05-23 09:21:57,344 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:21:57,344 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:21:57,345 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:21:57,345 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:21:57,346 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 [2019-05-23 09:21:57,407 INFO L146 ILogger]: Found specification of procedure ULTIMATE.start [2019-05-23 09:21:57,408 INFO L146 ILogger]: Found implementation of procedure ULTIMATE.start [2019-05-23 09:21:57,719 INFO L146 ILogger]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-23 09:21:57,720 INFO L146 ILogger]: Removed 1 assume(true) statements. [2019-05-23 09:21:57,721 INFO L146 ILogger]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57 BoogieIcfgContainer [2019-05-23 09:21:57,721 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:21:57,723 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:21:57,723 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:21:57,727 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:21:57,728 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:21:57" (1/2) ... [2019-05-23 09:21:57,729 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345349e3 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:21:57, skipping insertion in model container [2019-05-23 09:21:57,729 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:21:57" (2/2) ... [2019-05-23 09:21:57,731 INFO L146 ILogger]: Analyzing ICFG array1.i_3.bpl [2019-05-23 09:21:57,741 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:21:57,749 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:21:57,763 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:21:57,786 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:21:57,787 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:21:57,787 INFO L146 ILogger]: Hoare is false [2019-05-23 09:21:57,787 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:21:57,787 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:21:57,787 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:21:57,788 INFO L146 ILogger]: Difference is false [2019-05-23 09:21:57,788 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:21:57,788 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:21:57,807 INFO L146 ILogger]: Start isEmpty. Operand 19 states. [2019-05-23 09:21:57,816 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 13 [2019-05-23 09:21:57,817 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:57,818 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:57,820 INFO L146 ILogger]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:57,826 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:57,827 INFO L146 ILogger]: Analyzing trace with hash -1240084206, now seen corresponding path program 1 times [2019-05-23 09:21:57,873 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:57,910 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:57,913 INFO L146 ILogger]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:21:57,917 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,005 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,015 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:21:58,016 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:21:58,030 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:21:58,048 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:21:58,049 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,057 INFO L146 ILogger]: Start difference. First operand 19 states. Second operand 3 states. [2019-05-23 09:21:58,152 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,152 INFO L146 ILogger]: Finished difference Result 21 states and 21 transitions. [2019-05-23 09:21:58,153 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:21:58,154 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 12 [2019-05-23 09:21:58,154 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,164 INFO L146 ILogger]: With dead ends: 21 [2019-05-23 09:21:58,165 INFO L146 ILogger]: Without dead ends: 21 [2019-05-23 09:21:58,167 INFO L146 ILogger]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:21:58,183 INFO L146 ILogger]: Start minimizeSevpa. Operand 21 states. [2019-05-23 09:21:58,196 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-05-23 09:21:58,197 INFO L146 ILogger]: Start removeUnreachable. Operand 18 states. [2019-05-23 09:21:58,198 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-05-23 09:21:58,200 INFO L146 ILogger]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2019-05-23 09:21:58,200 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,200 INFO L146 ILogger]: Abstraction has 18 states and 18 transitions. [2019-05-23 09:21:58,201 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:21:58,201 INFO L146 ILogger]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-23 09:21:58,202 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 18 [2019-05-23 09:21:58,202 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,202 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,202 INFO L146 ILogger]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,203 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,203 INFO L146 ILogger]: Analyzing trace with hash 1365845986, now seen corresponding path program 1 times [2019-05-23 09:21:58,204 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,223 INFO L146 ILogger]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,225 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,283 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,283 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,284 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:21:58,286 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:21:58,286 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:21:58,287 INFO L146 ILogger]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:21:58,287 INFO L146 ILogger]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2019-05-23 09:21:58,416 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,417 INFO L146 ILogger]: Finished difference Result 26 states and 26 transitions. [2019-05-23 09:21:58,417 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:21:58,418 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 17 [2019-05-23 09:21:58,418 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,418 INFO L146 ILogger]: With dead ends: 26 [2019-05-23 09:21:58,419 INFO L146 ILogger]: Without dead ends: 26 [2019-05-23 09:21:58,420 INFO L146 ILogger]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,421 INFO L146 ILogger]: Start minimizeSevpa. Operand 26 states. [2019-05-23 09:21:58,424 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-05-23 09:21:58,424 INFO L146 ILogger]: Start removeUnreachable. Operand 23 states. [2019-05-23 09:21:58,425 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-23 09:21:58,425 INFO L146 ILogger]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2019-05-23 09:21:58,425 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,426 INFO L146 ILogger]: Abstraction has 23 states and 23 transitions. [2019-05-23 09:21:58,426 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:21:58,426 INFO L146 ILogger]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-23 09:21:58,427 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 09:21:58,427 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,427 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,428 INFO L146 ILogger]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,428 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,428 INFO L146 ILogger]: Analyzing trace with hash -173305070, now seen corresponding path program 2 times [2019-05-23 09:21:58,429 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,443 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,445 INFO L146 ILogger]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,447 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:58,645 INFO L146 ILogger]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:58,646 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:58,647 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:21:58,662 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:21:58,662 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:21:58,663 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:21:58,663 INFO L146 ILogger]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2019-05-23 09:21:58,959 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:58,960 INFO L146 ILogger]: Finished difference Result 31 states and 31 transitions. [2019-05-23 09:21:58,961 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:21:58,962 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 22 [2019-05-23 09:21:58,962 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:58,963 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 09:21:58,963 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 09:21:58,964 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:58,964 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 09:21:58,967 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-05-23 09:21:58,968 INFO L146 ILogger]: Start removeUnreachable. Operand 28 states. [2019-05-23 09:21:58,969 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-23 09:21:58,969 INFO L146 ILogger]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2019-05-23 09:21:58,969 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:58,969 INFO L146 ILogger]: Abstraction has 28 states and 28 transitions. [2019-05-23 09:21:58,970 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:21:58,970 INFO L146 ILogger]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-23 09:21:58,971 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 28 [2019-05-23 09:21:58,971 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:58,971 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:58,971 INFO L146 ILogger]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:58,972 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:58,972 INFO L146 ILogger]: Analyzing trace with hash -1826839070, now seen corresponding path program 3 times [2019-05-23 09:21:58,973 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:58,988 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:58,990 INFO L146 ILogger]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:21:58,992 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,223 INFO L146 ILogger]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:59,223 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,223 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:21:59,224 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:21:59,224 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:21:59,225 INFO L146 ILogger]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:21:59,225 INFO L146 ILogger]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2019-05-23 09:21:59,414 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:21:59,415 INFO L146 ILogger]: Finished difference Result 36 states and 36 transitions. [2019-05-23 09:21:59,415 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:21:59,415 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 27 [2019-05-23 09:21:59,416 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:21:59,416 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 09:21:59,416 INFO L146 ILogger]: Without dead ends: 36 [2019-05-23 09:21:59,418 INFO L146 ILogger]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:21:59,418 INFO L146 ILogger]: Start minimizeSevpa. Operand 36 states. [2019-05-23 09:21:59,422 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-05-23 09:21:59,423 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 09:21:59,423 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-23 09:21:59,423 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2019-05-23 09:21:59,425 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:21:59,425 INFO L146 ILogger]: Abstraction has 33 states and 33 transitions. [2019-05-23 09:21:59,425 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:21:59,425 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-23 09:21:59,426 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 33 [2019-05-23 09:21:59,426 INFO L146 ILogger]: Found error trace [2019-05-23 09:21:59,426 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:21:59,426 INFO L146 ILogger]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:21:59,427 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:21:59,427 INFO L146 ILogger]: Analyzing trace with hash -831073006, now seen corresponding path program 4 times [2019-05-23 09:21:59,428 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:21:59,444 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:21:59,446 INFO L146 ILogger]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:21:59,448 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:21:59,893 INFO L146 ILogger]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:21:59,894 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:21:59,894 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:21:59,894 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:21:59,895 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:21:59,895 INFO L146 ILogger]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:21:59,898 INFO L146 ILogger]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2019-05-23 09:22:00,089 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,090 INFO L146 ILogger]: Finished difference Result 41 states and 41 transitions. [2019-05-23 09:22:00,091 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:00,091 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 32 [2019-05-23 09:22:00,093 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,093 INFO L146 ILogger]: With dead ends: 41 [2019-05-23 09:22:00,093 INFO L146 ILogger]: Without dead ends: 41 [2019-05-23 09:22:00,094 INFO L146 ILogger]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:00,094 INFO L146 ILogger]: Start minimizeSevpa. Operand 41 states. [2019-05-23 09:22:00,097 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-05-23 09:22:00,098 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 09:22:00,099 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-05-23 09:22:00,099 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2019-05-23 09:22:00,099 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,099 INFO L146 ILogger]: Abstraction has 38 states and 38 transitions. [2019-05-23 09:22:00,099 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:00,100 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-23 09:22:00,101 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:22:00,101 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,101 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,101 INFO L146 ILogger]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,102 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,102 INFO L146 ILogger]: Analyzing trace with hash 554345442, now seen corresponding path program 5 times [2019-05-23 09:22:00,103 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,123 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,125 INFO L146 ILogger]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,128 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:00,317 INFO L146 ILogger]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:00,317 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:00,318 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:00,318 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:00,318 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:00,319 INFO L146 ILogger]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:00,319 INFO L146 ILogger]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2019-05-23 09:22:00,869 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:00,869 INFO L146 ILogger]: Finished difference Result 46 states and 46 transitions. [2019-05-23 09:22:00,874 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:00,874 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 37 [2019-05-23 09:22:00,875 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:00,875 INFO L146 ILogger]: With dead ends: 46 [2019-05-23 09:22:00,875 INFO L146 ILogger]: Without dead ends: 46 [2019-05-23 09:22:00,876 INFO L146 ILogger]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:00,877 INFO L146 ILogger]: Start minimizeSevpa. Operand 46 states. [2019-05-23 09:22:00,882 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-05-23 09:22:00,882 INFO L146 ILogger]: Start removeUnreachable. Operand 43 states. [2019-05-23 09:22:00,883 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-23 09:22:00,883 INFO L146 ILogger]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2019-05-23 09:22:00,884 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:00,884 INFO L146 ILogger]: Abstraction has 43 states and 43 transitions. [2019-05-23 09:22:00,884 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:00,884 INFO L146 ILogger]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-23 09:22:00,887 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 09:22:00,887 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:00,888 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:00,890 INFO L146 ILogger]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:00,890 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:00,890 INFO L146 ILogger]: Analyzing trace with hash 1536661266, now seen corresponding path program 6 times [2019-05-23 09:22:00,891 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:00,935 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:00,945 INFO L146 ILogger]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:00,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,303 INFO L146 ILogger]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,304 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,304 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:01,304 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:01,305 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:01,305 INFO L146 ILogger]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:01,305 INFO L146 ILogger]: Start difference. First operand 43 states and 43 transitions. Second operand 15 states. [2019-05-23 09:22:01,560 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:01,560 INFO L146 ILogger]: Finished difference Result 51 states and 51 transitions. [2019-05-23 09:22:01,561 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:01,561 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 42 [2019-05-23 09:22:01,562 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:01,563 INFO L146 ILogger]: With dead ends: 51 [2019-05-23 09:22:01,563 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:22:01,564 INFO L146 ILogger]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:01,565 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:22:01,568 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-05-23 09:22:01,568 INFO L146 ILogger]: Start removeUnreachable. Operand 48 states. [2019-05-23 09:22:01,569 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-05-23 09:22:01,569 INFO L146 ILogger]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2019-05-23 09:22:01,569 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:01,570 INFO L146 ILogger]: Abstraction has 48 states and 48 transitions. [2019-05-23 09:22:01,570 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:01,570 INFO L146 ILogger]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-23 09:22:01,572 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 48 [2019-05-23 09:22:01,572 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:01,573 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:01,573 INFO L146 ILogger]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:01,573 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:01,573 INFO L146 ILogger]: Analyzing trace with hash -736943646, now seen corresponding path program 7 times [2019-05-23 09:22:01,574 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:01,598 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:01,601 INFO L146 ILogger]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:22:01,604 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:01,795 INFO L146 ILogger]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:01,796 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:01,796 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:01,796 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:01,797 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:01,797 INFO L146 ILogger]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:01,797 INFO L146 ILogger]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2019-05-23 09:22:02,158 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,159 INFO L146 ILogger]: Finished difference Result 56 states and 56 transitions. [2019-05-23 09:22:02,159 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:02,160 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 47 [2019-05-23 09:22:02,160 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,161 INFO L146 ILogger]: With dead ends: 56 [2019-05-23 09:22:02,162 INFO L146 ILogger]: Without dead ends: 56 [2019-05-23 09:22:02,162 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:02,163 INFO L146 ILogger]: Start minimizeSevpa. Operand 56 states. [2019-05-23 09:22:02,166 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-05-23 09:22:02,166 INFO L146 ILogger]: Start removeUnreachable. Operand 53 states. [2019-05-23 09:22:02,167 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-23 09:22:02,167 INFO L146 ILogger]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2019-05-23 09:22:02,168 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,168 INFO L146 ILogger]: Abstraction has 53 states and 53 transitions. [2019-05-23 09:22:02,168 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:02,168 INFO L146 ILogger]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-23 09:22:02,169 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 53 [2019-05-23 09:22:02,169 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,169 INFO L146 ILogger]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,169 INFO L146 ILogger]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,170 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,170 INFO L146 ILogger]: Analyzing trace with hash 1345181970, now seen corresponding path program 8 times [2019-05-23 09:22:02,171 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,188 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,190 INFO L146 ILogger]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,193 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:02,478 INFO L146 ILogger]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:02,478 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:02,478 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:02,479 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:02,479 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:02,480 INFO L146 ILogger]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:02,480 INFO L146 ILogger]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2019-05-23 09:22:02,906 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:02,906 INFO L146 ILogger]: Finished difference Result 61 states and 61 transitions. [2019-05-23 09:22:02,911 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:02,911 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 52 [2019-05-23 09:22:02,912 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:02,912 INFO L146 ILogger]: With dead ends: 61 [2019-05-23 09:22:02,912 INFO L146 ILogger]: Without dead ends: 61 [2019-05-23 09:22:02,913 INFO L146 ILogger]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:02,914 INFO L146 ILogger]: Start minimizeSevpa. Operand 61 states. [2019-05-23 09:22:02,917 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-05-23 09:22:02,917 INFO L146 ILogger]: Start removeUnreachable. Operand 58 states. [2019-05-23 09:22:02,917 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-05-23 09:22:02,918 INFO L146 ILogger]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 52 [2019-05-23 09:22:02,918 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:02,918 INFO L146 ILogger]: Abstraction has 58 states and 58 transitions. [2019-05-23 09:22:02,918 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:02,918 INFO L146 ILogger]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-23 09:22:02,919 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:22:02,919 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:02,919 INFO L146 ILogger]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:02,920 INFO L146 ILogger]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:02,920 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:02,920 INFO L146 ILogger]: Analyzing trace with hash -317317150, now seen corresponding path program 9 times [2019-05-23 09:22:02,924 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:02,943 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:02,945 INFO L146 ILogger]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:22:02,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:03,328 INFO L146 ILogger]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:03,329 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,329 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:03,330 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:03,330 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:03,330 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:03,331 INFO L146 ILogger]: Start difference. First operand 58 states and 58 transitions. Second operand 21 states. [2019-05-23 09:22:03,689 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:03,689 INFO L146 ILogger]: Finished difference Result 66 states and 66 transitions. [2019-05-23 09:22:03,689 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:03,690 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 57 [2019-05-23 09:22:03,690 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:03,691 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 09:22:03,691 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 09:22:03,693 INFO L146 ILogger]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:03,693 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 09:22:03,696 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-05-23 09:22:03,696 INFO L146 ILogger]: Start removeUnreachable. Operand 63 states. [2019-05-23 09:22:03,697 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-23 09:22:03,697 INFO L146 ILogger]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 57 [2019-05-23 09:22:03,698 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:03,698 INFO L146 ILogger]: Abstraction has 63 states and 63 transitions. [2019-05-23 09:22:03,698 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:03,698 INFO L146 ILogger]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-23 09:22:03,699 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 63 [2019-05-23 09:22:03,699 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:03,699 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:03,699 INFO L146 ILogger]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:03,700 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:03,700 INFO L146 ILogger]: Analyzing trace with hash -145122542, now seen corresponding path program 10 times [2019-05-23 09:22:03,701 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:03,720 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:03,723 INFO L146 ILogger]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:03,725 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:03,986 INFO L146 ILogger]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:03,986 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:03,986 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:03,987 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:03,987 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:03,987 INFO L146 ILogger]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:03,988 INFO L146 ILogger]: Start difference. First operand 63 states and 63 transitions. Second operand 23 states. [2019-05-23 09:22:04,488 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:04,488 INFO L146 ILogger]: Finished difference Result 71 states and 71 transitions. [2019-05-23 09:22:04,495 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:04,495 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 62 [2019-05-23 09:22:04,495 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:04,496 INFO L146 ILogger]: With dead ends: 71 [2019-05-23 09:22:04,496 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 09:22:04,497 INFO L146 ILogger]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:04,497 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 09:22:04,505 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-05-23 09:22:04,505 INFO L146 ILogger]: Start removeUnreachable. Operand 68 states. [2019-05-23 09:22:04,506 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-05-23 09:22:04,507 INFO L146 ILogger]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 62 [2019-05-23 09:22:04,507 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:04,507 INFO L146 ILogger]: Abstraction has 68 states and 68 transitions. [2019-05-23 09:22:04,507 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:04,507 INFO L146 ILogger]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-23 09:22:04,508 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 68 [2019-05-23 09:22:04,508 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:04,508 INFO L146 ILogger]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:04,509 INFO L146 ILogger]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:04,509 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:04,509 INFO L146 ILogger]: Analyzing trace with hash 351509986, now seen corresponding path program 11 times [2019-05-23 09:22:04,510 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:04,530 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:04,533 INFO L146 ILogger]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:04,536 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:04,950 INFO L146 ILogger]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:04,951 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:04,951 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:04,951 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:04,952 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:04,952 INFO L146 ILogger]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:04,952 INFO L146 ILogger]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2019-05-23 09:22:05,410 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,410 INFO L146 ILogger]: Finished difference Result 76 states and 76 transitions. [2019-05-23 09:22:05,411 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:05,411 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 67 [2019-05-23 09:22:05,411 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,412 INFO L146 ILogger]: With dead ends: 76 [2019-05-23 09:22:05,412 INFO L146 ILogger]: Without dead ends: 76 [2019-05-23 09:22:05,414 INFO L146 ILogger]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:05,414 INFO L146 ILogger]: Start minimizeSevpa. Operand 76 states. [2019-05-23 09:22:05,417 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-05-23 09:22:05,417 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 09:22:05,420 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-23 09:22:05,420 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 67 [2019-05-23 09:22:05,421 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,421 INFO L146 ILogger]: Abstraction has 73 states and 73 transitions. [2019-05-23 09:22:05,421 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:05,421 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-23 09:22:05,422 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 73 [2019-05-23 09:22:05,422 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,422 INFO L146 ILogger]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:05,423 INFO L146 ILogger]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,423 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,423 INFO L146 ILogger]: Analyzing trace with hash 876272914, now seen corresponding path program 12 times [2019-05-23 09:22:05,424 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,465 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,467 INFO L146 ILogger]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,478 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,056 INFO L146 ILogger]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,056 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,056 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:06,057 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:06,057 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:06,058 INFO L146 ILogger]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:06,058 INFO L146 ILogger]: Start difference. First operand 73 states and 73 transitions. Second operand 27 states. [2019-05-23 09:22:06,589 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,589 INFO L146 ILogger]: Finished difference Result 81 states and 81 transitions. [2019-05-23 09:22:06,590 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:06,590 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 72 [2019-05-23 09:22:06,591 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,591 INFO L146 ILogger]: With dead ends: 81 [2019-05-23 09:22:06,592 INFO L146 ILogger]: Without dead ends: 81 [2019-05-23 09:22:06,593 INFO L146 ILogger]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:06,593 INFO L146 ILogger]: Start minimizeSevpa. Operand 81 states. [2019-05-23 09:22:06,596 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-05-23 09:22:06,596 INFO L146 ILogger]: Start removeUnreachable. Operand 78 states. [2019-05-23 09:22:06,597 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-05-23 09:22:06,597 INFO L146 ILogger]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 72 [2019-05-23 09:22:06,598 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,598 INFO L146 ILogger]: Abstraction has 78 states and 78 transitions. [2019-05-23 09:22:06,598 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:06,598 INFO L146 ILogger]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-23 09:22:06,599 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 09:22:06,599 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,599 INFO L146 ILogger]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:06,599 INFO L146 ILogger]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,600 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,600 INFO L146 ILogger]: Analyzing trace with hash 1552653282, now seen corresponding path program 13 times [2019-05-23 09:22:06,601 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,619 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,622 INFO L146 ILogger]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,625 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,264 INFO L146 ILogger]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,265 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,265 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:07,265 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:07,266 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:07,266 INFO L146 ILogger]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:07,266 INFO L146 ILogger]: Start difference. First operand 78 states and 78 transitions. Second operand 29 states. [2019-05-23 09:22:08,061 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,061 INFO L146 ILogger]: Finished difference Result 86 states and 86 transitions. [2019-05-23 09:22:08,063 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:08,063 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 77 [2019-05-23 09:22:08,063 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,064 INFO L146 ILogger]: With dead ends: 86 [2019-05-23 09:22:08,064 INFO L146 ILogger]: Without dead ends: 86 [2019-05-23 09:22:08,065 INFO L146 ILogger]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:08,065 INFO L146 ILogger]: Start minimizeSevpa. Operand 86 states. [2019-05-23 09:22:08,068 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-05-23 09:22:08,068 INFO L146 ILogger]: Start removeUnreachable. Operand 83 states. [2019-05-23 09:22:08,069 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-23 09:22:08,069 INFO L146 ILogger]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 77 [2019-05-23 09:22:08,069 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,070 INFO L146 ILogger]: Abstraction has 83 states and 83 transitions. [2019-05-23 09:22:08,070 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:08,070 INFO L146 ILogger]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-23 09:22:08,071 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 09:22:08,071 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,071 INFO L146 ILogger]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:08,071 INFO L146 ILogger]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,071 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,072 INFO L146 ILogger]: Analyzing trace with hash -2114871534, now seen corresponding path program 14 times [2019-05-23 09:22:08,072 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,090 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,092 INFO L146 ILogger]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,095 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,474 INFO L146 ILogger]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,475 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,475 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:08,475 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:08,475 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:08,476 INFO L146 ILogger]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:08,476 INFO L146 ILogger]: Start difference. First operand 83 states and 83 transitions. Second operand 31 states. [2019-05-23 09:22:09,111 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,112 INFO L146 ILogger]: Finished difference Result 91 states and 91 transitions. [2019-05-23 09:22:09,112 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:22:09,112 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 82 [2019-05-23 09:22:09,113 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,113 INFO L146 ILogger]: With dead ends: 91 [2019-05-23 09:22:09,114 INFO L146 ILogger]: Without dead ends: 91 [2019-05-23 09:22:09,115 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:09,116 INFO L146 ILogger]: Start minimizeSevpa. Operand 91 states. [2019-05-23 09:22:09,118 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-05-23 09:22:09,118 INFO L146 ILogger]: Start removeUnreachable. Operand 88 states. [2019-05-23 09:22:09,119 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-05-23 09:22:09,119 INFO L146 ILogger]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 82 [2019-05-23 09:22:09,119 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,119 INFO L146 ILogger]: Abstraction has 88 states and 88 transitions. [2019-05-23 09:22:09,120 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:09,120 INFO L146 ILogger]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-23 09:22:09,120 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 88 [2019-05-23 09:22:09,121 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,121 INFO L146 ILogger]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:09,121 INFO L146 ILogger]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,121 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,121 INFO L146 ILogger]: Analyzing trace with hash 1019091426, now seen corresponding path program 15 times [2019-05-23 09:22:09,122 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,140 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,142 INFO L146 ILogger]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,145 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,499 INFO L146 ILogger]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,499 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,499 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:09,500 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:09,500 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:09,501 INFO L146 ILogger]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:09,501 INFO L146 ILogger]: Start difference. First operand 88 states and 88 transitions. Second operand 33 states. [2019-05-23 09:22:10,184 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,184 INFO L146 ILogger]: Finished difference Result 96 states and 96 transitions. [2019-05-23 09:22:10,185 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:22:10,185 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 87 [2019-05-23 09:22:10,186 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,186 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 09:22:10,187 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 09:22:10,189 INFO L146 ILogger]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:10,190 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 09:22:10,192 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 93. [2019-05-23 09:22:10,192 INFO L146 ILogger]: Start removeUnreachable. Operand 93 states. [2019-05-23 09:22:10,193 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-23 09:22:10,193 INFO L146 ILogger]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 87 [2019-05-23 09:22:10,193 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,193 INFO L146 ILogger]: Abstraction has 93 states and 93 transitions. [2019-05-23 09:22:10,193 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:10,193 INFO L146 ILogger]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-23 09:22:10,194 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 09:22:10,194 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,194 INFO L146 ILogger]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:10,195 INFO L146 ILogger]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,195 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,195 INFO L146 ILogger]: Analyzing trace with hash -207757038, now seen corresponding path program 16 times [2019-05-23 09:22:10,196 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,214 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,216 INFO L146 ILogger]: Trace formula consists of 130 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,219 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,016 INFO L146 ILogger]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,017 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,017 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:11,017 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:11,018 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:11,018 INFO L146 ILogger]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:11,018 INFO L146 ILogger]: Start difference. First operand 93 states and 93 transitions. Second operand 35 states. [2019-05-23 09:22:11,730 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,731 INFO L146 ILogger]: Finished difference Result 101 states and 101 transitions. [2019-05-23 09:22:11,731 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:22:11,731 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 92 [2019-05-23 09:22:11,732 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,733 INFO L146 ILogger]: With dead ends: 101 [2019-05-23 09:22:11,733 INFO L146 ILogger]: Without dead ends: 101 [2019-05-23 09:22:11,735 INFO L146 ILogger]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:11,735 INFO L146 ILogger]: Start minimizeSevpa. Operand 101 states. [2019-05-23 09:22:11,737 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-05-23 09:22:11,737 INFO L146 ILogger]: Start removeUnreachable. Operand 98 states. [2019-05-23 09:22:11,738 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-05-23 09:22:11,738 INFO L146 ILogger]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 92 [2019-05-23 09:22:11,738 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,738 INFO L146 ILogger]: Abstraction has 98 states and 98 transitions. [2019-05-23 09:22:11,738 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:11,738 INFO L146 ILogger]: Start isEmpty. Operand 98 states and 98 transitions. [2019-05-23 09:22:11,739 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:22:11,739 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,739 INFO L146 ILogger]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:11,740 INFO L146 ILogger]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,740 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,740 INFO L146 ILogger]: Analyzing trace with hash -1771366430, now seen corresponding path program 17 times [2019-05-23 09:22:11,741 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,758 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,761 INFO L146 ILogger]: Trace formula consists of 137 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,764 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,451 INFO L146 ILogger]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,452 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,452 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:12,452 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:12,453 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:12,453 INFO L146 ILogger]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:12,453 INFO L146 ILogger]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2019-05-23 09:22:13,362 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,363 INFO L146 ILogger]: Finished difference Result 106 states and 106 transitions. [2019-05-23 09:22:13,363 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:22:13,364 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 97 [2019-05-23 09:22:13,364 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,365 INFO L146 ILogger]: With dead ends: 106 [2019-05-23 09:22:13,365 INFO L146 ILogger]: Without dead ends: 106 [2019-05-23 09:22:13,367 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:22:13,367 INFO L146 ILogger]: Start minimizeSevpa. Operand 106 states. [2019-05-23 09:22:13,369 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-05-23 09:22:13,369 INFO L146 ILogger]: Start removeUnreachable. Operand 103 states. [2019-05-23 09:22:13,369 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-05-23 09:22:13,369 INFO L146 ILogger]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 97 [2019-05-23 09:22:13,370 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,370 INFO L146 ILogger]: Abstraction has 103 states and 103 transitions. [2019-05-23 09:22:13,370 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:13,370 INFO L146 ILogger]: Start isEmpty. Operand 103 states and 103 transitions. [2019-05-23 09:22:13,371 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 103 [2019-05-23 09:22:13,371 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,371 INFO L146 ILogger]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:13,371 INFO L146 ILogger]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,372 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,372 INFO L146 ILogger]: Analyzing trace with hash 878682898, now seen corresponding path program 18 times [2019-05-23 09:22:13,373 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,390 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,392 INFO L146 ILogger]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,395 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,929 INFO L146 ILogger]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,929 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,929 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:13,930 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:13,930 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:13,931 INFO L146 ILogger]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:13,931 INFO L146 ILogger]: Start difference. First operand 103 states and 103 transitions. Second operand 39 states. [2019-05-23 09:22:14,814 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,814 INFO L146 ILogger]: Finished difference Result 111 states and 111 transitions. [2019-05-23 09:22:14,815 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:22:14,815 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 102 [2019-05-23 09:22:14,816 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,816 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:22:14,817 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:22:14,818 INFO L146 ILogger]: 0 DeclaredPredicates, 137 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:22:14,819 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:22:14,820 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-05-23 09:22:14,820 INFO L146 ILogger]: Start removeUnreachable. Operand 108 states. [2019-05-23 09:22:14,821 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-05-23 09:22:14,821 INFO L146 ILogger]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 102 [2019-05-23 09:22:14,821 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,821 INFO L146 ILogger]: Abstraction has 108 states and 108 transitions. [2019-05-23 09:22:14,821 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:14,821 INFO L146 ILogger]: Start isEmpty. Operand 108 states and 108 transitions. [2019-05-23 09:22:14,822 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 108 [2019-05-23 09:22:14,822 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,822 INFO L146 ILogger]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:14,823 INFO L146 ILogger]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,823 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,823 INFO L146 ILogger]: Analyzing trace with hash -1301113374, now seen corresponding path program 19 times [2019-05-23 09:22:14,824 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,855 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,860 INFO L146 ILogger]: Trace formula consists of 151 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,862 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,402 INFO L146 ILogger]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,403 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,403 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:15,403 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:15,404 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:15,404 INFO L146 ILogger]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:15,404 INFO L146 ILogger]: Start difference. First operand 108 states and 108 transitions. Second operand 41 states. [2019-05-23 09:22:16,669 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,670 INFO L146 ILogger]: Finished difference Result 116 states and 116 transitions. [2019-05-23 09:22:16,670 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:22:16,670 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 107 [2019-05-23 09:22:16,671 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,672 INFO L146 ILogger]: With dead ends: 116 [2019-05-23 09:22:16,672 INFO L146 ILogger]: Without dead ends: 116 [2019-05-23 09:22:16,674 INFO L146 ILogger]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:22:16,675 INFO L146 ILogger]: Start minimizeSevpa. Operand 116 states. [2019-05-23 09:22:16,676 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 116 to 113. [2019-05-23 09:22:16,676 INFO L146 ILogger]: Start removeUnreachable. Operand 113 states. [2019-05-23 09:22:16,677 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-05-23 09:22:16,677 INFO L146 ILogger]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 107 [2019-05-23 09:22:16,677 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,678 INFO L146 ILogger]: Abstraction has 113 states and 113 transitions. [2019-05-23 09:22:16,678 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:16,679 INFO L146 ILogger]: Start isEmpty. Operand 113 states and 113 transitions. [2019-05-23 09:22:16,679 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 113 [2019-05-23 09:22:16,679 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,680 INFO L146 ILogger]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:16,680 INFO L146 ILogger]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,680 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,680 INFO L146 ILogger]: Analyzing trace with hash -2024348398, now seen corresponding path program 20 times [2019-05-23 09:22:16,681 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,696 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,698 INFO L146 ILogger]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,700 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,292 INFO L146 ILogger]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:17,292 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,293 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:22:17,293 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:17,293 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:17,294 INFO L146 ILogger]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:17,294 INFO L146 ILogger]: Start difference. First operand 113 states and 113 transitions. Second operand 43 states. [2019-05-23 09:22:18,233 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:18,234 INFO L146 ILogger]: Finished difference Result 121 states and 121 transitions. [2019-05-23 09:22:18,235 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:22:18,235 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 112 [2019-05-23 09:22:18,235 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:18,236 INFO L146 ILogger]: With dead ends: 121 [2019-05-23 09:22:18,236 INFO L146 ILogger]: Without dead ends: 121 [2019-05-23 09:22:18,239 INFO L146 ILogger]: 0 DeclaredPredicates, 151 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:22:18,239 INFO L146 ILogger]: Start minimizeSevpa. Operand 121 states. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 121 to 118. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 09:22:18,241 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 112 [2019-05-23 09:22:18,242 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Abstraction has 118 states and 118 transitions. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 118 transitions. [2019-05-23 09:22:18,242 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 09:22:18,242 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:18,243 INFO L146 ILogger]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:18,243 INFO L146 ILogger]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:18,243 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:18,243 INFO L146 ILogger]: Analyzing trace with hash 1102353378, now seen corresponding path program 21 times [2019-05-23 09:22:18,244 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:18,259 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:18,261 INFO L146 ILogger]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:22:18,263 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,946 INFO L146 ILogger]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,946 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,946 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:22:18,946 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:22:18,947 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:22:18,947 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:18,947 INFO L146 ILogger]: Start difference. First operand 118 states and 118 transitions. Second operand 45 states. [2019-05-23 09:22:20,152 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:20,152 INFO L146 ILogger]: Finished difference Result 126 states and 126 transitions. [2019-05-23 09:22:20,155 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:22:20,155 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 117 [2019-05-23 09:22:20,155 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:20,156 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 09:22:20,156 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 09:22:20,158 INFO L146 ILogger]: 0 DeclaredPredicates, 158 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:22:20,158 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 09:22:20,160 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 123. [2019-05-23 09:22:20,161 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 09:22:20,161 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-05-23 09:22:20,161 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 117 [2019-05-23 09:22:20,161 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:20,162 INFO L146 ILogger]: Abstraction has 123 states and 123 transitions. [2019-05-23 09:22:20,162 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:22:20,162 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 123 transitions. [2019-05-23 09:22:20,162 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 09:22:20,162 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:20,163 INFO L146 ILogger]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:20,163 INFO L146 ILogger]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:20,163 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:20,163 INFO L146 ILogger]: Analyzing trace with hash -945576174, now seen corresponding path program 22 times [2019-05-23 09:22:20,164 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:20,178 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:20,181 INFO L146 ILogger]: Trace formula consists of 172 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:20,183 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,807 INFO L146 ILogger]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:20,808 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,808 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:22:20,808 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:22:20,808 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:22:20,809 INFO L146 ILogger]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:20,809 INFO L146 ILogger]: Start difference. First operand 123 states and 123 transitions. Second operand 47 states. [2019-05-23 09:22:22,273 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:22,274 INFO L146 ILogger]: Finished difference Result 131 states and 131 transitions. [2019-05-23 09:22:22,277 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:22:22,277 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 122 [2019-05-23 09:22:22,277 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:22,278 INFO L146 ILogger]: With dead ends: 131 [2019-05-23 09:22:22,278 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:22:22,279 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:22:22,279 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:22:22,281 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-05-23 09:22:22,281 INFO L146 ILogger]: Start removeUnreachable. Operand 128 states. [2019-05-23 09:22:22,282 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-05-23 09:22:22,282 INFO L146 ILogger]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 122 [2019-05-23 09:22:22,282 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:22,282 INFO L146 ILogger]: Abstraction has 128 states and 128 transitions. [2019-05-23 09:22:22,283 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:22:22,283 INFO L146 ILogger]: Start isEmpty. Operand 128 states and 128 transitions. [2019-05-23 09:22:22,283 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 128 [2019-05-23 09:22:22,283 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:22,284 INFO L146 ILogger]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:22,284 INFO L146 ILogger]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:22,284 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:22,284 INFO L146 ILogger]: Analyzing trace with hash 1561399778, now seen corresponding path program 23 times [2019-05-23 09:22:22,285 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:22,300 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:22,302 INFO L146 ILogger]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:22,304 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,178 INFO L146 ILogger]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:23,178 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,178 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:22:23,178 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:22:23,179 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:22:23,179 INFO L146 ILogger]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:23,179 INFO L146 ILogger]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2019-05-23 09:22:24,426 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:24,426 INFO L146 ILogger]: Finished difference Result 136 states and 136 transitions. [2019-05-23 09:22:24,427 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:22:24,427 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 127 [2019-05-23 09:22:24,427 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:24,428 INFO L146 ILogger]: With dead ends: 136 [2019-05-23 09:22:24,428 INFO L146 ILogger]: Without dead ends: 136 [2019-05-23 09:22:24,430 INFO L146 ILogger]: 0 DeclaredPredicates, 172 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:22:24,430 INFO L146 ILogger]: Start minimizeSevpa. Operand 136 states. [2019-05-23 09:22:24,432 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 136 to 133. [2019-05-23 09:22:24,432 INFO L146 ILogger]: Start removeUnreachable. Operand 133 states. [2019-05-23 09:22:24,433 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-05-23 09:22:24,433 INFO L146 ILogger]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 127 [2019-05-23 09:22:24,433 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:24,433 INFO L146 ILogger]: Abstraction has 133 states and 133 transitions. [2019-05-23 09:22:24,433 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:22:24,433 INFO L146 ILogger]: Start isEmpty. Operand 133 states and 133 transitions. [2019-05-23 09:22:24,434 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 133 [2019-05-23 09:22:24,434 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:24,434 INFO L146 ILogger]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:24,434 INFO L146 ILogger]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:24,435 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:24,435 INFO L146 ILogger]: Analyzing trace with hash 1751509266, now seen corresponding path program 24 times [2019-05-23 09:22:24,435 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:24,450 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,452 INFO L146 ILogger]: Trace formula consists of 186 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,454 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,177 INFO L146 ILogger]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:25,178 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,178 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:22:25,178 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:22:25,179 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:22:25,179 INFO L146 ILogger]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:25,179 INFO L146 ILogger]: Start difference. First operand 133 states and 133 transitions. Second operand 51 states. [2019-05-23 09:22:26,760 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:26,760 INFO L146 ILogger]: Finished difference Result 141 states and 141 transitions. [2019-05-23 09:22:26,761 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:22:26,761 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 132 [2019-05-23 09:22:26,762 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:26,762 INFO L146 ILogger]: With dead ends: 141 [2019-05-23 09:22:26,762 INFO L146 ILogger]: Without dead ends: 141 [2019-05-23 09:22:26,764 INFO L146 ILogger]: 0 DeclaredPredicates, 179 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:22:26,764 INFO L146 ILogger]: Start minimizeSevpa. Operand 141 states. [2019-05-23 09:22:26,766 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 141 to 138. [2019-05-23 09:22:26,766 INFO L146 ILogger]: Start removeUnreachable. Operand 138 states. [2019-05-23 09:22:26,767 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-05-23 09:22:26,767 INFO L146 ILogger]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 132 [2019-05-23 09:22:26,767 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:26,767 INFO L146 ILogger]: Abstraction has 138 states and 138 transitions. [2019-05-23 09:22:26,768 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:22:26,768 INFO L146 ILogger]: Start isEmpty. Operand 138 states and 138 transitions. [2019-05-23 09:22:26,768 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 138 [2019-05-23 09:22:26,768 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:26,769 INFO L146 ILogger]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:26,769 INFO L146 ILogger]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:26,769 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:26,769 INFO L146 ILogger]: Analyzing trace with hash -2056777758, now seen corresponding path program 25 times [2019-05-23 09:22:26,770 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:26,786 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:26,788 INFO L146 ILogger]: Trace formula consists of 193 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:22:26,790 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:27,557 INFO L146 ILogger]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:27,558 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:27,558 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:22:27,558 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:22:27,559 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:22:27,559 INFO L146 ILogger]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:27,559 INFO L146 ILogger]: Start difference. First operand 138 states and 138 transitions. Second operand 53 states. [2019-05-23 09:22:29,071 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:29,071 INFO L146 ILogger]: Finished difference Result 146 states and 146 transitions. [2019-05-23 09:22:29,072 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:22:29,072 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 137 [2019-05-23 09:22:29,072 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:29,073 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:22:29,073 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:22:29,075 INFO L146 ILogger]: 0 DeclaredPredicates, 186 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:22:29,075 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:22:29,077 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-05-23 09:22:29,077 INFO L146 ILogger]: Start removeUnreachable. Operand 143 states. [2019-05-23 09:22:29,078 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-05-23 09:22:29,078 INFO L146 ILogger]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 137 [2019-05-23 09:22:29,078 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:29,079 INFO L146 ILogger]: Abstraction has 143 states and 143 transitions. [2019-05-23 09:22:29,079 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:22:29,079 INFO L146 ILogger]: Start isEmpty. Operand 143 states and 143 transitions. [2019-05-23 09:22:29,079 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 143 [2019-05-23 09:22:29,080 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:29,080 INFO L146 ILogger]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:29,080 INFO L146 ILogger]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:29,080 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:29,080 INFO L146 ILogger]: Analyzing trace with hash 1958587154, now seen corresponding path program 26 times [2019-05-23 09:22:29,081 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:29,095 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:29,098 INFO L146 ILogger]: Trace formula consists of 200 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:29,100 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:30,218 INFO L146 ILogger]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:30,218 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,218 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:22:30,218 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:22:30,219 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:22:30,219 INFO L146 ILogger]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:30,219 INFO L146 ILogger]: Start difference. First operand 143 states and 143 transitions. Second operand 55 states. [2019-05-23 09:22:32,252 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,253 INFO L146 ILogger]: Finished difference Result 151 states and 151 transitions. [2019-05-23 09:22:32,253 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:22:32,253 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 142 [2019-05-23 09:22:32,254 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,255 INFO L146 ILogger]: With dead ends: 151 [2019-05-23 09:22:32,255 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 09:22:32,256 INFO L146 ILogger]: 0 DeclaredPredicates, 193 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:22:32,257 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 09:22:32,259 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-05-23 09:22:32,259 INFO L146 ILogger]: Start removeUnreachable. Operand 148 states. [2019-05-23 09:22:32,259 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-05-23 09:22:32,259 INFO L146 ILogger]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 142 [2019-05-23 09:22:32,259 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,260 INFO L146 ILogger]: Abstraction has 148 states and 148 transitions. [2019-05-23 09:22:32,260 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:22:32,260 INFO L146 ILogger]: Start isEmpty. Operand 148 states and 148 transitions. [2019-05-23 09:22:32,260 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 148 [2019-05-23 09:22:32,260 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,260 INFO L146 ILogger]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:32,261 INFO L146 ILogger]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,261 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,261 INFO L146 ILogger]: Analyzing trace with hash -1550217758, now seen corresponding path program 27 times [2019-05-23 09:22:32,261 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,280 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,282 INFO L146 ILogger]: Trace formula consists of 207 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,285 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,395 INFO L146 ILogger]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:33,395 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,395 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:22:33,396 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:22:33,396 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:22:33,396 INFO L146 ILogger]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:33,396 INFO L146 ILogger]: Start difference. First operand 148 states and 148 transitions. Second operand 57 states. [2019-05-23 09:22:35,021 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:35,022 INFO L146 ILogger]: Finished difference Result 156 states and 156 transitions. [2019-05-23 09:22:35,025 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:22:35,025 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 147 [2019-05-23 09:22:35,026 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:35,027 INFO L146 ILogger]: With dead ends: 156 [2019-05-23 09:22:35,027 INFO L146 ILogger]: Without dead ends: 156 [2019-05-23 09:22:35,027 INFO L146 ILogger]: 0 DeclaredPredicates, 200 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:22:35,028 INFO L146 ILogger]: Start minimizeSevpa. Operand 156 states. [2019-05-23 09:22:35,029 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 156 to 153. [2019-05-23 09:22:35,030 INFO L146 ILogger]: Start removeUnreachable. Operand 153 states. [2019-05-23 09:22:35,030 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-05-23 09:22:35,030 INFO L146 ILogger]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 147 [2019-05-23 09:22:35,030 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:35,031 INFO L146 ILogger]: Abstraction has 153 states and 153 transitions. [2019-05-23 09:22:35,031 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:22:35,031 INFO L146 ILogger]: Start isEmpty. Operand 153 states and 153 transitions. [2019-05-23 09:22:35,031 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 153 [2019-05-23 09:22:35,031 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:35,031 INFO L146 ILogger]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:35,032 INFO L146 ILogger]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:35,032 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:35,032 INFO L146 ILogger]: Analyzing trace with hash -1882526446, now seen corresponding path program 28 times [2019-05-23 09:22:35,032 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:35,048 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:35,051 INFO L146 ILogger]: Trace formula consists of 214 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:35,053 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:37,326 INFO L146 ILogger]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:37,326 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:37,327 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:22:37,327 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:22:37,327 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:22:37,327 INFO L146 ILogger]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:37,328 INFO L146 ILogger]: Start difference. First operand 153 states and 153 transitions. Second operand 59 states. [2019-05-23 09:22:39,080 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:39,081 INFO L146 ILogger]: Finished difference Result 161 states and 161 transitions. [2019-05-23 09:22:39,081 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:22:39,081 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 152 [2019-05-23 09:22:39,082 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:39,082 INFO L146 ILogger]: With dead ends: 161 [2019-05-23 09:22:39,083 INFO L146 ILogger]: Without dead ends: 161 [2019-05-23 09:22:39,084 INFO L146 ILogger]: 0 DeclaredPredicates, 207 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:22:39,084 INFO L146 ILogger]: Start minimizeSevpa. Operand 161 states. [2019-05-23 09:22:39,086 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 161 to 158. [2019-05-23 09:22:39,086 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:22:39,087 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-05-23 09:22:39,087 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 152 [2019-05-23 09:22:39,087 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:39,087 INFO L146 ILogger]: Abstraction has 158 states and 158 transitions. [2019-05-23 09:22:39,088 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:22:39,088 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 158 transitions. [2019-05-23 09:22:39,088 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:22:39,088 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:39,089 INFO L146 ILogger]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:39,089 INFO L146 ILogger]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:39,089 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:39,089 INFO L146 ILogger]: Analyzing trace with hash 142969826, now seen corresponding path program 29 times [2019-05-23 09:22:39,090 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:39,104 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:39,107 INFO L146 ILogger]: Trace formula consists of 221 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:22:39,109 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:40,243 INFO L146 ILogger]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:40,244 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:40,244 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:22:40,244 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:22:40,245 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:22:40,245 INFO L146 ILogger]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:22:40,245 INFO L146 ILogger]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2019-05-23 09:22:42,285 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:42,286 INFO L146 ILogger]: Finished difference Result 166 states and 166 transitions. [2019-05-23 09:22:42,286 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:22:42,286 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 157 [2019-05-23 09:22:42,287 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:42,288 INFO L146 ILogger]: With dead ends: 166 [2019-05-23 09:22:42,288 INFO L146 ILogger]: Without dead ends: 166 [2019-05-23 09:22:42,289 INFO L146 ILogger]: 0 DeclaredPredicates, 214 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:22:42,289 INFO L146 ILogger]: Start minimizeSevpa. Operand 166 states. [2019-05-23 09:22:42,291 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 166 to 163. [2019-05-23 09:22:42,291 INFO L146 ILogger]: Start removeUnreachable. Operand 163 states. [2019-05-23 09:22:42,292 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-05-23 09:22:42,292 INFO L146 ILogger]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 157 [2019-05-23 09:22:42,292 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:42,293 INFO L146 ILogger]: Abstraction has 163 states and 163 transitions. [2019-05-23 09:22:42,293 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:22:42,293 INFO L146 ILogger]: Start isEmpty. Operand 163 states and 163 transitions. [2019-05-23 09:22:42,293 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 09:22:42,294 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:42,294 INFO L146 ILogger]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:42,294 INFO L146 ILogger]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:42,294 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:42,294 INFO L146 ILogger]: Analyzing trace with hash -189944046, now seen corresponding path program 30 times [2019-05-23 09:22:42,295 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:42,310 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:42,312 INFO L146 ILogger]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:22:42,315 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:43,484 INFO L146 ILogger]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:43,484 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:43,484 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:22:43,484 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:22:43,485 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:22:43,485 INFO L146 ILogger]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:22:43,485 INFO L146 ILogger]: Start difference. First operand 163 states and 163 transitions. Second operand 63 states. [2019-05-23 09:22:45,475 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:45,476 INFO L146 ILogger]: Finished difference Result 171 states and 171 transitions. [2019-05-23 09:22:45,476 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:22:45,476 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 162 [2019-05-23 09:22:45,477 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:45,478 INFO L146 ILogger]: With dead ends: 171 [2019-05-23 09:22:45,478 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:22:45,480 INFO L146 ILogger]: 0 DeclaredPredicates, 221 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:22:45,480 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:22:45,482 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 168. [2019-05-23 09:22:45,482 INFO L146 ILogger]: Start removeUnreachable. Operand 168 states. [2019-05-23 09:22:45,483 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-05-23 09:22:45,483 INFO L146 ILogger]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 162 [2019-05-23 09:22:45,483 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:45,483 INFO L146 ILogger]: Abstraction has 168 states and 168 transitions. [2019-05-23 09:22:45,483 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:22:45,484 INFO L146 ILogger]: Start isEmpty. Operand 168 states and 168 transitions. [2019-05-23 09:22:45,484 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 168 [2019-05-23 09:22:45,484 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:45,485 INFO L146 ILogger]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:45,485 INFO L146 ILogger]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:45,485 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:45,485 INFO L146 ILogger]: Analyzing trace with hash 1829505506, now seen corresponding path program 31 times [2019-05-23 09:22:45,486 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:45,501 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:45,503 INFO L146 ILogger]: Trace formula consists of 235 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:22:45,506 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:47,762 INFO L146 ILogger]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:47,762 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:47,763 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:22:47,763 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:22:47,763 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:22:47,764 INFO L146 ILogger]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:22:47,764 INFO L146 ILogger]: Start difference. First operand 168 states and 168 transitions. Second operand 65 states. [2019-05-23 09:22:49,838 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:49,839 INFO L146 ILogger]: Finished difference Result 176 states and 176 transitions. [2019-05-23 09:22:49,840 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:22:49,840 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 167 [2019-05-23 09:22:49,840 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:49,841 INFO L146 ILogger]: With dead ends: 176 [2019-05-23 09:22:49,842 INFO L146 ILogger]: Without dead ends: 176 [2019-05-23 09:22:49,843 INFO L146 ILogger]: 0 DeclaredPredicates, 228 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:22:49,843 INFO L146 ILogger]: Start minimizeSevpa. Operand 176 states. [2019-05-23 09:22:49,845 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 176 to 173. [2019-05-23 09:22:49,845 INFO L146 ILogger]: Start removeUnreachable. Operand 173 states. [2019-05-23 09:22:49,846 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-05-23 09:22:49,846 INFO L146 ILogger]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 167 [2019-05-23 09:22:49,846 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:49,846 INFO L146 ILogger]: Abstraction has 173 states and 173 transitions. [2019-05-23 09:22:49,847 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:22:49,847 INFO L146 ILogger]: Start isEmpty. Operand 173 states and 173 transitions. [2019-05-23 09:22:49,847 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 173 [2019-05-23 09:22:49,848 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:49,848 INFO L146 ILogger]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:49,848 INFO L146 ILogger]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:49,848 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:49,848 INFO L146 ILogger]: Analyzing trace with hash 1988489490, now seen corresponding path program 32 times [2019-05-23 09:22:49,849 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:49,864 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:49,867 INFO L146 ILogger]: Trace formula consists of 242 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:22:49,869 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:51,149 INFO L146 ILogger]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:51,150 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:51,150 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:22:51,150 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:22:51,151 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:22:51,151 INFO L146 ILogger]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:22:51,151 INFO L146 ILogger]: Start difference. First operand 173 states and 173 transitions. Second operand 67 states. [2019-05-23 09:22:54,371 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:54,371 INFO L146 ILogger]: Finished difference Result 181 states and 181 transitions. [2019-05-23 09:22:54,372 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:22:54,372 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 172 [2019-05-23 09:22:54,372 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:54,373 INFO L146 ILogger]: With dead ends: 181 [2019-05-23 09:22:54,373 INFO L146 ILogger]: Without dead ends: 181 [2019-05-23 09:22:54,377 INFO L146 ILogger]: 0 DeclaredPredicates, 235 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:22:54,377 INFO L146 ILogger]: Start minimizeSevpa. Operand 181 states. [2019-05-23 09:22:54,381 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 181 to 178. [2019-05-23 09:22:54,382 INFO L146 ILogger]: Start removeUnreachable. Operand 178 states. [2019-05-23 09:22:54,382 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-05-23 09:22:54,382 INFO L146 ILogger]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 172 [2019-05-23 09:22:54,383 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:54,383 INFO L146 ILogger]: Abstraction has 178 states and 178 transitions. [2019-05-23 09:22:54,383 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:22:54,383 INFO L146 ILogger]: Start isEmpty. Operand 178 states and 178 transitions. [2019-05-23 09:22:54,384 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 178 [2019-05-23 09:22:54,384 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:54,384 INFO L146 ILogger]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:54,384 INFO L146 ILogger]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:54,385 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:54,387 INFO L146 ILogger]: Analyzing trace with hash -234027038, now seen corresponding path program 33 times [2019-05-23 09:22:54,387 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:54,403 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:54,405 INFO L146 ILogger]: Trace formula consists of 249 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:22:54,408 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:55,739 INFO L146 ILogger]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:55,740 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:55,740 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:22:55,740 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:22:55,740 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:22:55,741 INFO L146 ILogger]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:22:55,741 INFO L146 ILogger]: Start difference. First operand 178 states and 178 transitions. Second operand 69 states. [2019-05-23 09:22:58,479 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:58,480 INFO L146 ILogger]: Finished difference Result 186 states and 186 transitions. [2019-05-23 09:22:58,480 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:22:58,480 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 177 [2019-05-23 09:22:58,481 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:58,482 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 09:22:58,482 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 09:22:58,483 INFO L146 ILogger]: 0 DeclaredPredicates, 242 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:22:58,483 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 09:22:58,486 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 183. [2019-05-23 09:22:58,486 INFO L146 ILogger]: Start removeUnreachable. Operand 183 states. [2019-05-23 09:22:58,487 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-05-23 09:22:58,487 INFO L146 ILogger]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 177 [2019-05-23 09:22:58,487 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:58,487 INFO L146 ILogger]: Abstraction has 183 states and 183 transitions. [2019-05-23 09:22:58,487 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:22:58,488 INFO L146 ILogger]: Start isEmpty. Operand 183 states and 183 transitions. [2019-05-23 09:22:58,488 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 09:22:58,488 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:58,489 INFO L146 ILogger]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:58,489 INFO L146 ILogger]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:58,489 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:58,489 INFO L146 ILogger]: Analyzing trace with hash -2139901166, now seen corresponding path program 34 times [2019-05-23 09:22:58,490 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:58,505 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:58,508 INFO L146 ILogger]: Trace formula consists of 256 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:22:58,511 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:59,999 INFO L146 ILogger]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:59,999 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:00,000 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:23:00,000 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:23:00,000 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:23:00,001 INFO L146 ILogger]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:00,001 INFO L146 ILogger]: Start difference. First operand 183 states and 183 transitions. Second operand 71 states. [2019-05-23 09:23:02,615 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:02,615 INFO L146 ILogger]: Finished difference Result 191 states and 191 transitions. [2019-05-23 09:23:02,616 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:23:02,616 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 182 [2019-05-23 09:23:02,616 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:02,617 INFO L146 ILogger]: With dead ends: 191 [2019-05-23 09:23:02,617 INFO L146 ILogger]: Without dead ends: 191 [2019-05-23 09:23:02,618 INFO L146 ILogger]: 0 DeclaredPredicates, 249 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:23:02,619 INFO L146 ILogger]: Start minimizeSevpa. Operand 191 states. [2019-05-23 09:23:02,621 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-05-23 09:23:02,621 INFO L146 ILogger]: Start removeUnreachable. Operand 188 states. [2019-05-23 09:23:02,621 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-05-23 09:23:02,622 INFO L146 ILogger]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 182 [2019-05-23 09:23:02,622 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:02,622 INFO L146 ILogger]: Abstraction has 188 states and 188 transitions. [2019-05-23 09:23:02,622 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:23:02,622 INFO L146 ILogger]: Start isEmpty. Operand 188 states and 188 transitions. [2019-05-23 09:23:02,623 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 188 [2019-05-23 09:23:02,623 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:02,623 INFO L146 ILogger]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:02,623 INFO L146 ILogger]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:02,624 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:02,624 INFO L146 ILogger]: Analyzing trace with hash 543720930, now seen corresponding path program 35 times [2019-05-23 09:23:02,624 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:02,641 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:02,644 INFO L146 ILogger]: Trace formula consists of 263 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:23:02,647 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:04,311 INFO L146 ILogger]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:04,311 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:04,311 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:23:04,311 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:23:04,312 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:23:04,312 INFO L146 ILogger]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:04,312 INFO L146 ILogger]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2019-05-23 09:23:06,861 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:06,861 INFO L146 ILogger]: Finished difference Result 196 states and 196 transitions. [2019-05-23 09:23:06,862 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:23:06,862 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 187 [2019-05-23 09:23:06,862 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:06,863 INFO L146 ILogger]: With dead ends: 196 [2019-05-23 09:23:06,863 INFO L146 ILogger]: Without dead ends: 196 [2019-05-23 09:23:06,865 INFO L146 ILogger]: 0 DeclaredPredicates, 256 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:23:06,865 INFO L146 ILogger]: Start minimizeSevpa. Operand 196 states. [2019-05-23 09:23:06,868 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 196 to 193. [2019-05-23 09:23:06,868 INFO L146 ILogger]: Start removeUnreachable. Operand 193 states. [2019-05-23 09:23:06,869 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-05-23 09:23:06,869 INFO L146 ILogger]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 187 [2019-05-23 09:23:06,869 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:06,869 INFO L146 ILogger]: Abstraction has 193 states and 193 transitions. [2019-05-23 09:23:06,869 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:23:06,869 INFO L146 ILogger]: Start isEmpty. Operand 193 states and 193 transitions. [2019-05-23 09:23:06,870 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 193 [2019-05-23 09:23:06,870 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:06,870 INFO L146 ILogger]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:06,871 INFO L146 ILogger]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:06,871 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:06,871 INFO L146 ILogger]: Analyzing trace with hash 362214674, now seen corresponding path program 36 times [2019-05-23 09:23:06,872 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:06,891 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:06,894 INFO L146 ILogger]: Trace formula consists of 270 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:23:06,897 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:08,887 INFO L146 ILogger]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:08,887 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:08,887 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:23:08,888 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:23:08,888 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:23:08,889 INFO L146 ILogger]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:08,889 INFO L146 ILogger]: Start difference. First operand 193 states and 193 transitions. Second operand 75 states. [2019-05-23 09:23:11,647 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:11,647 INFO L146 ILogger]: Finished difference Result 201 states and 201 transitions. [2019-05-23 09:23:11,648 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 09:23:11,648 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 192 [2019-05-23 09:23:11,648 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:11,649 INFO L146 ILogger]: With dead ends: 201 [2019-05-23 09:23:11,650 INFO L146 ILogger]: Without dead ends: 201 [2019-05-23 09:23:11,651 INFO L146 ILogger]: 0 DeclaredPredicates, 263 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:23:11,651 INFO L146 ILogger]: Start minimizeSevpa. Operand 201 states. [2019-05-23 09:23:11,653 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 201 to 198. [2019-05-23 09:23:11,653 INFO L146 ILogger]: Start removeUnreachable. Operand 198 states. [2019-05-23 09:23:11,654 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-05-23 09:23:11,654 INFO L146 ILogger]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 192 [2019-05-23 09:23:11,654 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:11,655 INFO L146 ILogger]: Abstraction has 198 states and 198 transitions. [2019-05-23 09:23:11,655 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:23:11,655 INFO L146 ILogger]: Start isEmpty. Operand 198 states and 198 transitions. [2019-05-23 09:23:11,656 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 198 [2019-05-23 09:23:11,656 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:11,656 INFO L146 ILogger]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:11,656 INFO L146 ILogger]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:11,656 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:11,657 INFO L146 ILogger]: Analyzing trace with hash -385973278, now seen corresponding path program 37 times [2019-05-23 09:23:11,657 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:11,675 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:11,678 INFO L146 ILogger]: Trace formula consists of 277 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:23:11,681 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:13,627 INFO L146 ILogger]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:13,627 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:13,628 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:23:13,628 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:23:13,628 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:23:13,629 INFO L146 ILogger]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:13,629 INFO L146 ILogger]: Start difference. First operand 198 states and 198 transitions. Second operand 77 states. [2019-05-23 09:23:16,437 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:16,437 INFO L146 ILogger]: Finished difference Result 206 states and 206 transitions. [2019-05-23 09:23:16,438 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:23:16,438 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 197 [2019-05-23 09:23:16,438 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:16,439 INFO L146 ILogger]: With dead ends: 206 [2019-05-23 09:23:16,439 INFO L146 ILogger]: Without dead ends: 206 [2019-05-23 09:23:16,441 INFO L146 ILogger]: 0 DeclaredPredicates, 270 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:23:16,441 INFO L146 ILogger]: Start minimizeSevpa. Operand 206 states. [2019-05-23 09:23:16,444 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 206 to 203. [2019-05-23 09:23:16,444 INFO L146 ILogger]: Start removeUnreachable. Operand 203 states. [2019-05-23 09:23:16,444 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-05-23 09:23:16,445 INFO L146 ILogger]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 197 [2019-05-23 09:23:16,445 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:16,445 INFO L146 ILogger]: Abstraction has 203 states and 203 transitions. [2019-05-23 09:23:16,445 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:23:16,445 INFO L146 ILogger]: Start isEmpty. Operand 203 states and 203 transitions. [2019-05-23 09:23:16,446 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 203 [2019-05-23 09:23:16,446 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:16,446 INFO L146 ILogger]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:16,446 INFO L146 ILogger]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:16,446 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:16,446 INFO L146 ILogger]: Analyzing trace with hash -787499246, now seen corresponding path program 38 times [2019-05-23 09:23:16,447 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:16,464 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:16,468 INFO L146 ILogger]: Trace formula consists of 284 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:23:16,471 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:18,425 INFO L146 ILogger]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:18,425 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:18,425 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:23:18,426 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:23:18,426 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:23:18,426 INFO L146 ILogger]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:18,426 INFO L146 ILogger]: Start difference. First operand 203 states and 203 transitions. Second operand 79 states. [2019-05-23 09:23:21,375 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:21,375 INFO L146 ILogger]: Finished difference Result 211 states and 211 transitions. [2019-05-23 09:23:21,375 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 09:23:21,375 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 202 [2019-05-23 09:23:21,376 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:21,377 INFO L146 ILogger]: With dead ends: 211 [2019-05-23 09:23:21,377 INFO L146 ILogger]: Without dead ends: 211 [2019-05-23 09:23:21,379 INFO L146 ILogger]: 0 DeclaredPredicates, 277 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:23:21,379 INFO L146 ILogger]: Start minimizeSevpa. Operand 211 states. [2019-05-23 09:23:21,382 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 211 to 208. [2019-05-23 09:23:21,382 INFO L146 ILogger]: Start removeUnreachable. Operand 208 states. [2019-05-23 09:23:21,383 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-05-23 09:23:21,383 INFO L146 ILogger]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 202 [2019-05-23 09:23:21,383 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:21,383 INFO L146 ILogger]: Abstraction has 208 states and 208 transitions. [2019-05-23 09:23:21,383 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:23:21,383 INFO L146 ILogger]: Start isEmpty. Operand 208 states and 208 transitions. [2019-05-23 09:23:21,384 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 208 [2019-05-23 09:23:21,384 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:21,385 INFO L146 ILogger]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:21,385 INFO L146 ILogger]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:21,385 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:21,385 INFO L146 ILogger]: Analyzing trace with hash -1532034590, now seen corresponding path program 39 times [2019-05-23 09:23:21,386 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:21,405 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:21,408 INFO L146 ILogger]: Trace formula consists of 291 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:23:21,411 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:23,412 INFO L146 ILogger]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:23,412 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:23,413 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:23:23,413 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:23:23,413 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:23:23,414 INFO L146 ILogger]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:23,414 INFO L146 ILogger]: Start difference. First operand 208 states and 208 transitions. Second operand 81 states. [2019-05-23 09:23:26,491 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:26,492 INFO L146 ILogger]: Finished difference Result 216 states and 216 transitions. [2019-05-23 09:23:26,492 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:23:26,492 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 207 [2019-05-23 09:23:26,493 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:26,494 INFO L146 ILogger]: With dead ends: 216 [2019-05-23 09:23:26,494 INFO L146 ILogger]: Without dead ends: 216 [2019-05-23 09:23:26,495 INFO L146 ILogger]: 0 DeclaredPredicates, 284 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:23:26,496 INFO L146 ILogger]: Start minimizeSevpa. Operand 216 states. [2019-05-23 09:23:26,497 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 216 to 213. [2019-05-23 09:23:26,498 INFO L146 ILogger]: Start removeUnreachable. Operand 213 states. [2019-05-23 09:23:26,498 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-05-23 09:23:26,498 INFO L146 ILogger]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 207 [2019-05-23 09:23:26,498 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:26,498 INFO L146 ILogger]: Abstraction has 213 states and 213 transitions. [2019-05-23 09:23:26,498 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:23:26,498 INFO L146 ILogger]: Start isEmpty. Operand 213 states and 213 transitions. [2019-05-23 09:23:26,499 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 213 [2019-05-23 09:23:26,499 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:26,499 INFO L146 ILogger]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:26,500 INFO L146 ILogger]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:26,500 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:26,500 INFO L146 ILogger]: Analyzing trace with hash -436340462, now seen corresponding path program 40 times [2019-05-23 09:23:26,500 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:26,518 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:26,521 INFO L146 ILogger]: Trace formula consists of 298 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:23:26,525 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:28,928 INFO L146 ILogger]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:28,928 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:28,929 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:23:28,929 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:23:28,929 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:23:28,930 INFO L146 ILogger]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:28,930 INFO L146 ILogger]: Start difference. First operand 213 states and 213 transitions. Second operand 83 states. [2019-05-23 09:23:32,185 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:32,186 INFO L146 ILogger]: Finished difference Result 221 states and 221 transitions. [2019-05-23 09:23:32,186 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 09:23:32,186 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 212 [2019-05-23 09:23:32,187 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:32,188 INFO L146 ILogger]: With dead ends: 221 [2019-05-23 09:23:32,188 INFO L146 ILogger]: Without dead ends: 221 [2019-05-23 09:23:32,189 INFO L146 ILogger]: 0 DeclaredPredicates, 291 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:23:32,190 INFO L146 ILogger]: Start minimizeSevpa. Operand 221 states. [2019-05-23 09:23:32,192 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 221 to 218. [2019-05-23 09:23:32,192 INFO L146 ILogger]: Start removeUnreachable. Operand 218 states. [2019-05-23 09:23:32,192 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-05-23 09:23:32,192 INFO L146 ILogger]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 212 [2019-05-23 09:23:32,192 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:32,193 INFO L146 ILogger]: Abstraction has 218 states and 218 transitions. [2019-05-23 09:23:32,193 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:23:32,193 INFO L146 ILogger]: Start isEmpty. Operand 218 states and 218 transitions. [2019-05-23 09:23:32,193 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 218 [2019-05-23 09:23:32,193 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:32,194 INFO L146 ILogger]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:32,194 INFO L146 ILogger]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:32,194 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:32,194 INFO L146 ILogger]: Analyzing trace with hash 341442530, now seen corresponding path program 41 times [2019-05-23 09:23:32,195 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:32,214 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:32,217 INFO L146 ILogger]: Trace formula consists of 305 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:23:32,221 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:34,366 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:23:34,366 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:34,366 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:23:34,367 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:23:34,367 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:23:34,368 INFO L146 ILogger]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:23:34,368 INFO L146 ILogger]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2019-05-23 09:23:37,955 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:37,955 INFO L146 ILogger]: Finished difference Result 226 states and 226 transitions. [2019-05-23 09:23:37,956 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 09:23:37,956 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 217 [2019-05-23 09:23:37,956 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:37,957 INFO L146 ILogger]: With dead ends: 226 [2019-05-23 09:23:37,957 INFO L146 ILogger]: Without dead ends: 226 [2019-05-23 09:23:37,959 INFO L146 ILogger]: 0 DeclaredPredicates, 298 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:23:37,960 INFO L146 ILogger]: Start minimizeSevpa. Operand 226 states. [2019-05-23 09:23:37,962 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-05-23 09:23:37,962 INFO L146 ILogger]: Start removeUnreachable. Operand 223 states. [2019-05-23 09:23:37,962 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-05-23 09:23:37,962 INFO L146 ILogger]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 217 [2019-05-23 09:23:37,963 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:37,963 INFO L146 ILogger]: Abstraction has 223 states and 223 transitions. [2019-05-23 09:23:37,963 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:23:37,963 INFO L146 ILogger]: Start isEmpty. Operand 223 states and 223 transitions. [2019-05-23 09:23:37,964 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 223 [2019-05-23 09:23:37,964 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:37,964 INFO L146 ILogger]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:37,964 INFO L146 ILogger]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:37,965 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:37,965 INFO L146 ILogger]: Analyzing trace with hash 528595730, now seen corresponding path program 42 times [2019-05-23 09:23:37,965 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:37,985 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:37,988 INFO L146 ILogger]: Trace formula consists of 312 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:23:37,991 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:39,976 INFO L146 ILogger]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:39,977 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:39,977 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:23:39,977 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:23:39,978 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:23:39,978 INFO L146 ILogger]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:23:39,979 INFO L146 ILogger]: Start difference. First operand 223 states and 223 transitions. Second operand 87 states. [2019-05-23 09:23:44,498 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:44,498 INFO L146 ILogger]: Finished difference Result 231 states and 231 transitions. [2019-05-23 09:23:44,498 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 09:23:44,499 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 222 [2019-05-23 09:23:44,499 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:44,500 INFO L146 ILogger]: With dead ends: 231 [2019-05-23 09:23:44,500 INFO L146 ILogger]: Without dead ends: 231 [2019-05-23 09:23:44,502 INFO L146 ILogger]: 0 DeclaredPredicates, 305 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:23:44,503 INFO L146 ILogger]: Start minimizeSevpa. Operand 231 states. [2019-05-23 09:23:44,505 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 231 to 228. [2019-05-23 09:23:44,505 INFO L146 ILogger]: Start removeUnreachable. Operand 228 states. [2019-05-23 09:23:44,506 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2019-05-23 09:23:44,506 INFO L146 ILogger]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 222 [2019-05-23 09:23:44,506 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:44,506 INFO L146 ILogger]: Abstraction has 228 states and 228 transitions. [2019-05-23 09:23:44,506 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:23:44,506 INFO L146 ILogger]: Start isEmpty. Operand 228 states and 228 transitions. [2019-05-23 09:23:44,507 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 228 [2019-05-23 09:23:44,507 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:44,508 INFO L146 ILogger]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:44,508 INFO L146 ILogger]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:44,508 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:44,508 INFO L146 ILogger]: Analyzing trace with hash 1625259490, now seen corresponding path program 43 times [2019-05-23 09:23:44,509 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:44,529 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:44,533 INFO L146 ILogger]: Trace formula consists of 319 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:23:44,536 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:46,631 INFO L146 ILogger]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:46,631 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:46,631 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:23:46,632 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:23:46,632 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:23:46,632 INFO L146 ILogger]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:23:46,632 INFO L146 ILogger]: Start difference. First operand 228 states and 228 transitions. Second operand 89 states. [2019-05-23 09:23:50,666 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:50,666 INFO L146 ILogger]: Finished difference Result 236 states and 236 transitions. [2019-05-23 09:23:50,666 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 09:23:50,667 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 227 [2019-05-23 09:23:50,667 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:50,669 INFO L146 ILogger]: With dead ends: 236 [2019-05-23 09:23:50,669 INFO L146 ILogger]: Without dead ends: 236 [2019-05-23 09:23:50,670 INFO L146 ILogger]: 0 DeclaredPredicates, 312 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:23:50,671 INFO L146 ILogger]: Start minimizeSevpa. Operand 236 states. [2019-05-23 09:23:50,673 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 236 to 233. [2019-05-23 09:23:50,673 INFO L146 ILogger]: Start removeUnreachable. Operand 233 states. [2019-05-23 09:23:50,673 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-05-23 09:23:50,673 INFO L146 ILogger]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 227 [2019-05-23 09:23:50,674 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:50,674 INFO L146 ILogger]: Abstraction has 233 states and 233 transitions. [2019-05-23 09:23:50,674 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:23:50,674 INFO L146 ILogger]: Start isEmpty. Operand 233 states and 233 transitions. [2019-05-23 09:23:50,675 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 233 [2019-05-23 09:23:50,675 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:50,675 INFO L146 ILogger]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:50,676 INFO L146 ILogger]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:50,676 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:50,676 INFO L146 ILogger]: Analyzing trace with hash -524616430, now seen corresponding path program 44 times [2019-05-23 09:23:50,677 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:50,697 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:50,700 INFO L146 ILogger]: Trace formula consists of 326 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:23:50,704 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:52,994 INFO L146 ILogger]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:52,994 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:52,994 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:23:52,995 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:23:52,995 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:23:52,996 INFO L146 ILogger]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:23:52,996 INFO L146 ILogger]: Start difference. First operand 233 states and 233 transitions. Second operand 91 states. [2019-05-23 09:23:57,146 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:57,147 INFO L146 ILogger]: Finished difference Result 241 states and 241 transitions. [2019-05-23 09:23:57,147 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 09:23:57,147 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 232 [2019-05-23 09:23:57,148 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:57,149 INFO L146 ILogger]: With dead ends: 241 [2019-05-23 09:23:57,149 INFO L146 ILogger]: Without dead ends: 241 [2019-05-23 09:23:57,151 INFO L146 ILogger]: 0 DeclaredPredicates, 319 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:23:57,151 INFO L146 ILogger]: Start minimizeSevpa. Operand 241 states. [2019-05-23 09:23:57,154 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-05-23 09:23:57,154 INFO L146 ILogger]: Start removeUnreachable. Operand 238 states. [2019-05-23 09:23:57,155 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-05-23 09:23:57,155 INFO L146 ILogger]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 232 [2019-05-23 09:23:57,155 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:57,155 INFO L146 ILogger]: Abstraction has 238 states and 238 transitions. [2019-05-23 09:23:57,155 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:23:57,155 INFO L146 ILogger]: Start isEmpty. Operand 238 states and 238 transitions. [2019-05-23 09:23:57,156 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 238 [2019-05-23 09:23:57,157 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:57,157 INFO L146 ILogger]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:23:57,157 INFO L146 ILogger]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:57,157 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:57,157 INFO L146 ILogger]: Analyzing trace with hash 455048162, now seen corresponding path program 45 times [2019-05-23 09:23:57,158 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:57,178 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:57,182 INFO L146 ILogger]: Trace formula consists of 333 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:23:57,185 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:00,230 INFO L146 ILogger]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:00,231 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:00,231 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:24:00,231 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:24:00,232 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:24:00,232 INFO L146 ILogger]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:00,233 INFO L146 ILogger]: Start difference. First operand 238 states and 238 transitions. Second operand 93 states. [2019-05-23 09:24:04,570 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:04,571 INFO L146 ILogger]: Finished difference Result 246 states and 246 transitions. [2019-05-23 09:24:04,571 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 09:24:04,571 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 237 [2019-05-23 09:24:04,572 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:04,573 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 09:24:04,573 INFO L146 ILogger]: Without dead ends: 246 [2019-05-23 09:24:04,575 INFO L146 ILogger]: 0 DeclaredPredicates, 326 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 09:24:04,576 INFO L146 ILogger]: Start minimizeSevpa. Operand 246 states. [2019-05-23 09:24:04,578 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 246 to 243. [2019-05-23 09:24:04,578 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 09:24:04,578 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-05-23 09:24:04,579 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 237 [2019-05-23 09:24:04,579 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:04,579 INFO L146 ILogger]: Abstraction has 243 states and 243 transitions. [2019-05-23 09:24:04,579 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:24:04,579 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 243 transitions. [2019-05-23 09:24:04,580 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 243 [2019-05-23 09:24:04,580 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:04,580 INFO L146 ILogger]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:04,581 INFO L146 ILogger]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:04,581 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:04,581 INFO L146 ILogger]: Analyzing trace with hash 617201426, now seen corresponding path program 46 times [2019-05-23 09:24:04,582 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:04,602 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:04,606 INFO L146 ILogger]: Trace formula consists of 340 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:24:04,609 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:07,001 INFO L146 ILogger]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:07,001 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:07,001 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:24:07,002 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:24:07,002 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:24:07,003 INFO L146 ILogger]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:07,003 INFO L146 ILogger]: Start difference. First operand 243 states and 243 transitions. Second operand 95 states. [2019-05-23 09:24:11,573 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:11,573 INFO L146 ILogger]: Finished difference Result 251 states and 251 transitions. [2019-05-23 09:24:11,573 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 09:24:11,574 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 242 [2019-05-23 09:24:11,574 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:11,575 INFO L146 ILogger]: With dead ends: 251 [2019-05-23 09:24:11,575 INFO L146 ILogger]: Without dead ends: 251 [2019-05-23 09:24:11,577 INFO L146 ILogger]: 0 DeclaredPredicates, 333 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2019-05-23 09:24:11,577 INFO L146 ILogger]: Start minimizeSevpa. Operand 251 states. [2019-05-23 09:24:11,580 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 251 to 248. [2019-05-23 09:24:11,580 INFO L146 ILogger]: Start removeUnreachable. Operand 248 states. [2019-05-23 09:24:11,580 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2019-05-23 09:24:11,580 INFO L146 ILogger]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 242 [2019-05-23 09:24:11,581 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:11,581 INFO L146 ILogger]: Abstraction has 248 states and 248 transitions. [2019-05-23 09:24:11,581 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:24:11,581 INFO L146 ILogger]: Start isEmpty. Operand 248 states and 248 transitions. [2019-05-23 09:24:11,582 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 248 [2019-05-23 09:24:11,582 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:11,582 INFO L146 ILogger]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:11,582 INFO L146 ILogger]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:11,582 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:11,582 INFO L146 ILogger]: Analyzing trace with hash 1006238178, now seen corresponding path program 47 times [2019-05-23 09:24:11,583 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:11,605 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:11,608 INFO L146 ILogger]: Trace formula consists of 347 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:24:11,612 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:14,365 INFO L146 ILogger]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:14,365 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:14,365 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:24:14,366 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:24:14,366 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:24:14,367 INFO L146 ILogger]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:14,367 INFO L146 ILogger]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2019-05-23 09:24:19,003 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:19,004 INFO L146 ILogger]: Finished difference Result 256 states and 256 transitions. [2019-05-23 09:24:19,004 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 09:24:19,004 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 247 [2019-05-23 09:24:19,005 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:19,006 INFO L146 ILogger]: With dead ends: 256 [2019-05-23 09:24:19,006 INFO L146 ILogger]: Without dead ends: 256 [2019-05-23 09:24:19,007 INFO L146 ILogger]: 0 DeclaredPredicates, 340 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2019-05-23 09:24:19,007 INFO L146 ILogger]: Start minimizeSevpa. Operand 256 states. [2019-05-23 09:24:19,010 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 256 to 253. [2019-05-23 09:24:19,010 INFO L146 ILogger]: Start removeUnreachable. Operand 253 states. [2019-05-23 09:24:19,011 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-05-23 09:24:19,011 INFO L146 ILogger]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 247 [2019-05-23 09:24:19,011 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:19,011 INFO L146 ILogger]: Abstraction has 253 states and 253 transitions. [2019-05-23 09:24:19,011 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:24:19,012 INFO L146 ILogger]: Start isEmpty. Operand 253 states and 253 transitions. [2019-05-23 09:24:19,013 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 253 [2019-05-23 09:24:19,013 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:19,013 INFO L146 ILogger]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:19,013 INFO L146 ILogger]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:19,013 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:19,014 INFO L146 ILogger]: Analyzing trace with hash 2127429906, now seen corresponding path program 48 times [2019-05-23 09:24:19,014 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:19,035 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:19,039 INFO L146 ILogger]: Trace formula consists of 354 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:24:19,042 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:21,587 INFO L146 ILogger]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:21,587 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:21,587 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:24:21,588 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:24:21,588 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:24:21,589 INFO L146 ILogger]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:21,589 INFO L146 ILogger]: Start difference. First operand 253 states and 253 transitions. Second operand 99 states. [2019-05-23 09:24:26,415 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:26,416 INFO L146 ILogger]: Finished difference Result 261 states and 261 transitions. [2019-05-23 09:24:26,416 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 09:24:26,416 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 252 [2019-05-23 09:24:26,417 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:26,418 INFO L146 ILogger]: With dead ends: 261 [2019-05-23 09:24:26,418 INFO L146 ILogger]: Without dead ends: 261 [2019-05-23 09:24:26,420 INFO L146 ILogger]: 0 DeclaredPredicates, 347 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2019-05-23 09:24:26,420 INFO L146 ILogger]: Start minimizeSevpa. Operand 261 states. [2019-05-23 09:24:26,422 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 261 to 258. [2019-05-23 09:24:26,422 INFO L146 ILogger]: Start removeUnreachable. Operand 258 states. [2019-05-23 09:24:26,423 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2019-05-23 09:24:26,423 INFO L146 ILogger]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 252 [2019-05-23 09:24:26,423 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:26,423 INFO L146 ILogger]: Abstraction has 258 states and 258 transitions. [2019-05-23 09:24:26,423 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:24:26,424 INFO L146 ILogger]: Start isEmpty. Operand 258 states and 258 transitions. [2019-05-23 09:24:26,425 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 258 [2019-05-23 09:24:26,425 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:26,425 INFO L146 ILogger]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:26,425 INFO L146 ILogger]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:26,425 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:26,426 INFO L146 ILogger]: Analyzing trace with hash 609155042, now seen corresponding path program 49 times [2019-05-23 09:24:26,426 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:26,448 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:26,452 INFO L146 ILogger]: Trace formula consists of 361 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:24:26,456 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:30,729 INFO L146 ILogger]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:30,730 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:30,730 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:24:30,730 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:24:30,731 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:24:30,731 INFO L146 ILogger]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:24:30,732 INFO L146 ILogger]: Start difference. First operand 258 states and 258 transitions. Second operand 101 states. [2019-05-23 09:24:35,735 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:35,735 INFO L146 ILogger]: Finished difference Result 266 states and 266 transitions. [2019-05-23 09:24:35,736 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 09:24:35,736 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 257 [2019-05-23 09:24:35,736 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:35,738 INFO L146 ILogger]: With dead ends: 266 [2019-05-23 09:24:35,738 INFO L146 ILogger]: Without dead ends: 266 [2019-05-23 09:24:35,740 INFO L146 ILogger]: 0 DeclaredPredicates, 354 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2019-05-23 09:24:35,740 INFO L146 ILogger]: Start minimizeSevpa. Operand 266 states. [2019-05-23 09:24:35,742 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 266 to 263. [2019-05-23 09:24:35,742 INFO L146 ILogger]: Start removeUnreachable. Operand 263 states. [2019-05-23 09:24:35,743 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-05-23 09:24:35,743 INFO L146 ILogger]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 257 [2019-05-23 09:24:35,743 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:35,743 INFO L146 ILogger]: Abstraction has 263 states and 263 transitions. [2019-05-23 09:24:35,743 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:24:35,743 INFO L146 ILogger]: Start isEmpty. Operand 263 states and 263 transitions. [2019-05-23 09:24:35,744 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 263 [2019-05-23 09:24:35,744 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:35,744 INFO L146 ILogger]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:35,744 INFO L146 ILogger]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:35,745 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:35,745 INFO L146 ILogger]: Analyzing trace with hash 434619154, now seen corresponding path program 50 times [2019-05-23 09:24:35,745 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:35,769 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:35,773 INFO L146 ILogger]: Trace formula consists of 368 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:24:35,777 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:38,622 INFO L146 ILogger]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:38,622 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:38,622 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:24:38,623 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:24:38,624 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:24:38,625 INFO L146 ILogger]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:24:38,625 INFO L146 ILogger]: Start difference. First operand 263 states and 263 transitions. Second operand 103 states. [2019-05-23 09:24:43,821 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:43,821 INFO L146 ILogger]: Finished difference Result 271 states and 271 transitions. [2019-05-23 09:24:43,822 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 09:24:43,822 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 262 [2019-05-23 09:24:43,822 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:43,824 INFO L146 ILogger]: With dead ends: 271 [2019-05-23 09:24:43,824 INFO L146 ILogger]: Without dead ends: 271 [2019-05-23 09:24:43,826 INFO L146 ILogger]: 0 DeclaredPredicates, 361 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2019-05-23 09:24:43,826 INFO L146 ILogger]: Start minimizeSevpa. Operand 271 states. [2019-05-23 09:24:43,827 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-05-23 09:24:43,828 INFO L146 ILogger]: Start removeUnreachable. Operand 268 states. [2019-05-23 09:24:43,828 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-05-23 09:24:43,828 INFO L146 ILogger]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 262 [2019-05-23 09:24:43,828 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:43,828 INFO L146 ILogger]: Abstraction has 268 states and 268 transitions. [2019-05-23 09:24:43,828 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:24:43,828 INFO L146 ILogger]: Start isEmpty. Operand 268 states and 268 transitions. [2019-05-23 09:24:43,830 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 268 [2019-05-23 09:24:43,830 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:43,830 INFO L146 ILogger]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:43,830 INFO L146 ILogger]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:43,830 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:43,830 INFO L146 ILogger]: Analyzing trace with hash -1661045278, now seen corresponding path program 51 times [2019-05-23 09:24:43,831 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:43,853 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:43,857 INFO L146 ILogger]: Trace formula consists of 375 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:24:43,860 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:47,091 INFO L146 ILogger]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:47,092 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:47,092 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:24:47,092 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:24:47,093 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:24:47,093 INFO L146 ILogger]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:24:47,093 INFO L146 ILogger]: Start difference. First operand 268 states and 268 transitions. Second operand 105 states. [2019-05-23 09:24:52,430 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:52,431 INFO L146 ILogger]: Finished difference Result 276 states and 276 transitions. [2019-05-23 09:24:52,431 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 09:24:52,431 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 267 [2019-05-23 09:24:52,432 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:52,433 INFO L146 ILogger]: With dead ends: 276 [2019-05-23 09:24:52,433 INFO L146 ILogger]: Without dead ends: 276 [2019-05-23 09:24:52,435 INFO L146 ILogger]: 0 DeclaredPredicates, 368 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2019-05-23 09:24:52,435 INFO L146 ILogger]: Start minimizeSevpa. Operand 276 states. [2019-05-23 09:24:52,437 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 276 to 273. [2019-05-23 09:24:52,437 INFO L146 ILogger]: Start removeUnreachable. Operand 273 states. [2019-05-23 09:24:52,437 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-05-23 09:24:52,437 INFO L146 ILogger]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 267 [2019-05-23 09:24:52,438 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:52,438 INFO L146 ILogger]: Abstraction has 273 states and 273 transitions. [2019-05-23 09:24:52,438 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:24:52,438 INFO L146 ILogger]: Start isEmpty. Operand 273 states and 273 transitions. [2019-05-23 09:24:52,439 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 273 [2019-05-23 09:24:52,439 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:52,440 INFO L146 ILogger]: trace histogram [52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:24:52,440 INFO L146 ILogger]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:52,440 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:52,440 INFO L146 ILogger]: Analyzing trace with hash -1187576558, now seen corresponding path program 52 times [2019-05-23 09:24:52,441 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:52,462 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:52,466 INFO L146 ILogger]: Trace formula consists of 382 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:24:52,469 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:55,730 INFO L146 ILogger]: Checked inductivity of 6682 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:55,731 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:55,731 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:24:55,731 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 09:24:55,731 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 09:24:55,732 INFO L146 ILogger]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:24:55,732 INFO L146 ILogger]: Start difference. First operand 273 states and 273 transitions. Second operand 107 states. [2019-05-23 09:25:01,240 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:01,241 INFO L146 ILogger]: Finished difference Result 281 states and 281 transitions. [2019-05-23 09:25:01,241 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 09:25:01,241 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 272 [2019-05-23 09:25:01,242 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:01,243 INFO L146 ILogger]: With dead ends: 281 [2019-05-23 09:25:01,243 INFO L146 ILogger]: Without dead ends: 281 [2019-05-23 09:25:01,245 INFO L146 ILogger]: 0 DeclaredPredicates, 375 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2019-05-23 09:25:01,245 INFO L146 ILogger]: Start minimizeSevpa. Operand 281 states. [2019-05-23 09:25:01,248 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 281 to 278. [2019-05-23 09:25:01,248 INFO L146 ILogger]: Start removeUnreachable. Operand 278 states. [2019-05-23 09:25:01,248 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2019-05-23 09:25:01,248 INFO L146 ILogger]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 272 [2019-05-23 09:25:01,249 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:01,249 INFO L146 ILogger]: Abstraction has 278 states and 278 transitions. [2019-05-23 09:25:01,249 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 09:25:01,249 INFO L146 ILogger]: Start isEmpty. Operand 278 states and 278 transitions. [2019-05-23 09:25:01,250 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 278 [2019-05-23 09:25:01,250 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:01,251 INFO L146 ILogger]: trace histogram [53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:01,251 INFO L146 ILogger]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:01,251 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:01,251 INFO L146 ILogger]: Analyzing trace with hash -689409054, now seen corresponding path program 53 times [2019-05-23 09:25:01,252 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:01,286 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:01,291 INFO L146 ILogger]: Trace formula consists of 389 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:25:01,295 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:04,543 INFO L146 ILogger]: Checked inductivity of 6943 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:04,544 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:04,544 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:25:04,544 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 09:25:04,545 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 09:25:04,545 INFO L146 ILogger]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:25:04,545 INFO L146 ILogger]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2019-05-23 09:25:10,601 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:10,601 INFO L146 ILogger]: Finished difference Result 286 states and 286 transitions. [2019-05-23 09:25:10,601 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 09:25:10,601 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 277 [2019-05-23 09:25:10,602 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:10,603 INFO L146 ILogger]: With dead ends: 286 [2019-05-23 09:25:10,603 INFO L146 ILogger]: Without dead ends: 286 [2019-05-23 09:25:10,604 INFO L146 ILogger]: 0 DeclaredPredicates, 382 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2019-05-23 09:25:10,604 INFO L146 ILogger]: Start minimizeSevpa. Operand 286 states. [2019-05-23 09:25:10,606 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-05-23 09:25:10,606 INFO L146 ILogger]: Start removeUnreachable. Operand 283 states. [2019-05-23 09:25:10,606 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-05-23 09:25:10,606 INFO L146 ILogger]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 277 [2019-05-23 09:25:10,607 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:10,607 INFO L146 ILogger]: Abstraction has 283 states and 283 transitions. [2019-05-23 09:25:10,607 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 09:25:10,607 INFO L146 ILogger]: Start isEmpty. Operand 283 states and 283 transitions. [2019-05-23 09:25:10,608 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 283 [2019-05-23 09:25:10,608 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:10,608 INFO L146 ILogger]: trace histogram [54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:10,608 INFO L146 ILogger]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:10,608 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:10,609 INFO L146 ILogger]: Analyzing trace with hash -1210333422, now seen corresponding path program 54 times [2019-05-23 09:25:10,609 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:10,632 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:10,637 INFO L146 ILogger]: Trace formula consists of 396 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:25:10,640 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:13,865 INFO L146 ILogger]: Checked inductivity of 7209 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:13,866 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:13,866 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:25:13,866 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 09:25:13,866 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 09:25:13,867 INFO L146 ILogger]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:25:13,867 INFO L146 ILogger]: Start difference. First operand 283 states and 283 transitions. Second operand 111 states. [2019-05-23 09:25:19,760 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:19,760 INFO L146 ILogger]: Finished difference Result 291 states and 291 transitions. [2019-05-23 09:25:19,761 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 09:25:19,761 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 282 [2019-05-23 09:25:19,761 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:19,763 INFO L146 ILogger]: With dead ends: 291 [2019-05-23 09:25:19,763 INFO L146 ILogger]: Without dead ends: 291 [2019-05-23 09:25:19,765 INFO L146 ILogger]: 0 DeclaredPredicates, 389 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2019-05-23 09:25:19,766 INFO L146 ILogger]: Start minimizeSevpa. Operand 291 states. [2019-05-23 09:25:19,768 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 291 to 288. [2019-05-23 09:25:19,768 INFO L146 ILogger]: Start removeUnreachable. Operand 288 states. [2019-05-23 09:25:19,769 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2019-05-23 09:25:19,769 INFO L146 ILogger]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 282 [2019-05-23 09:25:19,769 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:19,769 INFO L146 ILogger]: Abstraction has 288 states and 288 transitions. [2019-05-23 09:25:19,769 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 09:25:19,769 INFO L146 ILogger]: Start isEmpty. Operand 288 states and 288 transitions. [2019-05-23 09:25:19,770 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 288 [2019-05-23 09:25:19,770 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:19,771 INFO L146 ILogger]: trace histogram [55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:19,771 INFO L146 ILogger]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:19,771 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:19,771 INFO L146 ILogger]: Analyzing trace with hash 1793913314, now seen corresponding path program 55 times [2019-05-23 09:25:19,772 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:19,794 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:19,799 INFO L146 ILogger]: Trace formula consists of 403 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:25:19,803 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:23,460 INFO L146 ILogger]: Checked inductivity of 7480 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:23,460 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:23,461 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:25:23,461 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 09:25:23,461 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 09:25:23,462 INFO L146 ILogger]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:25:23,462 INFO L146 ILogger]: Start difference. First operand 288 states and 288 transitions. Second operand 113 states. [2019-05-23 09:25:29,697 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:29,697 INFO L146 ILogger]: Finished difference Result 296 states and 296 transitions. [2019-05-23 09:25:29,698 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 09:25:29,698 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 287 [2019-05-23 09:25:29,698 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:29,699 INFO L146 ILogger]: With dead ends: 296 [2019-05-23 09:25:29,700 INFO L146 ILogger]: Without dead ends: 296 [2019-05-23 09:25:29,702 INFO L146 ILogger]: 0 DeclaredPredicates, 396 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2019-05-23 09:25:29,702 INFO L146 ILogger]: Start minimizeSevpa. Operand 296 states. [2019-05-23 09:25:29,704 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 296 to 293. [2019-05-23 09:25:29,704 INFO L146 ILogger]: Start removeUnreachable. Operand 293 states. [2019-05-23 09:25:29,704 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-05-23 09:25:29,705 INFO L146 ILogger]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 287 [2019-05-23 09:25:29,705 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:29,705 INFO L146 ILogger]: Abstraction has 293 states and 293 transitions. [2019-05-23 09:25:29,705 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 09:25:29,705 INFO L146 ILogger]: Start isEmpty. Operand 293 states and 293 transitions. [2019-05-23 09:25:29,706 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 293 [2019-05-23 09:25:29,707 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:29,707 INFO L146 ILogger]: trace histogram [56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:29,707 INFO L146 ILogger]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:29,707 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:29,707 INFO L146 ILogger]: Analyzing trace with hash 150341906, now seen corresponding path program 56 times [2019-05-23 09:25:29,708 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:29,732 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:29,737 INFO L146 ILogger]: Trace formula consists of 410 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:25:29,741 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:33,356 INFO L146 ILogger]: Checked inductivity of 7756 backedges. 0 proven. 7756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:33,357 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:33,357 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:25:33,357 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 09:25:33,358 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 09:25:33,358 INFO L146 ILogger]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:25:33,358 INFO L146 ILogger]: Start difference. First operand 293 states and 293 transitions. Second operand 115 states. [2019-05-23 09:25:39,597 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:39,597 INFO L146 ILogger]: Finished difference Result 301 states and 301 transitions. [2019-05-23 09:25:39,597 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 09:25:39,598 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 292 [2019-05-23 09:25:39,598 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:39,599 INFO L146 ILogger]: With dead ends: 301 [2019-05-23 09:25:39,600 INFO L146 ILogger]: Without dead ends: 301 [2019-05-23 09:25:39,602 INFO L146 ILogger]: 0 DeclaredPredicates, 403 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2019-05-23 09:25:39,602 INFO L146 ILogger]: Start minimizeSevpa. Operand 301 states. [2019-05-23 09:25:39,604 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 301 to 298. [2019-05-23 09:25:39,605 INFO L146 ILogger]: Start removeUnreachable. Operand 298 states. [2019-05-23 09:25:39,605 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-05-23 09:25:39,605 INFO L146 ILogger]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 292 [2019-05-23 09:25:39,605 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:39,606 INFO L146 ILogger]: Abstraction has 298 states and 298 transitions. [2019-05-23 09:25:39,606 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 09:25:39,606 INFO L146 ILogger]: Start isEmpty. Operand 298 states and 298 transitions. [2019-05-23 09:25:39,607 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 298 [2019-05-23 09:25:39,607 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:39,607 INFO L146 ILogger]: trace histogram [57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:39,608 INFO L146 ILogger]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:39,608 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:39,608 INFO L146 ILogger]: Analyzing trace with hash 1508634594, now seen corresponding path program 57 times [2019-05-23 09:25:39,609 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:39,632 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:39,637 INFO L146 ILogger]: Trace formula consists of 417 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:25:39,640 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:43,515 INFO L146 ILogger]: Checked inductivity of 8037 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:43,515 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:43,515 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:25:43,515 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 09:25:43,516 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 09:25:43,516 INFO L146 ILogger]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:25:43,516 INFO L146 ILogger]: Start difference. First operand 298 states and 298 transitions. Second operand 117 states. [2019-05-23 09:25:49,948 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:49,949 INFO L146 ILogger]: Finished difference Result 306 states and 306 transitions. [2019-05-23 09:25:49,949 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 09:25:49,949 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 297 [2019-05-23 09:25:49,949 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:49,951 INFO L146 ILogger]: With dead ends: 306 [2019-05-23 09:25:49,951 INFO L146 ILogger]: Without dead ends: 306 [2019-05-23 09:25:49,953 INFO L146 ILogger]: 0 DeclaredPredicates, 410 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2019-05-23 09:25:49,953 INFO L146 ILogger]: Start minimizeSevpa. Operand 306 states. [2019-05-23 09:25:49,955 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 306 to 303. [2019-05-23 09:25:49,955 INFO L146 ILogger]: Start removeUnreachable. Operand 303 states. [2019-05-23 09:25:49,956 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-05-23 09:25:49,956 INFO L146 ILogger]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 297 [2019-05-23 09:25:49,956 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:49,956 INFO L146 ILogger]: Abstraction has 303 states and 303 transitions. [2019-05-23 09:25:49,956 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 09:25:49,956 INFO L146 ILogger]: Start isEmpty. Operand 303 states and 303 transitions. [2019-05-23 09:25:49,958 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 303 [2019-05-23 09:25:49,958 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:49,958 INFO L146 ILogger]: trace histogram [58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:25:49,958 INFO L146 ILogger]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:49,958 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:49,959 INFO L146 ILogger]: Analyzing trace with hash 933612306, now seen corresponding path program 58 times [2019-05-23 09:25:49,959 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:49,984 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:49,989 INFO L146 ILogger]: Trace formula consists of 424 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:25:49,992 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:54,390 INFO L146 ILogger]: Checked inductivity of 8323 backedges. 0 proven. 8323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:54,390 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:54,391 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:25:54,391 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 09:25:54,391 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 09:25:54,392 INFO L146 ILogger]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:25:54,392 INFO L146 ILogger]: Start difference. First operand 303 states and 303 transitions. Second operand 119 states. [2019-05-23 09:26:00,878 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:00,879 INFO L146 ILogger]: Finished difference Result 311 states and 311 transitions. [2019-05-23 09:26:00,879 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-05-23 09:26:00,879 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 302 [2019-05-23 09:26:00,880 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:00,881 INFO L146 ILogger]: With dead ends: 311 [2019-05-23 09:26:00,881 INFO L146 ILogger]: Without dead ends: 311 [2019-05-23 09:26:00,883 INFO L146 ILogger]: 0 DeclaredPredicates, 417 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2019-05-23 09:26:00,884 INFO L146 ILogger]: Start minimizeSevpa. Operand 311 states. [2019-05-23 09:26:00,886 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 311 to 308. [2019-05-23 09:26:00,886 INFO L146 ILogger]: Start removeUnreachable. Operand 308 states. [2019-05-23 09:26:00,886 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2019-05-23 09:26:00,886 INFO L146 ILogger]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 302 [2019-05-23 09:26:00,886 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:00,886 INFO L146 ILogger]: Abstraction has 308 states and 308 transitions. [2019-05-23 09:26:00,887 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 09:26:00,887 INFO L146 ILogger]: Start isEmpty. Operand 308 states and 308 transitions. [2019-05-23 09:26:00,888 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 308 [2019-05-23 09:26:00,888 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:00,888 INFO L146 ILogger]: trace histogram [59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:00,888 INFO L146 ILogger]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:00,888 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:00,888 INFO L146 ILogger]: Analyzing trace with hash 214265314, now seen corresponding path program 59 times [2019-05-23 09:26:00,889 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:00,915 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:00,920 INFO L146 ILogger]: Trace formula consists of 431 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:26:00,923 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:04,931 INFO L146 ILogger]: Checked inductivity of 8614 backedges. 0 proven. 8614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:04,931 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:04,931 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:26:04,932 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 09:26:04,932 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 09:26:04,932 INFO L146 ILogger]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:26:04,933 INFO L146 ILogger]: Start difference. First operand 308 states and 308 transitions. Second operand 121 states. [2019-05-23 09:26:11,850 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:11,850 INFO L146 ILogger]: Finished difference Result 316 states and 316 transitions. [2019-05-23 09:26:11,851 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-05-23 09:26:11,851 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 307 [2019-05-23 09:26:11,851 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:11,852 INFO L146 ILogger]: With dead ends: 316 [2019-05-23 09:26:11,852 INFO L146 ILogger]: Without dead ends: 316 [2019-05-23 09:26:11,854 INFO L146 ILogger]: 0 DeclaredPredicates, 424 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2019-05-23 09:26:11,854 INFO L146 ILogger]: Start minimizeSevpa. Operand 316 states. [2019-05-23 09:26:11,856 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 316 to 313. [2019-05-23 09:26:11,856 INFO L146 ILogger]: Start removeUnreachable. Operand 313 states. [2019-05-23 09:26:11,856 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-05-23 09:26:11,856 INFO L146 ILogger]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 307 [2019-05-23 09:26:11,857 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:11,857 INFO L146 ILogger]: Abstraction has 313 states and 313 transitions. [2019-05-23 09:26:11,857 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 09:26:11,857 INFO L146 ILogger]: Start isEmpty. Operand 313 states and 313 transitions. [2019-05-23 09:26:11,858 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 313 [2019-05-23 09:26:11,859 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:11,859 INFO L146 ILogger]: trace histogram [60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:11,859 INFO L146 ILogger]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:11,859 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:11,859 INFO L146 ILogger]: Analyzing trace with hash 1728777490, now seen corresponding path program 60 times [2019-05-23 09:26:11,860 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:11,884 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:11,889 INFO L146 ILogger]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:26:11,893 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:15,909 INFO L146 ILogger]: Checked inductivity of 8910 backedges. 0 proven. 8910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:15,909 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:15,909 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 09:26:15,910 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 09:26:15,911 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 09:26:15,911 INFO L146 ILogger]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:26:15,911 INFO L146 ILogger]: Start difference. First operand 313 states and 313 transitions. Second operand 123 states. [2019-05-23 09:26:23,191 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:23,192 INFO L146 ILogger]: Finished difference Result 321 states and 321 transitions. [2019-05-23 09:26:23,192 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-05-23 09:26:23,192 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 312 [2019-05-23 09:26:23,193 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:23,194 INFO L146 ILogger]: With dead ends: 321 [2019-05-23 09:26:23,194 INFO L146 ILogger]: Without dead ends: 321 [2019-05-23 09:26:23,196 INFO L146 ILogger]: 0 DeclaredPredicates, 431 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2019-05-23 09:26:23,197 INFO L146 ILogger]: Start minimizeSevpa. Operand 321 states. [2019-05-23 09:26:23,200 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 321 to 318. [2019-05-23 09:26:23,200 INFO L146 ILogger]: Start removeUnreachable. Operand 318 states. [2019-05-23 09:26:23,200 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2019-05-23 09:26:23,201 INFO L146 ILogger]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 312 [2019-05-23 09:26:23,201 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:23,201 INFO L146 ILogger]: Abstraction has 318 states and 318 transitions. [2019-05-23 09:26:23,201 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 09:26:23,201 INFO L146 ILogger]: Start isEmpty. Operand 318 states and 318 transitions. [2019-05-23 09:26:23,203 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 318 [2019-05-23 09:26:23,203 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:23,203 INFO L146 ILogger]: trace histogram [61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:23,203 INFO L146 ILogger]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:23,203 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:23,204 INFO L146 ILogger]: Analyzing trace with hash 1415146466, now seen corresponding path program 61 times [2019-05-23 09:26:23,204 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:23,228 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:23,234 INFO L146 ILogger]: Trace formula consists of 445 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 09:26:23,237 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:27,406 INFO L146 ILogger]: Checked inductivity of 9211 backedges. 0 proven. 9211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:27,407 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:27,407 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 09:26:27,407 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 09:26:27,408 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 09:26:27,408 INFO L146 ILogger]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:26:27,408 INFO L146 ILogger]: Start difference. First operand 318 states and 318 transitions. Second operand 125 states. [2019-05-23 09:26:34,558 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:34,559 INFO L146 ILogger]: Finished difference Result 326 states and 326 transitions. [2019-05-23 09:26:34,559 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-05-23 09:26:34,559 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 317 [2019-05-23 09:26:34,559 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:34,561 INFO L146 ILogger]: With dead ends: 326 [2019-05-23 09:26:34,561 INFO L146 ILogger]: Without dead ends: 326 [2019-05-23 09:26:34,564 INFO L146 ILogger]: 0 DeclaredPredicates, 438 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2019-05-23 09:26:34,564 INFO L146 ILogger]: Start minimizeSevpa. Operand 326 states. [2019-05-23 09:26:34,566 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 326 to 323. [2019-05-23 09:26:34,566 INFO L146 ILogger]: Start removeUnreachable. Operand 323 states. [2019-05-23 09:26:34,567 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2019-05-23 09:26:34,567 INFO L146 ILogger]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 317 [2019-05-23 09:26:34,567 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:34,567 INFO L146 ILogger]: Abstraction has 323 states and 323 transitions. [2019-05-23 09:26:34,567 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 09:26:34,567 INFO L146 ILogger]: Start isEmpty. Operand 323 states and 323 transitions. [2019-05-23 09:26:34,568 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 323 [2019-05-23 09:26:34,568 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:34,568 INFO L146 ILogger]: trace histogram [62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:34,569 INFO L146 ILogger]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:34,569 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:34,569 INFO L146 ILogger]: Analyzing trace with hash 1380306706, now seen corresponding path program 62 times [2019-05-23 09:26:34,569 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:34,587 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:34,593 INFO L146 ILogger]: Trace formula consists of 452 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:26:34,595 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:38,851 INFO L146 ILogger]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:38,851 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:38,851 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 09:26:38,852 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 09:26:38,852 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 09:26:38,853 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:26:38,853 INFO L146 ILogger]: Start difference. First operand 323 states and 323 transitions. Second operand 127 states. [2019-05-23 09:26:46,218 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:46,218 INFO L146 ILogger]: Finished difference Result 331 states and 331 transitions. [2019-05-23 09:26:46,219 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-05-23 09:26:46,219 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 322 [2019-05-23 09:26:46,219 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:46,221 INFO L146 ILogger]: With dead ends: 331 [2019-05-23 09:26:46,221 INFO L146 ILogger]: Without dead ends: 331 [2019-05-23 09:26:46,224 INFO L146 ILogger]: 0 DeclaredPredicates, 445 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2019-05-23 09:26:46,224 INFO L146 ILogger]: Start minimizeSevpa. Operand 331 states. [2019-05-23 09:26:46,226 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 331 to 328. [2019-05-23 09:26:46,226 INFO L146 ILogger]: Start removeUnreachable. Operand 328 states. [2019-05-23 09:26:46,227 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2019-05-23 09:26:46,227 INFO L146 ILogger]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 322 [2019-05-23 09:26:46,227 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:46,227 INFO L146 ILogger]: Abstraction has 328 states and 328 transitions. [2019-05-23 09:26:46,227 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 09:26:46,227 INFO L146 ILogger]: Start isEmpty. Operand 328 states and 328 transitions. [2019-05-23 09:26:46,228 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 328 [2019-05-23 09:26:46,229 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:46,229 INFO L146 ILogger]: trace histogram [63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:46,229 INFO L146 ILogger]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:46,229 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:46,229 INFO L146 ILogger]: Analyzing trace with hash 1770514914, now seen corresponding path program 63 times [2019-05-23 09:26:46,230 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:46,256 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:46,262 INFO L146 ILogger]: Trace formula consists of 459 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 09:26:46,266 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:50,896 INFO L146 ILogger]: Checked inductivity of 9828 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:50,896 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:50,896 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 09:26:50,897 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 09:26:50,898 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 09:26:50,898 INFO L146 ILogger]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:26:50,898 INFO L146 ILogger]: Start difference. First operand 328 states and 328 transitions. Second operand 129 states. [2019-05-23 09:26:58,754 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:58,754 INFO L146 ILogger]: Finished difference Result 336 states and 336 transitions. [2019-05-23 09:26:58,754 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-05-23 09:26:58,754 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 327 [2019-05-23 09:26:58,755 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:58,756 INFO L146 ILogger]: With dead ends: 336 [2019-05-23 09:26:58,756 INFO L146 ILogger]: Without dead ends: 336 [2019-05-23 09:26:58,759 INFO L146 ILogger]: 0 DeclaredPredicates, 452 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2019-05-23 09:26:58,759 INFO L146 ILogger]: Start minimizeSevpa. Operand 336 states. [2019-05-23 09:26:58,761 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 336 to 333. [2019-05-23 09:26:58,761 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 09:26:58,761 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-05-23 09:26:58,762 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 327 [2019-05-23 09:26:58,762 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:58,762 INFO L146 ILogger]: Abstraction has 333 states and 333 transitions. [2019-05-23 09:26:58,762 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 09:26:58,762 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 333 transitions. [2019-05-23 09:26:58,764 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 333 [2019-05-23 09:26:58,764 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:58,764 INFO L146 ILogger]: trace histogram [64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:26:58,765 INFO L146 ILogger]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:58,765 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:58,765 INFO L146 ILogger]: Analyzing trace with hash 1282806034, now seen corresponding path program 64 times [2019-05-23 09:26:58,765 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:58,790 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:58,797 INFO L146 ILogger]: Trace formula consists of 466 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:26:58,800 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:03,640 INFO L146 ILogger]: Checked inductivity of 10144 backedges. 0 proven. 10144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:03,641 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:03,641 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 09:27:03,641 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 09:27:03,642 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 09:27:03,643 INFO L146 ILogger]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:27:03,643 INFO L146 ILogger]: Start difference. First operand 333 states and 333 transitions. Second operand 131 states. [2019-05-23 09:27:11,659 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:11,660 INFO L146 ILogger]: Finished difference Result 341 states and 341 transitions. [2019-05-23 09:27:11,660 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-05-23 09:27:11,660 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 332 [2019-05-23 09:27:11,661 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:11,662 INFO L146 ILogger]: With dead ends: 341 [2019-05-23 09:27:11,662 INFO L146 ILogger]: Without dead ends: 341 [2019-05-23 09:27:11,664 INFO L146 ILogger]: 0 DeclaredPredicates, 459 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2019-05-23 09:27:11,665 INFO L146 ILogger]: Start minimizeSevpa. Operand 341 states. [2019-05-23 09:27:11,666 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 341 to 338. [2019-05-23 09:27:11,667 INFO L146 ILogger]: Start removeUnreachable. Operand 338 states. [2019-05-23 09:27:11,667 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2019-05-23 09:27:11,667 INFO L146 ILogger]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 332 [2019-05-23 09:27:11,667 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:11,667 INFO L146 ILogger]: Abstraction has 338 states and 338 transitions. [2019-05-23 09:27:11,668 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 09:27:11,668 INFO L146 ILogger]: Start isEmpty. Operand 338 states and 338 transitions. [2019-05-23 09:27:11,669 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 338 [2019-05-23 09:27:11,669 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:11,669 INFO L146 ILogger]: trace histogram [65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:11,669 INFO L146 ILogger]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:11,669 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:11,669 INFO L146 ILogger]: Analyzing trace with hash -315562014, now seen corresponding path program 65 times [2019-05-23 09:27:11,670 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:11,696 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:11,702 INFO L146 ILogger]: Trace formula consists of 473 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:27:11,706 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:16,512 INFO L146 ILogger]: Checked inductivity of 10465 backedges. 0 proven. 10465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:16,512 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:16,512 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 09:27:16,513 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 09:27:16,513 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 09:27:16,514 INFO L146 ILogger]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:27:16,514 INFO L146 ILogger]: Start difference. First operand 338 states and 338 transitions. Second operand 133 states. [2019-05-23 09:27:24,860 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:24,860 INFO L146 ILogger]: Finished difference Result 346 states and 346 transitions. [2019-05-23 09:27:24,861 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2019-05-23 09:27:24,861 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 337 [2019-05-23 09:27:24,861 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:24,862 INFO L146 ILogger]: With dead ends: 346 [2019-05-23 09:27:24,863 INFO L146 ILogger]: Without dead ends: 346 [2019-05-23 09:27:24,864 INFO L146 ILogger]: 0 DeclaredPredicates, 466 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2019-05-23 09:27:24,865 INFO L146 ILogger]: Start minimizeSevpa. Operand 346 states. [2019-05-23 09:27:24,867 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 346 to 343. [2019-05-23 09:27:24,867 INFO L146 ILogger]: Start removeUnreachable. Operand 343 states. [2019-05-23 09:27:24,867 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-05-23 09:27:24,867 INFO L146 ILogger]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 337 [2019-05-23 09:27:24,868 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:24,868 INFO L146 ILogger]: Abstraction has 343 states and 343 transitions. [2019-05-23 09:27:24,868 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 09:27:24,868 INFO L146 ILogger]: Start isEmpty. Operand 343 states and 343 transitions. [2019-05-23 09:27:24,869 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 343 [2019-05-23 09:27:24,869 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:24,869 INFO L146 ILogger]: trace histogram [66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:24,869 INFO L146 ILogger]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:24,869 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:24,870 INFO L146 ILogger]: Analyzing trace with hash 1086051090, now seen corresponding path program 66 times [2019-05-23 09:27:24,870 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:24,899 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:24,905 INFO L146 ILogger]: Trace formula consists of 480 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:27:24,908 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:29,972 INFO L146 ILogger]: Checked inductivity of 10791 backedges. 0 proven. 10791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:29,972 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:29,972 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 09:27:29,973 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 09:27:29,973 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 09:27:29,974 INFO L146 ILogger]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:27:29,974 INFO L146 ILogger]: Start difference. First operand 343 states and 343 transitions. Second operand 135 states. [2019-05-23 09:27:38,269 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:38,270 INFO L146 ILogger]: Finished difference Result 351 states and 351 transitions. [2019-05-23 09:27:38,270 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-05-23 09:27:38,270 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 342 [2019-05-23 09:27:38,271 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:38,272 INFO L146 ILogger]: With dead ends: 351 [2019-05-23 09:27:38,273 INFO L146 ILogger]: Without dead ends: 351 [2019-05-23 09:27:38,276 INFO L146 ILogger]: 0 DeclaredPredicates, 473 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2019-05-23 09:27:38,276 INFO L146 ILogger]: Start minimizeSevpa. Operand 351 states. [2019-05-23 09:27:38,278 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 351 to 348. [2019-05-23 09:27:38,278 INFO L146 ILogger]: Start removeUnreachable. Operand 348 states. [2019-05-23 09:27:38,278 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2019-05-23 09:27:38,279 INFO L146 ILogger]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 342 [2019-05-23 09:27:38,279 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:38,279 INFO L146 ILogger]: Abstraction has 348 states and 348 transitions. [2019-05-23 09:27:38,279 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 09:27:38,279 INFO L146 ILogger]: Start isEmpty. Operand 348 states and 348 transitions. [2019-05-23 09:27:38,280 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 348 [2019-05-23 09:27:38,280 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:38,280 INFO L146 ILogger]: trace histogram [67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:38,281 INFO L146 ILogger]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:38,281 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:38,281 INFO L146 ILogger]: Analyzing trace with hash -399219230, now seen corresponding path program 67 times [2019-05-23 09:27:38,281 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:38,309 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:38,315 INFO L146 ILogger]: Trace formula consists of 487 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 09:27:38,319 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:43,430 INFO L146 ILogger]: Checked inductivity of 11122 backedges. 0 proven. 11122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:43,431 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:43,431 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 09:27:43,431 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 09:27:43,432 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 09:27:43,432 INFO L146 ILogger]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:27:43,432 INFO L146 ILogger]: Start difference. First operand 348 states and 348 transitions. Second operand 137 states. [2019-05-23 09:27:52,128 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:52,128 INFO L146 ILogger]: Finished difference Result 356 states and 356 transitions. [2019-05-23 09:27:52,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-05-23 09:27:52,128 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 347 [2019-05-23 09:27:52,129 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:52,130 INFO L146 ILogger]: With dead ends: 356 [2019-05-23 09:27:52,130 INFO L146 ILogger]: Without dead ends: 356 [2019-05-23 09:27:52,132 INFO L146 ILogger]: 0 DeclaredPredicates, 480 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2019-05-23 09:27:52,132 INFO L146 ILogger]: Start minimizeSevpa. Operand 356 states. [2019-05-23 09:27:52,134 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 356 to 353. [2019-05-23 09:27:52,134 INFO L146 ILogger]: Start removeUnreachable. Operand 353 states. [2019-05-23 09:27:52,134 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-05-23 09:27:52,134 INFO L146 ILogger]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 347 [2019-05-23 09:27:52,135 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:52,135 INFO L146 ILogger]: Abstraction has 353 states and 353 transitions. [2019-05-23 09:27:52,135 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 09:27:52,135 INFO L146 ILogger]: Start isEmpty. Operand 353 states and 353 transitions. [2019-05-23 09:27:52,136 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 353 [2019-05-23 09:27:52,136 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:52,136 INFO L146 ILogger]: trace histogram [68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:27:52,136 INFO L146 ILogger]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:52,137 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:52,137 INFO L146 ILogger]: Analyzing trace with hash -1305012974, now seen corresponding path program 68 times [2019-05-23 09:27:52,137 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:52,165 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:52,171 INFO L146 ILogger]: Trace formula consists of 494 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:27:52,175 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:57,273 INFO L146 ILogger]: Checked inductivity of 11458 backedges. 0 proven. 11458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:57,273 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:57,274 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 09:27:57,274 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 09:27:57,275 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 09:27:57,276 INFO L146 ILogger]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:27:57,276 INFO L146 ILogger]: Start difference. First operand 353 states and 353 transitions. Second operand 139 states. [2019-05-23 09:28:06,266 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:06,266 INFO L146 ILogger]: Finished difference Result 361 states and 361 transitions. [2019-05-23 09:28:06,267 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2019-05-23 09:28:06,267 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 352 [2019-05-23 09:28:06,267 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:06,269 INFO L146 ILogger]: With dead ends: 361 [2019-05-23 09:28:06,269 INFO L146 ILogger]: Without dead ends: 361 [2019-05-23 09:28:06,271 INFO L146 ILogger]: 0 DeclaredPredicates, 487 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2019-05-23 09:28:06,271 INFO L146 ILogger]: Start minimizeSevpa. Operand 361 states. [2019-05-23 09:28:06,273 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 361 to 358. [2019-05-23 09:28:06,273 INFO L146 ILogger]: Start removeUnreachable. Operand 358 states. [2019-05-23 09:28:06,274 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2019-05-23 09:28:06,274 INFO L146 ILogger]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 352 [2019-05-23 09:28:06,274 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:06,274 INFO L146 ILogger]: Abstraction has 358 states and 358 transitions. [2019-05-23 09:28:06,274 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 09:28:06,274 INFO L146 ILogger]: Start isEmpty. Operand 358 states and 358 transitions. [2019-05-23 09:28:06,275 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 358 [2019-05-23 09:28:06,275 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:06,276 INFO L146 ILogger]: trace histogram [69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:06,276 INFO L146 ILogger]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:06,276 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:06,276 INFO L146 ILogger]: Analyzing trace with hash -881695774, now seen corresponding path program 69 times [2019-05-23 09:28:06,277 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:06,304 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:06,311 INFO L146 ILogger]: Trace formula consists of 501 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 09:28:06,315 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:11,950 INFO L146 ILogger]: Checked inductivity of 11799 backedges. 0 proven. 11799 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:11,950 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:11,950 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 09:28:11,951 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 09:28:11,951 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 09:28:11,952 INFO L146 ILogger]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:28:11,952 INFO L146 ILogger]: Start difference. First operand 358 states and 358 transitions. Second operand 141 states. [2019-05-23 09:28:21,271 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:21,271 INFO L146 ILogger]: Finished difference Result 366 states and 366 transitions. [2019-05-23 09:28:21,272 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2019-05-23 09:28:21,272 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 357 [2019-05-23 09:28:21,272 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:21,273 INFO L146 ILogger]: With dead ends: 366 [2019-05-23 09:28:21,274 INFO L146 ILogger]: Without dead ends: 366 [2019-05-23 09:28:21,276 INFO L146 ILogger]: 0 DeclaredPredicates, 494 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2019-05-23 09:28:21,276 INFO L146 ILogger]: Start minimizeSevpa. Operand 366 states. [2019-05-23 09:28:21,279 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 366 to 363. [2019-05-23 09:28:21,279 INFO L146 ILogger]: Start removeUnreachable. Operand 363 states. [2019-05-23 09:28:21,280 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2019-05-23 09:28:21,280 INFO L146 ILogger]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 357 [2019-05-23 09:28:21,280 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:21,280 INFO L146 ILogger]: Abstraction has 363 states and 363 transitions. [2019-05-23 09:28:21,280 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 09:28:21,280 INFO L146 ILogger]: Start isEmpty. Operand 363 states and 363 transitions. [2019-05-23 09:28:21,281 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 363 [2019-05-23 09:28:21,281 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:21,282 INFO L146 ILogger]: trace histogram [70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:21,282 INFO L146 ILogger]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:21,282 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:21,282 INFO L146 ILogger]: Analyzing trace with hash -1140336878, now seen corresponding path program 70 times [2019-05-23 09:28:21,283 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:21,301 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:21,308 INFO L146 ILogger]: Trace formula consists of 508 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:28:21,311 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:26,723 INFO L146 ILogger]: Checked inductivity of 12145 backedges. 0 proven. 12145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:26,723 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:26,723 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 09:28:26,724 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 09:28:26,725 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 09:28:26,725 INFO L146 ILogger]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:28:26,725 INFO L146 ILogger]: Start difference. First operand 363 states and 363 transitions. Second operand 143 states. [2019-05-23 09:28:36,075 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:36,075 INFO L146 ILogger]: Finished difference Result 371 states and 371 transitions. [2019-05-23 09:28:36,075 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-05-23 09:28:36,076 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 362 [2019-05-23 09:28:36,076 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:36,077 INFO L146 ILogger]: With dead ends: 371 [2019-05-23 09:28:36,078 INFO L146 ILogger]: Without dead ends: 371 [2019-05-23 09:28:36,081 INFO L146 ILogger]: 0 DeclaredPredicates, 501 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2019-05-23 09:28:36,081 INFO L146 ILogger]: Start minimizeSevpa. Operand 371 states. [2019-05-23 09:28:36,083 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-05-23 09:28:36,083 INFO L146 ILogger]: Start removeUnreachable. Operand 368 states. [2019-05-23 09:28:36,083 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2019-05-23 09:28:36,084 INFO L146 ILogger]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 362 [2019-05-23 09:28:36,084 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:36,084 INFO L146 ILogger]: Abstraction has 368 states and 368 transitions. [2019-05-23 09:28:36,084 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 09:28:36,084 INFO L146 ILogger]: Start isEmpty. Operand 368 states and 368 transitions. [2019-05-23 09:28:36,085 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 368 [2019-05-23 09:28:36,085 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:36,085 INFO L146 ILogger]: trace histogram [71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:36,085 INFO L146 ILogger]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:36,086 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:36,086 INFO L146 ILogger]: Analyzing trace with hash 1875567074, now seen corresponding path program 71 times [2019-05-23 09:28:36,086 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:36,115 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:36,122 INFO L146 ILogger]: Trace formula consists of 515 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:28:36,125 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:41,960 INFO L146 ILogger]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:41,961 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:41,961 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 09:28:41,961 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 09:28:41,962 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 09:28:41,962 INFO L146 ILogger]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:28:41,962 INFO L146 ILogger]: Start difference. First operand 368 states and 368 transitions. Second operand 145 states. [2019-05-23 09:28:51,792 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:51,792 INFO L146 ILogger]: Finished difference Result 376 states and 376 transitions. [2019-05-23 09:28:51,793 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-05-23 09:28:51,793 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 367 [2019-05-23 09:28:51,793 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:51,794 INFO L146 ILogger]: With dead ends: 376 [2019-05-23 09:28:51,795 INFO L146 ILogger]: Without dead ends: 376 [2019-05-23 09:28:51,797 INFO L146 ILogger]: 0 DeclaredPredicates, 508 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2019-05-23 09:28:51,797 INFO L146 ILogger]: Start minimizeSevpa. Operand 376 states. [2019-05-23 09:28:51,799 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-05-23 09:28:51,799 INFO L146 ILogger]: Start removeUnreachable. Operand 373 states. [2019-05-23 09:28:51,799 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-05-23 09:28:51,799 INFO L146 ILogger]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 367 [2019-05-23 09:28:51,800 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:51,800 INFO L146 ILogger]: Abstraction has 373 states and 373 transitions. [2019-05-23 09:28:51,800 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 09:28:51,800 INFO L146 ILogger]: Start isEmpty. Operand 373 states and 373 transitions. [2019-05-23 09:28:51,801 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 373 [2019-05-23 09:28:51,801 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:51,801 INFO L146 ILogger]: trace histogram [72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:28:51,801 INFO L146 ILogger]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:51,802 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:51,802 INFO L146 ILogger]: Analyzing trace with hash 290330898, now seen corresponding path program 72 times [2019-05-23 09:28:51,802 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:51,822 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:51,827 INFO L146 ILogger]: Trace formula consists of 522 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:28:51,830 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:57,595 INFO L146 ILogger]: Checked inductivity of 12852 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:57,595 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:57,595 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 09:28:57,596 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 09:28:57,596 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 09:28:57,597 INFO L146 ILogger]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:28:57,597 INFO L146 ILogger]: Start difference. First operand 373 states and 373 transitions. Second operand 147 states. [2019-05-23 09:29:07,581 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:07,581 INFO L146 ILogger]: Finished difference Result 381 states and 381 transitions. [2019-05-23 09:29:07,582 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-05-23 09:29:07,582 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 372 [2019-05-23 09:29:07,582 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:07,584 INFO L146 ILogger]: With dead ends: 381 [2019-05-23 09:29:07,584 INFO L146 ILogger]: Without dead ends: 381 [2019-05-23 09:29:07,588 INFO L146 ILogger]: 0 DeclaredPredicates, 515 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2019-05-23 09:29:07,588 INFO L146 ILogger]: Start minimizeSevpa. Operand 381 states. [2019-05-23 09:29:07,590 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 381 to 378. [2019-05-23 09:29:07,590 INFO L146 ILogger]: Start removeUnreachable. Operand 378 states. [2019-05-23 09:29:07,591 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2019-05-23 09:29:07,591 INFO L146 ILogger]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 372 [2019-05-23 09:29:07,591 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:07,591 INFO L146 ILogger]: Abstraction has 378 states and 378 transitions. [2019-05-23 09:29:07,591 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 09:29:07,591 INFO L146 ILogger]: Start isEmpty. Operand 378 states and 378 transitions. [2019-05-23 09:29:07,592 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 378 [2019-05-23 09:29:07,592 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:07,593 INFO L146 ILogger]: trace histogram [73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:07,593 INFO L146 ILogger]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:07,593 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:07,593 INFO L146 ILogger]: Analyzing trace with hash 371056610, now seen corresponding path program 73 times [2019-05-23 09:29:07,593 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:07,620 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:07,628 INFO L146 ILogger]: Trace formula consists of 529 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 09:29:07,632 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:13,849 INFO L146 ILogger]: Checked inductivity of 13213 backedges. 0 proven. 13213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:13,849 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:13,849 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 09:29:13,850 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 09:29:13,851 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 09:29:13,852 INFO L146 ILogger]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:29:13,852 INFO L146 ILogger]: Start difference. First operand 378 states and 378 transitions. Second operand 149 states. [2019-05-23 09:29:24,040 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:24,041 INFO L146 ILogger]: Finished difference Result 386 states and 386 transitions. [2019-05-23 09:29:24,041 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2019-05-23 09:29:24,041 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 377 [2019-05-23 09:29:24,042 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:24,043 INFO L146 ILogger]: With dead ends: 386 [2019-05-23 09:29:24,043 INFO L146 ILogger]: Without dead ends: 386 [2019-05-23 09:29:24,045 INFO L146 ILogger]: 0 DeclaredPredicates, 522 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2019-05-23 09:29:24,045 INFO L146 ILogger]: Start minimizeSevpa. Operand 386 states. [2019-05-23 09:29:24,047 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 386 to 383. [2019-05-23 09:29:24,047 INFO L146 ILogger]: Start removeUnreachable. Operand 383 states. [2019-05-23 09:29:24,047 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2019-05-23 09:29:24,047 INFO L146 ILogger]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 377 [2019-05-23 09:29:24,048 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:24,048 INFO L146 ILogger]: Abstraction has 383 states and 383 transitions. [2019-05-23 09:29:24,048 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 09:29:24,048 INFO L146 ILogger]: Start isEmpty. Operand 383 states and 383 transitions. [2019-05-23 09:29:24,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 383 [2019-05-23 09:29:24,049 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:24,049 INFO L146 ILogger]: trace histogram [74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:24,050 INFO L146 ILogger]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:24,050 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:24,050 INFO L146 ILogger]: Analyzing trace with hash -47588590, now seen corresponding path program 74 times [2019-05-23 09:29:24,050 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:24,071 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:24,078 INFO L146 ILogger]: Trace formula consists of 536 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:29:24,082 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:30,204 INFO L146 ILogger]: Checked inductivity of 13579 backedges. 0 proven. 13579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:30,204 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:30,204 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 09:29:30,205 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 09:29:30,205 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 09:29:30,206 INFO L146 ILogger]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:29:30,206 INFO L146 ILogger]: Start difference. First operand 383 states and 383 transitions. Second operand 151 states. [2019-05-23 09:29:40,731 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:40,732 INFO L146 ILogger]: Finished difference Result 391 states and 391 transitions. [2019-05-23 09:29:40,732 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2019-05-23 09:29:40,732 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 382 [2019-05-23 09:29:40,733 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:40,734 INFO L146 ILogger]: With dead ends: 391 [2019-05-23 09:29:40,734 INFO L146 ILogger]: Without dead ends: 391 [2019-05-23 09:29:40,736 INFO L146 ILogger]: 0 DeclaredPredicates, 529 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16280 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=28123, Invalid=60979, Unknown=0, NotChecked=0, Total=89102 [2019-05-23 09:29:40,736 INFO L146 ILogger]: Start minimizeSevpa. Operand 391 states. [2019-05-23 09:29:40,738 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 391 to 388. [2019-05-23 09:29:40,738 INFO L146 ILogger]: Start removeUnreachable. Operand 388 states. [2019-05-23 09:29:40,739 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2019-05-23 09:29:40,739 INFO L146 ILogger]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 382 [2019-05-23 09:29:40,739 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:40,739 INFO L146 ILogger]: Abstraction has 388 states and 388 transitions. [2019-05-23 09:29:40,739 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 09:29:40,739 INFO L146 ILogger]: Start isEmpty. Operand 388 states and 388 transitions. [2019-05-23 09:29:40,740 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 388 [2019-05-23 09:29:40,740 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:40,741 INFO L146 ILogger]: trace histogram [75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:40,741 INFO L146 ILogger]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:40,741 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:40,741 INFO L146 ILogger]: Analyzing trace with hash 1732992482, now seen corresponding path program 75 times [2019-05-23 09:29:40,742 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:40,764 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:40,771 INFO L146 ILogger]: Trace formula consists of 543 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 09:29:40,773 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:47,077 INFO L146 ILogger]: Checked inductivity of 13950 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:47,077 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:47,077 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 09:29:47,078 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 09:29:47,078 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 09:29:47,079 INFO L146 ILogger]: CoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:29:47,079 INFO L146 ILogger]: Start difference. First operand 388 states and 388 transitions. Second operand 153 states. [2019-05-23 09:29:57,766 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:57,766 INFO L146 ILogger]: Finished difference Result 396 states and 396 transitions. [2019-05-23 09:29:57,767 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-05-23 09:29:57,767 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 387 [2019-05-23 09:29:57,767 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:57,769 INFO L146 ILogger]: With dead ends: 396 [2019-05-23 09:29:57,769 INFO L146 ILogger]: Without dead ends: 396 [2019-05-23 09:29:57,772 INFO L146 ILogger]: 0 DeclaredPredicates, 536 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16725 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=28878, Invalid=62628, Unknown=0, NotChecked=0, Total=91506 [2019-05-23 09:29:57,773 INFO L146 ILogger]: Start minimizeSevpa. Operand 396 states. [2019-05-23 09:29:57,775 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 396 to 393. [2019-05-23 09:29:57,775 INFO L146 ILogger]: Start removeUnreachable. Operand 393 states. [2019-05-23 09:29:57,775 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-05-23 09:29:57,775 INFO L146 ILogger]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 387 [2019-05-23 09:29:57,776 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:57,776 INFO L146 ILogger]: Abstraction has 393 states and 393 transitions. [2019-05-23 09:29:57,776 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 09:29:57,776 INFO L146 ILogger]: Start isEmpty. Operand 393 states and 393 transitions. [2019-05-23 09:29:57,777 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 393 [2019-05-23 09:29:57,777 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:57,777 INFO L146 ILogger]: trace histogram [76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:29:57,778 INFO L146 ILogger]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:57,778 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:57,778 INFO L146 ILogger]: Analyzing trace with hash 1656429842, now seen corresponding path program 76 times [2019-05-23 09:29:57,778 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:57,798 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:57,806 INFO L146 ILogger]: Trace formula consists of 550 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:29:57,809 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:04,132 INFO L146 ILogger]: Checked inductivity of 14326 backedges. 0 proven. 14326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:04,132 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:04,133 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 09:30:04,133 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 09:30:04,134 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 09:30:04,135 INFO L146 ILogger]: CoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:30:04,135 INFO L146 ILogger]: Start difference. First operand 393 states and 393 transitions. Second operand 155 states. [2019-05-23 09:30:14,977 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:14,978 INFO L146 ILogger]: Finished difference Result 401 states and 401 transitions. [2019-05-23 09:30:14,978 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-05-23 09:30:14,978 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 392 [2019-05-23 09:30:14,979 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:14,980 INFO L146 ILogger]: With dead ends: 401 [2019-05-23 09:30:14,980 INFO L146 ILogger]: Without dead ends: 401 [2019-05-23 09:30:14,983 INFO L146 ILogger]: 0 DeclaredPredicates, 543 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17176 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=29643, Invalid=64299, Unknown=0, NotChecked=0, Total=93942 [2019-05-23 09:30:14,984 INFO L146 ILogger]: Start minimizeSevpa. Operand 401 states. [2019-05-23 09:30:14,986 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 401 to 398. [2019-05-23 09:30:14,986 INFO L146 ILogger]: Start removeUnreachable. Operand 398 states. [2019-05-23 09:30:14,986 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2019-05-23 09:30:14,986 INFO L146 ILogger]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 392 [2019-05-23 09:30:14,986 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:14,986 INFO L146 ILogger]: Abstraction has 398 states and 398 transitions. [2019-05-23 09:30:14,987 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 09:30:14,987 INFO L146 ILogger]: Start isEmpty. Operand 398 states and 398 transitions. [2019-05-23 09:30:14,988 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 398 [2019-05-23 09:30:14,988 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:14,988 INFO L146 ILogger]: trace histogram [77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:14,988 INFO L146 ILogger]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:14,988 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:14,989 INFO L146 ILogger]: Analyzing trace with hash 1949522914, now seen corresponding path program 77 times [2019-05-23 09:30:14,989 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:15,018 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:15,025 INFO L146 ILogger]: Trace formula consists of 557 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:30:15,028 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:21,398 INFO L146 ILogger]: Checked inductivity of 14707 backedges. 0 proven. 14707 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:21,398 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:21,399 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 09:30:21,399 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 09:30:21,400 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 09:30:21,401 INFO L146 ILogger]: CoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:30:21,401 INFO L146 ILogger]: Start difference. First operand 398 states and 398 transitions. Second operand 157 states. [2019-05-23 09:30:32,464 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:32,464 INFO L146 ILogger]: Finished difference Result 406 states and 406 transitions. [2019-05-23 09:30:32,464 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-05-23 09:30:32,464 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 397 [2019-05-23 09:30:32,465 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:32,466 INFO L146 ILogger]: With dead ends: 406 [2019-05-23 09:30:32,466 INFO L146 ILogger]: Without dead ends: 406 [2019-05-23 09:30:32,469 INFO L146 ILogger]: 0 DeclaredPredicates, 550 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17633 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=30418, Invalid=65992, Unknown=0, NotChecked=0, Total=96410 [2019-05-23 09:30:32,469 INFO L146 ILogger]: Start minimizeSevpa. Operand 406 states. [2019-05-23 09:30:32,471 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 406 to 403. [2019-05-23 09:30:32,471 INFO L146 ILogger]: Start removeUnreachable. Operand 403 states. [2019-05-23 09:30:32,472 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2019-05-23 09:30:32,472 INFO L146 ILogger]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 397 [2019-05-23 09:30:32,472 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:32,472 INFO L146 ILogger]: Abstraction has 403 states and 403 transitions. [2019-05-23 09:30:32,472 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 09:30:32,472 INFO L146 ILogger]: Start isEmpty. Operand 403 states and 403 transitions. [2019-05-23 09:30:32,473 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 403 [2019-05-23 09:30:32,474 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:32,474 INFO L146 ILogger]: trace histogram [78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:32,474 INFO L146 ILogger]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:32,474 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:32,474 INFO L146 ILogger]: Analyzing trace with hash -1121853678, now seen corresponding path program 78 times [2019-05-23 09:30:32,475 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:32,501 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:32,507 INFO L146 ILogger]: Trace formula consists of 564 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:30:32,509 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:39,267 INFO L146 ILogger]: Checked inductivity of 15093 backedges. 0 proven. 15093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:39,267 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:39,267 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 09:30:39,268 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 09:30:39,269 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 09:30:39,270 INFO L146 ILogger]: CoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:30:39,270 INFO L146 ILogger]: Start difference. First operand 403 states and 403 transitions. Second operand 159 states. [2019-05-23 09:30:50,764 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:50,765 INFO L146 ILogger]: Finished difference Result 411 states and 411 transitions. [2019-05-23 09:30:50,765 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2019-05-23 09:30:50,765 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 402 [2019-05-23 09:30:50,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:50,767 INFO L146 ILogger]: With dead ends: 411 [2019-05-23 09:30:50,767 INFO L146 ILogger]: Without dead ends: 411 [2019-05-23 09:30:50,769 INFO L146 ILogger]: 0 DeclaredPredicates, 557 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=31203, Invalid=67707, Unknown=0, NotChecked=0, Total=98910 [2019-05-23 09:30:50,769 INFO L146 ILogger]: Start minimizeSevpa. Operand 411 states. [2019-05-23 09:30:50,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-05-23 09:30:50,771 INFO L146 ILogger]: Start removeUnreachable. Operand 408 states. [2019-05-23 09:30:50,772 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2019-05-23 09:30:50,772 INFO L146 ILogger]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 402 [2019-05-23 09:30:50,772 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:50,772 INFO L146 ILogger]: Abstraction has 408 states and 408 transitions. [2019-05-23 09:30:50,772 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 09:30:50,772 INFO L146 ILogger]: Start isEmpty. Operand 408 states and 408 transitions. [2019-05-23 09:30:50,774 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 408 [2019-05-23 09:30:50,774 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:50,774 INFO L146 ILogger]: trace histogram [79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:30:50,774 INFO L146 ILogger]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:50,774 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:50,775 INFO L146 ILogger]: Analyzing trace with hash -1246373406, now seen corresponding path program 79 times [2019-05-23 09:30:50,775 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:50,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:50,802 INFO L146 ILogger]: Trace formula consists of 571 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 09:30:50,804 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:57,443 INFO L146 ILogger]: Checked inductivity of 15484 backedges. 0 proven. 15484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:57,443 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:57,443 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 09:30:57,444 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 09:30:57,444 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 09:30:57,445 INFO L146 ILogger]: CoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:30:57,445 INFO L146 ILogger]: Start difference. First operand 408 states and 408 transitions. Second operand 161 states. [2019-05-23 09:31:09,356 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:09,357 INFO L146 ILogger]: Finished difference Result 416 states and 416 transitions. [2019-05-23 09:31:09,357 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-05-23 09:31:09,357 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 407 [2019-05-23 09:31:09,358 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:09,359 INFO L146 ILogger]: With dead ends: 416 [2019-05-23 09:31:09,359 INFO L146 ILogger]: Without dead ends: 416 [2019-05-23 09:31:09,361 INFO L146 ILogger]: 0 DeclaredPredicates, 564 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18565 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=31998, Invalid=69444, Unknown=0, NotChecked=0, Total=101442 [2019-05-23 09:31:09,362 INFO L146 ILogger]: Start minimizeSevpa. Operand 416 states. [2019-05-23 09:31:09,364 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 416 to 413. [2019-05-23 09:31:09,364 INFO L146 ILogger]: Start removeUnreachable. Operand 413 states. [2019-05-23 09:31:09,364 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2019-05-23 09:31:09,364 INFO L146 ILogger]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 407 [2019-05-23 09:31:09,365 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:09,365 INFO L146 ILogger]: Abstraction has 413 states and 413 transitions. [2019-05-23 09:31:09,365 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 09:31:09,365 INFO L146 ILogger]: Start isEmpty. Operand 413 states and 413 transitions. [2019-05-23 09:31:09,366 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 413 [2019-05-23 09:31:09,366 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:09,367 INFO L146 ILogger]: trace histogram [80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:09,367 INFO L146 ILogger]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:09,367 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:09,367 INFO L146 ILogger]: Analyzing trace with hash 528359698, now seen corresponding path program 80 times [2019-05-23 09:31:09,368 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:09,397 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:09,405 INFO L146 ILogger]: Trace formula consists of 578 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:31:09,410 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:16,499 INFO L146 ILogger]: Checked inductivity of 15880 backedges. 0 proven. 15880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:16,500 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:16,500 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 09:31:16,500 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 09:31:16,501 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 09:31:16,502 INFO L146 ILogger]: CoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:31:16,502 INFO L146 ILogger]: Start difference. First operand 413 states and 413 transitions. Second operand 163 states. [2019-05-23 09:31:28,549 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:28,549 INFO L146 ILogger]: Finished difference Result 421 states and 421 transitions. [2019-05-23 09:31:28,549 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-05-23 09:31:28,550 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 412 [2019-05-23 09:31:28,550 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:28,552 INFO L146 ILogger]: With dead ends: 421 [2019-05-23 09:31:28,552 INFO L146 ILogger]: Without dead ends: 421 [2019-05-23 09:31:28,556 INFO L146 ILogger]: 0 DeclaredPredicates, 571 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19040 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=32803, Invalid=71203, Unknown=0, NotChecked=0, Total=104006 [2019-05-23 09:31:28,556 INFO L146 ILogger]: Start minimizeSevpa. Operand 421 states. [2019-05-23 09:31:28,558 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 421 to 418. [2019-05-23 09:31:28,558 INFO L146 ILogger]: Start removeUnreachable. Operand 418 states. [2019-05-23 09:31:28,559 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2019-05-23 09:31:28,559 INFO L146 ILogger]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 412 [2019-05-23 09:31:28,559 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:28,559 INFO L146 ILogger]: Abstraction has 418 states and 418 transitions. [2019-05-23 09:31:28,559 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 09:31:28,559 INFO L146 ILogger]: Start isEmpty. Operand 418 states and 418 transitions. [2019-05-23 09:31:28,561 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 418 [2019-05-23 09:31:28,561 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:28,561 INFO L146 ILogger]: trace histogram [81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:28,561 INFO L146 ILogger]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:28,561 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:28,562 INFO L146 ILogger]: Analyzing trace with hash 213047266, now seen corresponding path program 81 times [2019-05-23 09:31:28,562 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:28,596 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:28,604 INFO L146 ILogger]: Trace formula consists of 585 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 09:31:28,608 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:35,949 INFO L146 ILogger]: Checked inductivity of 16281 backedges. 0 proven. 16281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:35,949 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:35,950 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 09:31:35,950 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 09:31:35,951 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 09:31:35,952 INFO L146 ILogger]: CoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:31:35,952 INFO L146 ILogger]: Start difference. First operand 418 states and 418 transitions. Second operand 165 states. [2019-05-23 09:31:48,408 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:48,408 INFO L146 ILogger]: Finished difference Result 426 states and 426 transitions. [2019-05-23 09:31:48,408 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2019-05-23 09:31:48,408 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 417 [2019-05-23 09:31:48,409 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:48,410 INFO L146 ILogger]: With dead ends: 426 [2019-05-23 09:31:48,410 INFO L146 ILogger]: Without dead ends: 426 [2019-05-23 09:31:48,413 INFO L146 ILogger]: 0 DeclaredPredicates, 578 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19521 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=33618, Invalid=72984, Unknown=0, NotChecked=0, Total=106602 [2019-05-23 09:31:48,414 INFO L146 ILogger]: Start minimizeSevpa. Operand 426 states. [2019-05-23 09:31:48,416 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 426 to 423. [2019-05-23 09:31:48,416 INFO L146 ILogger]: Start removeUnreachable. Operand 423 states. [2019-05-23 09:31:48,416 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2019-05-23 09:31:48,417 INFO L146 ILogger]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 417 [2019-05-23 09:31:48,417 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:48,417 INFO L146 ILogger]: Abstraction has 423 states and 423 transitions. [2019-05-23 09:31:48,417 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 09:31:48,417 INFO L146 ILogger]: Start isEmpty. Operand 423 states and 423 transitions. [2019-05-23 09:31:48,418 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 423 [2019-05-23 09:31:48,419 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:48,419 INFO L146 ILogger]: trace histogram [82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:31:48,419 INFO L146 ILogger]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:48,419 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:48,419 INFO L146 ILogger]: Analyzing trace with hash 888136466, now seen corresponding path program 82 times [2019-05-23 09:31:48,420 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:48,447 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:48,452 INFO L146 ILogger]: Trace formula consists of 592 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:31:48,455 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:55,891 INFO L146 ILogger]: Checked inductivity of 16687 backedges. 0 proven. 16687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:55,891 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:55,892 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 09:31:55,892 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 09:31:55,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 09:31:55,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:31:55,894 INFO L146 ILogger]: Start difference. First operand 423 states and 423 transitions. Second operand 167 states. [2019-05-23 09:32:08,355 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:08,356 INFO L146 ILogger]: Finished difference Result 431 states and 431 transitions. [2019-05-23 09:32:08,356 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2019-05-23 09:32:08,356 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 422 [2019-05-23 09:32:08,357 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:08,358 INFO L146 ILogger]: With dead ends: 431 [2019-05-23 09:32:08,358 INFO L146 ILogger]: Without dead ends: 431 [2019-05-23 09:32:08,362 INFO L146 ILogger]: 0 DeclaredPredicates, 585 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20008 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=34443, Invalid=74787, Unknown=0, NotChecked=0, Total=109230 [2019-05-23 09:32:08,362 INFO L146 ILogger]: Start minimizeSevpa. Operand 431 states. [2019-05-23 09:32:08,365 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 431 to 428. [2019-05-23 09:32:08,365 INFO L146 ILogger]: Start removeUnreachable. Operand 428 states. [2019-05-23 09:32:08,365 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2019-05-23 09:32:08,365 INFO L146 ILogger]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 422 [2019-05-23 09:32:08,366 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:08,366 INFO L146 ILogger]: Abstraction has 428 states and 428 transitions. [2019-05-23 09:32:08,366 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 09:32:08,366 INFO L146 ILogger]: Start isEmpty. Operand 428 states and 428 transitions. [2019-05-23 09:32:08,368 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 428 [2019-05-23 09:32:08,368 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:08,368 INFO L146 ILogger]: trace histogram [83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:08,368 INFO L146 ILogger]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:08,368 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:08,368 INFO L146 ILogger]: Analyzing trace with hash -1039510046, now seen corresponding path program 83 times [2019-05-23 09:32:08,369 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:08,391 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:08,397 INFO L146 ILogger]: Trace formula consists of 599 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:32:08,401 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:15,909 INFO L146 ILogger]: Checked inductivity of 17098 backedges. 0 proven. 17098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:15,909 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:15,909 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 09:32:15,910 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 09:32:15,911 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 09:32:15,912 INFO L146 ILogger]: CoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:32:15,912 INFO L146 ILogger]: Start difference. First operand 428 states and 428 transitions. Second operand 169 states. [2019-05-23 09:32:29,005 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:29,005 INFO L146 ILogger]: Finished difference Result 436 states and 436 transitions. [2019-05-23 09:32:29,006 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2019-05-23 09:32:29,006 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 427 [2019-05-23 09:32:29,006 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:29,008 INFO L146 ILogger]: With dead ends: 436 [2019-05-23 09:32:29,008 INFO L146 ILogger]: Without dead ends: 436 [2019-05-23 09:32:29,011 INFO L146 ILogger]: 0 DeclaredPredicates, 592 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20501 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=35278, Invalid=76612, Unknown=0, NotChecked=0, Total=111890 [2019-05-23 09:32:29,012 INFO L146 ILogger]: Start minimizeSevpa. Operand 436 states. [2019-05-23 09:32:29,014 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 436 to 433. [2019-05-23 09:32:29,014 INFO L146 ILogger]: Start removeUnreachable. Operand 433 states. [2019-05-23 09:32:29,015 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2019-05-23 09:32:29,015 INFO L146 ILogger]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 427 [2019-05-23 09:32:29,015 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:29,015 INFO L146 ILogger]: Abstraction has 433 states and 433 transitions. [2019-05-23 09:32:29,015 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 09:32:29,015 INFO L146 ILogger]: Start isEmpty. Operand 433 states and 433 transitions. [2019-05-23 09:32:29,016 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 433 [2019-05-23 09:32:29,017 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:29,017 INFO L146 ILogger]: trace histogram [84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:29,017 INFO L146 ILogger]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:29,017 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:29,017 INFO L146 ILogger]: Analyzing trace with hash 1083647250, now seen corresponding path program 84 times [2019-05-23 09:32:29,018 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:29,040 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:29,046 INFO L146 ILogger]: Trace formula consists of 606 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:32:29,049 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:36,685 INFO L146 ILogger]: Checked inductivity of 17514 backedges. 0 proven. 17514 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:36,686 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:36,686 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 09:32:36,686 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 09:32:36,687 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 09:32:36,688 INFO L146 ILogger]: CoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:32:36,688 INFO L146 ILogger]: Start difference. First operand 433 states and 433 transitions. Second operand 171 states. [2019-05-23 09:32:49,943 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:49,943 INFO L146 ILogger]: Finished difference Result 441 states and 441 transitions. [2019-05-23 09:32:49,943 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2019-05-23 09:32:49,943 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 432 [2019-05-23 09:32:49,944 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:49,945 INFO L146 ILogger]: With dead ends: 441 [2019-05-23 09:32:49,945 INFO L146 ILogger]: Without dead ends: 441 [2019-05-23 09:32:49,949 INFO L146 ILogger]: 0 DeclaredPredicates, 599 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21000 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=36123, Invalid=78459, Unknown=0, NotChecked=0, Total=114582 [2019-05-23 09:32:49,949 INFO L146 ILogger]: Start minimizeSevpa. Operand 441 states. [2019-05-23 09:32:49,952 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 441 to 438. [2019-05-23 09:32:49,952 INFO L146 ILogger]: Start removeUnreachable. Operand 438 states. [2019-05-23 09:32:49,953 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2019-05-23 09:32:49,953 INFO L146 ILogger]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 432 [2019-05-23 09:32:49,953 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:49,953 INFO L146 ILogger]: Abstraction has 438 states and 438 transitions. [2019-05-23 09:32:49,953 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 09:32:49,953 INFO L146 ILogger]: Start isEmpty. Operand 438 states and 438 transitions. [2019-05-23 09:32:49,955 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 438 [2019-05-23 09:32:49,955 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:49,956 INFO L146 ILogger]: trace histogram [85, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:32:49,956 INFO L146 ILogger]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:49,956 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:49,956 INFO L146 ILogger]: Analyzing trace with hash -2036575262, now seen corresponding path program 85 times [2019-05-23 09:32:49,957 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:49,984 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:49,990 INFO L146 ILogger]: Trace formula consists of 613 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 09:32:49,993 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:57,991 INFO L146 ILogger]: Checked inductivity of 17935 backedges. 0 proven. 17935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:57,992 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:57,992 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2019-05-23 09:32:57,993 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 09:32:57,994 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 09:32:57,996 INFO L146 ILogger]: CoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:32:57,996 INFO L146 ILogger]: Start difference. First operand 438 states and 438 transitions. Second operand 173 states. [2019-05-23 09:33:11,920 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:11,920 INFO L146 ILogger]: Finished difference Result 446 states and 446 transitions. [2019-05-23 09:33:11,920 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2019-05-23 09:33:11,921 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 437 [2019-05-23 09:33:11,921 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:11,923 INFO L146 ILogger]: With dead ends: 446 [2019-05-23 09:33:11,923 INFO L146 ILogger]: Without dead ends: 446 [2019-05-23 09:33:11,927 INFO L146 ILogger]: 0 DeclaredPredicates, 606 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21505 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=36978, Invalid=80328, Unknown=0, NotChecked=0, Total=117306 [2019-05-23 09:33:11,928 INFO L146 ILogger]: Start minimizeSevpa. Operand 446 states. [2019-05-23 09:33:11,930 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 446 to 443. [2019-05-23 09:33:11,931 INFO L146 ILogger]: Start removeUnreachable. Operand 443 states. [2019-05-23 09:33:11,931 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2019-05-23 09:33:11,931 INFO L146 ILogger]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 437 [2019-05-23 09:33:11,931 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:11,932 INFO L146 ILogger]: Abstraction has 443 states and 443 transitions. [2019-05-23 09:33:11,932 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 09:33:11,932 INFO L146 ILogger]: Start isEmpty. Operand 443 states and 443 transitions. [2019-05-23 09:33:11,934 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 443 [2019-05-23 09:33:11,934 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:11,934 INFO L146 ILogger]: trace histogram [86, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:11,934 INFO L146 ILogger]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:11,934 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:11,934 INFO L146 ILogger]: Analyzing trace with hash 496232210, now seen corresponding path program 86 times [2019-05-23 09:33:11,935 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:11,971 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:11,982 INFO L146 ILogger]: Trace formula consists of 620 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:33:11,986 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:19,900 INFO L146 ILogger]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:19,900 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:19,901 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2019-05-23 09:33:19,901 INFO L146 ILogger]: Interpolant automaton has 175 states [2019-05-23 09:33:19,903 INFO L146 ILogger]: Constructing interpolant automaton starting with 175 interpolants. [2019-05-23 09:33:19,904 INFO L146 ILogger]: CoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 09:33:19,904 INFO L146 ILogger]: Start difference. First operand 443 states and 443 transitions. Second operand 175 states. [2019-05-23 09:33:33,979 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:33,979 INFO L146 ILogger]: Finished difference Result 451 states and 451 transitions. [2019-05-23 09:33:33,980 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-05-23 09:33:33,980 INFO L146 ILogger]: Start accepts. Automaton has 175 states. Word has length 442 [2019-05-23 09:33:33,980 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:33,981 INFO L146 ILogger]: With dead ends: 451 [2019-05-23 09:33:33,981 INFO L146 ILogger]: Without dead ends: 451 [2019-05-23 09:33:33,986 INFO L146 ILogger]: 0 DeclaredPredicates, 613 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22016 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=37843, Invalid=82219, Unknown=0, NotChecked=0, Total=120062 [2019-05-23 09:33:33,986 INFO L146 ILogger]: Start minimizeSevpa. Operand 451 states. [2019-05-23 09:33:33,988 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 451 to 448. [2019-05-23 09:33:33,988 INFO L146 ILogger]: Start removeUnreachable. Operand 448 states. [2019-05-23 09:33:33,989 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 448 states to 448 states and 448 transitions. [2019-05-23 09:33:33,989 INFO L146 ILogger]: Start accepts. Automaton has 448 states and 448 transitions. Word has length 442 [2019-05-23 09:33:33,989 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:33,989 INFO L146 ILogger]: Abstraction has 448 states and 448 transitions. [2019-05-23 09:33:33,989 INFO L146 ILogger]: Interpolant automaton has 175 states. [2019-05-23 09:33:33,989 INFO L146 ILogger]: Start isEmpty. Operand 448 states and 448 transitions. [2019-05-23 09:33:33,990 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 448 [2019-05-23 09:33:33,991 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:33,991 INFO L146 ILogger]: trace histogram [87, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:33,991 INFO L146 ILogger]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:33,991 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:33,991 INFO L146 ILogger]: Analyzing trace with hash 1934152162, now seen corresponding path program 87 times [2019-05-23 09:33:33,992 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:34,015 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:34,021 INFO L146 ILogger]: Trace formula consists of 627 conjuncts, 176 conjunts are in the unsatisfiable core [2019-05-23 09:33:34,025 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:42,299 INFO L146 ILogger]: Checked inductivity of 18792 backedges. 0 proven. 18792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:42,299 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:42,299 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2019-05-23 09:33:42,300 INFO L146 ILogger]: Interpolant automaton has 177 states [2019-05-23 09:33:42,301 INFO L146 ILogger]: Constructing interpolant automaton starting with 177 interpolants. [2019-05-23 09:33:42,302 INFO L146 ILogger]: CoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 09:33:42,302 INFO L146 ILogger]: Start difference. First operand 448 states and 448 transitions. Second operand 177 states. [2019-05-23 09:33:56,237 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:56,237 INFO L146 ILogger]: Finished difference Result 456 states and 456 transitions. [2019-05-23 09:33:56,237 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-05-23 09:33:56,238 INFO L146 ILogger]: Start accepts. Automaton has 177 states. Word has length 447 [2019-05-23 09:33:56,238 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:56,240 INFO L146 ILogger]: With dead ends: 456 [2019-05-23 09:33:56,240 INFO L146 ILogger]: Without dead ends: 456 [2019-05-23 09:33:56,244 INFO L146 ILogger]: 0 DeclaredPredicates, 620 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22533 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=38718, Invalid=84132, Unknown=0, NotChecked=0, Total=122850 [2019-05-23 09:33:56,245 INFO L146 ILogger]: Start minimizeSevpa. Operand 456 states. [2019-05-23 09:33:56,247 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 456 to 453. [2019-05-23 09:33:56,247 INFO L146 ILogger]: Start removeUnreachable. Operand 453 states. [2019-05-23 09:33:56,248 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2019-05-23 09:33:56,248 INFO L146 ILogger]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 447 [2019-05-23 09:33:56,248 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:56,248 INFO L146 ILogger]: Abstraction has 453 states and 453 transitions. [2019-05-23 09:33:56,248 INFO L146 ILogger]: Interpolant automaton has 177 states. [2019-05-23 09:33:56,248 INFO L146 ILogger]: Start isEmpty. Operand 453 states and 453 transitions. [2019-05-23 09:33:56,250 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 453 [2019-05-23 09:33:56,250 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:56,250 INFO L146 ILogger]: trace histogram [88, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:33:56,250 INFO L146 ILogger]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:56,250 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:56,250 INFO L146 ILogger]: Analyzing trace with hash 1057368338, now seen corresponding path program 88 times [2019-05-23 09:33:56,251 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:56,276 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:56,282 INFO L146 ILogger]: Trace formula consists of 634 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 09:33:56,285 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:04,706 INFO L146 ILogger]: Checked inductivity of 19228 backedges. 0 proven. 19228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:04,707 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:04,707 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2019-05-23 09:34:04,707 INFO L146 ILogger]: Interpolant automaton has 179 states [2019-05-23 09:34:04,708 INFO L146 ILogger]: Constructing interpolant automaton starting with 179 interpolants. [2019-05-23 09:34:04,709 INFO L146 ILogger]: CoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 09:34:04,710 INFO L146 ILogger]: Start difference. First operand 453 states and 453 transitions. Second operand 179 states. [2019-05-23 09:34:19,511 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:19,511 INFO L146 ILogger]: Finished difference Result 461 states and 461 transitions. [2019-05-23 09:34:19,512 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2019-05-23 09:34:19,512 INFO L146 ILogger]: Start accepts. Automaton has 179 states. Word has length 452 [2019-05-23 09:34:19,512 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:19,513 INFO L146 ILogger]: With dead ends: 461 [2019-05-23 09:34:19,513 INFO L146 ILogger]: Without dead ends: 461 [2019-05-23 09:34:19,518 INFO L146 ILogger]: 0 DeclaredPredicates, 627 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23056 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=39603, Invalid=86067, Unknown=0, NotChecked=0, Total=125670 [2019-05-23 09:34:19,519 INFO L146 ILogger]: Start minimizeSevpa. Operand 461 states. [2019-05-23 09:34:19,521 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 461 to 458. [2019-05-23 09:34:19,521 INFO L146 ILogger]: Start removeUnreachable. Operand 458 states. [2019-05-23 09:34:19,522 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2019-05-23 09:34:19,522 INFO L146 ILogger]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 452 [2019-05-23 09:34:19,522 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:19,522 INFO L146 ILogger]: Abstraction has 458 states and 458 transitions. [2019-05-23 09:34:19,522 INFO L146 ILogger]: Interpolant automaton has 179 states. [2019-05-23 09:34:19,522 INFO L146 ILogger]: Start isEmpty. Operand 458 states and 458 transitions. [2019-05-23 09:34:19,524 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 458 [2019-05-23 09:34:19,524 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:19,524 INFO L146 ILogger]: trace histogram [89, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:34:19,524 INFO L146 ILogger]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:19,524 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:19,524 INFO L146 ILogger]: Analyzing trace with hash 149934050, now seen corresponding path program 89 times [2019-05-23 09:34:19,525 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:19,602 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:19,609 INFO L146 ILogger]: Trace formula consists of 641 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 09:34:19,612 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:28,394 INFO L146 ILogger]: Checked inductivity of 19669 backedges. 0 proven. 19669 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:28,394 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:28,394 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2019-05-23 09:34:28,395 INFO L146 ILogger]: Interpolant automaton has 181 states [2019-05-23 09:34:28,396 INFO L146 ILogger]: Constructing interpolant automaton starting with 181 interpolants. [2019-05-23 09:34:28,397 INFO L146 ILogger]: CoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 09:34:28,398 INFO L146 ILogger]: Start difference. First operand 458 states and 458 transitions. Second operand 181 states.