java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:03:37,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:03:37,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:03:37,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:03:37,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:03:37,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:03:37,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:03:37,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:03:37,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:03:37,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:03:37,404 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:03:37,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:03:37,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:03:37,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:03:37,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:03:37,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:03:37,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:03:37,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:03:37,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:03:37,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:03:37,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:03:37,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:03:37,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:03:37,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:03:37,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:03:37,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:03:37,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:03:37,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:03:37,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:03:37,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:03:37,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:03:37,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:03:37,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:03:37,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:03:37,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:03:37,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:03:37,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:03:37,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:03:37,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:03:37,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:03:37,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:03:37,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:03:37,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:03:37,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:03:37,519 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:03:37,520 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:03:37,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2019-08-05 11:03:37,521 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl' [2019-08-05 11:03:37,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:03:37,565 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:03:37,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:37,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:03:37,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:03:37,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:03:37,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:03:37,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:03:37,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:03:37,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/1) ... [2019-08-05 11:03:37,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:03:37,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:03:37,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:03:37,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:03:37,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (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:1024 -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:1024 -smt2 -in -t:12000 [2019-08-05 11:03:37,690 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:03:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:03:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:03:38,165 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:03:38,165 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:03:38,167 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:38 BoogieIcfgContainer [2019-08-05 11:03:38,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:03:38,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:03:38,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:03:38,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:03:38,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:03:37" (1/2) ... [2019-08-05 11:03:38,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663d6d97 and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:03:38, skipping insertion in model container [2019-08-05 11:03:38,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:03:38" (2/2) ... [2019-08-05 11:03:38,177 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2019-08-05 11:03:38,186 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:03:38,194 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:03:38,210 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:03:38,234 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:03:38,235 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:03:38,235 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:03:38,235 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:03:38,235 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:03:38,235 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:03:38,236 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:03:38,236 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:03:38,236 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:03:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:03:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:03:38,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:38,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:03:38,261 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash 28697802, now seen corresponding path program 1 times [2019-08-05 11:03:38,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:38,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:03:38,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:38,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:38,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:38,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:38,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:38,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:03:38,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:38,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:38,667 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 5 states. [2019-08-05 11:03:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:39,070 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 11:03:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:03:39,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:03:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:39,104 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:03:39,104 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:03:39,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:03:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2019-08-05 11:03:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:03:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:03:39,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 11:03:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:39,150 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:03:39,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:03:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:03:39,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:39,151 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 11:03:39,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1808836260, now seen corresponding path program 1 times [2019-08-05 11:03:39,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:39,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:03:39,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:39,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:39,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:39,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:39,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:39,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:39,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:39,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:39,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:39,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:39,500 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2019-08-05 11:03:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:40,047 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-08-05 11:03:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:40,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:03:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:40,049 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:03:40,049 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:03:40,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:03:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-08-05 11:03:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:03:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 11:03:40,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-08-05 11:03:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:40,055 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 11:03:40,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 11:03:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:03:40,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:40,056 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-08-05 11:03:40,056 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1170056706, now seen corresponding path program 2 times [2019-08-05 11:03:40,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:40,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:03:40,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:40,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:40,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:03:40,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:03:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:03:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:03:40,292 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 11:03:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:40,443 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:03:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:40,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:03:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:40,447 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:03:40,447 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:03:40,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:03:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-08-05 11:03:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:03:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-08-05 11:03:40,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 9 [2019-08-05 11:03:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:40,453 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-08-05 11:03:40,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:03:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2019-08-05 11:03:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:03:40,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:40,454 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:03:40,454 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1004766845, now seen corresponding path program 1 times [2019-08-05 11:03:40,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:40,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:03:40,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:03:40,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:03:40,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:03:40,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:03:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:03:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:03:40,675 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 4 states. [2019-08-05 11:03:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:40,789 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:03:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:03:40,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 11:03:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:40,791 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:03:40,791 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:03:40,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:03:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:03:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:03:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 11:03:40,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2019-08-05 11:03:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:40,796 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 11:03:40,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:03:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 11:03:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:03:40,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:40,797 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1] [2019-08-05 11:03:40,797 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1366355933, now seen corresponding path program 2 times [2019-08-05 11:03:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:40,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:03:40,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:03:41,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:03:41,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:03:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:03:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:03:41,026 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 5 states. [2019-08-05 11:03:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:41,076 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:03:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:03:41,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 11:03:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:41,079 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:03:41,079 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:03:41,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:03:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:03:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:03:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:03:41,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-08-05 11:03:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:41,084 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:03:41,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:03:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:03:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:03:41,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:41,085 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1] [2019-08-05 11:03:41,086 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:41,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash -612288585, now seen corresponding path program 3 times [2019-08-05 11:03:41,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:41,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:03:41,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:41,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:41,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:03:41,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:03:41,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:03:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:03:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:41,390 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-08-05 11:03:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:41,795 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-05 11:03:41,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:03:41,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 11:03:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:41,797 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:03:41,797 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:03:41,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:03:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-08-05 11:03:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:03:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 11:03:41,801 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2019-08-05 11:03:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:41,801 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 11:03:41,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:03:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 11:03:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:03:41,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:41,803 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1] [2019-08-05 11:03:41,803 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1241681, now seen corresponding path program 4 times [2019-08-05 11:03:41,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:41,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:03:41,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:03:41,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:03:41,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:03:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:03:41,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:03:41,963 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-05 11:03:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:42,115 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-08-05 11:03:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:42,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-08-05 11:03:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:42,116 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:03:42,116 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:03:42,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:03:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:03:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:03:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-08-05 11:03:42,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2019-08-05 11:03:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:42,122 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-08-05 11:03:42,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:03:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-08-05 11:03:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:03:42,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:42,123 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 3, 2, 1, 1, 1] [2019-08-05 11:03:42,123 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1016661770, now seen corresponding path program 5 times [2019-08-05 11:03:42,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:42,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:03:42,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 11:03:42,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:42,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:03:42,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:03:42,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:03:42,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:03:42,270 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-08-05 11:03:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:42,371 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 11:03:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:03:42,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 11:03:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:42,373 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:03:42,373 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:03:42,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:03:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:03:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:03:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 11:03:42,380 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2019-08-05 11:03:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:42,381 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 11:03:42,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:03:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 11:03:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:03:42,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:42,382 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 3, 2, 1, 1, 1] [2019-08-05 11:03:42,382 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash 704350116, now seen corresponding path program 6 times [2019-08-05 11:03:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:03:42,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:42,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:42,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:42,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:42,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:42,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:03:42,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:42,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:03:42,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:03:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:03:42,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:42,758 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2019-08-05 11:03:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:43,237 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-08-05 11:03:43,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:43,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 11:03:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:43,239 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:03:43,239 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:03:43,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:03:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-08-05 11:03:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:03:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 11:03:43,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2019-08-05 11:03:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:43,244 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 11:03:43,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:03:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 11:03:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:03:43,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:43,245 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 3, 2, 1, 1, 1] [2019-08-05 11:03:43,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1724318978, now seen corresponding path program 7 times [2019-08-05 11:03:43,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:43,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:03:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 25 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-08-05 11:03:43,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:03:43,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:03:43,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:03:43,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:43,454 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2019-08-05 11:03:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:43,745 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-08-05 11:03:43,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:43,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 11:03:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:43,747 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:03:43,747 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:03:43,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:03:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-08-05 11:03:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:03:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-08-05 11:03:43,752 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2019-08-05 11:03:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-08-05 11:03:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:03:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-08-05 11:03:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:03:43,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:43,754 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 4, 3, 1, 1, 1] [2019-08-05 11:03:43,755 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash -481213295, now seen corresponding path program 8 times [2019-08-05 11:03:43,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:43,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:03:43,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 119 proven. 52 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 11:03:43,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:03:43,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:03:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:03:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:03:43,947 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 9 states. [2019-08-05 11:03:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:44,063 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 11:03:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:03:44,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-08-05 11:03:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:44,066 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:03:44,066 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:03:44,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:03:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:03:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:03:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 11:03:44,070 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2019-08-05 11:03:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:44,071 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 11:03:44,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:03:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 11:03:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:03:44,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:44,072 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 4, 3, 1, 1, 1] [2019-08-05 11:03:44,073 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1057083243, now seen corresponding path program 9 times [2019-08-05 11:03:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:44,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:03:44,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:44,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:44,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:44,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:44,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:44,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-08-05 11:03:44,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:44,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:03:44,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:03:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:03:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:03:44,412 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2019-08-05 11:03:44,630 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-08-05 11:03:44,885 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-08-05 11:03:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:45,189 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-08-05 11:03:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:03:45,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-08-05 11:03:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:45,193 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:03:45,193 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:03:45,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:03:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-08-05 11:03:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:03:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-08-05 11:03:45,198 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2019-08-05 11:03:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:45,198 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-08-05 11:03:45,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:03:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-08-05 11:03:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:03:45,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:45,200 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 4, 3, 1, 1, 1] [2019-08-05 11:03:45,200 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2050200315, now seen corresponding path program 10 times [2019-08-05 11:03:45,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:45,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:03:45,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 39 proven. 196 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 11:03:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:45,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:45,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:45,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:45,434 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 12 states. [2019-08-05 11:03:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:45,893 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-08-05 11:03:45,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:03:45,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-08-05 11:03:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:45,894 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:03:45,894 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:03:45,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:03:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:03:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-08-05 11:03:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:03:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-08-05 11:03:45,900 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 39 [2019-08-05 11:03:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:45,901 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-08-05 11:03:45,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-08-05 11:03:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:03:45,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:45,902 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 5, 4, 1, 1, 1] [2019-08-05 11:03:45,902 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:45,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:45,903 INFO L82 PathProgramCache]: Analyzing trace with hash -826210830, now seen corresponding path program 11 times [2019-08-05 11:03:45,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:45,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:03:45,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 263 proven. 112 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-08-05 11:03:46,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:46,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:46,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:46,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:46,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:46,468 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 11 states. [2019-08-05 11:03:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:46,623 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 11:03:46,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:03:46,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-08-05 11:03:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:46,624 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:03:46,624 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:03:46,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:03:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:03:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:03:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 11:03:46,629 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-08-05 11:03:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:46,630 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 11:03:46,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 11:03:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:03:46,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:46,631 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 5, 4, 1, 1, 1] [2019-08-05 11:03:46,631 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 207228044, now seen corresponding path program 12 times [2019-08-05 11:03:46,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:46,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:03:46,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:46,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:46,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:46,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:46,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:46,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-08-05 11:03:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:47,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:03:47,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:03:47,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:03:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:03:47,244 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2019-08-05 11:03:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:47,777 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-08-05 11:03:47,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:47,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-08-05 11:03:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:47,778 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:03:47,779 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:03:47,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:03:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-08-05 11:03:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:03:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-08-05 11:03:47,785 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2019-08-05 11:03:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:47,786 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-08-05 11:03:47,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:03:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-08-05 11:03:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:03:47,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:47,787 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 5, 4, 1, 1, 1] [2019-08-05 11:03:47,787 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1577706982, now seen corresponding path program 13 times [2019-08-05 11:03:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:47,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:03:47,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 56 proven. 410 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-08-05 11:03:49,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:49,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:49,040 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 14 states. [2019-08-05 11:03:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:49,609 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-08-05 11:03:49,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:03:49,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-08-05 11:03:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:49,610 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:03:49,610 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:03:49,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=411, Invalid=1071, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:03:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:03:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-08-05 11:03:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:03:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-08-05 11:03:49,625 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 53 [2019-08-05 11:03:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:49,626 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-08-05 11:03:49,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-08-05 11:03:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:03:49,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:49,627 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 6, 5, 1, 1, 1] [2019-08-05 11:03:49,628 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1819652819, now seen corresponding path program 14 times [2019-08-05 11:03:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:49,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:03:49,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 506 proven. 203 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 11:03:50,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:50,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:50,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:50,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:50,009 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 13 states. [2019-08-05 11:03:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:50,190 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 11:03:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:03:50,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-08-05 11:03:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:50,194 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:03:50,194 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:03:50,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:03:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:03:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:03:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-08-05 11:03:50,199 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2019-08-05 11:03:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:50,199 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-08-05 11:03:50,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-08-05 11:03:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:03:50,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:50,201 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 6, 5, 1, 1, 1] [2019-08-05 11:03:50,201 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1529725191, now seen corresponding path program 15 times [2019-08-05 11:03:50,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:50,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:03:50,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:50,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:50,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:50,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:50,690 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 11:03:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-08-05 11:03:51,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:03:51,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:03:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:03:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:03:51,049 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 12 states. [2019-08-05 11:03:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:51,503 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-08-05 11:03:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:03:51,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-08-05 11:03:51,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:51,504 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:03:51,504 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:03:51,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:03:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:03:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2019-08-05 11:03:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:03:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-08-05 11:03:51,509 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2019-08-05 11:03:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:51,510 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-08-05 11:03:51,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:03:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-08-05 11:03:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:03:51,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:51,511 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 6, 5, 1, 1, 1] [2019-08-05 11:03:51,511 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1187145633, now seen corresponding path program 16 times [2019-08-05 11:03:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:51,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:03:51,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 76 proven. 755 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-08-05 11:03:51,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:51,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:03:51,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:03:51,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:03:51,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:03:51,799 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 16 states. [2019-08-05 11:03:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:52,381 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-08-05 11:03:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:03:52,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2019-08-05 11:03:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:52,383 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:03:52,383 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:03:52,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=620, Invalid=1732, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:03:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:03:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-08-05 11:03:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:03:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-08-05 11:03:52,387 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 69 [2019-08-05 11:03:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:52,388 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-08-05 11:03:52,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:03:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-08-05 11:03:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:03:52,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:52,389 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 7, 6, 1, 1, 1] [2019-08-05 11:03:52,389 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1421205698, now seen corresponding path program 17 times [2019-08-05 11:03:52,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:52,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:03:52,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 885 proven. 331 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-08-05 11:03:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:03:52,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:03:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:03:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:03:52,638 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 15 states. [2019-08-05 11:03:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:52,935 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-05 11:03:52,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:52,935 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2019-08-05 11:03:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:52,936 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:03:52,937 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:03:52,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:03:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:03:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:03:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-08-05 11:03:52,942 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-08-05 11:03:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:52,942 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-08-05 11:03:52,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:03:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-08-05 11:03:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:03:52,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:52,943 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 7, 6, 1, 1, 1] [2019-08-05 11:03:52,944 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:52,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1148064604, now seen corresponding path program 18 times [2019-08-05 11:03:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:53,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:03:53,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:53,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:53,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:53,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:53,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:53,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-08-05 11:03:53,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:53,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:03:53,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:03:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:03:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:03:53,694 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 13 states. [2019-08-05 11:03:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:54,260 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2019-08-05 11:03:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:03:54,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2019-08-05 11:03:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:54,262 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:03:54,262 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:03:54,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:03:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:03:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-08-05 11:03:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:03:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-08-05 11:03:54,266 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2019-08-05 11:03:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:54,266 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-08-05 11:03:54,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:03:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-08-05 11:03:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:03:54,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:54,267 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 7, 6, 1, 1, 1] [2019-08-05 11:03:54,268 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash -516458314, now seen corresponding path program 19 times [2019-08-05 11:03:54,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:54,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:03:54,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 99 proven. 1274 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-08-05 11:03:54,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:54,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:03:54,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:54,584 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 18 states. [2019-08-05 11:03:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:55,633 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2019-08-05 11:03:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:03:55,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-08-05 11:03:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:55,636 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:03:55,636 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:03:55,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=895, Invalid=2645, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:03:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:03:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-08-05 11:03:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:03:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2019-08-05 11:03:55,640 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 87 [2019-08-05 11:03:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:55,641 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2019-08-05 11:03:55,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2019-08-05 11:03:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:03:55,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:55,642 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 8, 7, 1, 1, 1] [2019-08-05 11:03:55,642 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:55,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:55,642 INFO L82 PathProgramCache]: Analyzing trace with hash -186397775, now seen corresponding path program 20 times [2019-08-05 11:03:55,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:55,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:03:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2156 backedges. 1443 proven. 502 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-08-05 11:03:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:03:56,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:03:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:03:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:03:56,250 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 17 states. [2019-08-05 11:03:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:56,475 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 11:03:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:03:56,475 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-08-05 11:03:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:56,476 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:03:56,476 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:03:56,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:03:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:03:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:03:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:03:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 11:03:56,480 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 103 [2019-08-05 11:03:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:56,480 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 11:03:56,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:03:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 11:03:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:03:56,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:56,482 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 8, 7, 1, 1, 1] [2019-08-05 11:03:56,482 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -672903541, now seen corresponding path program 21 times [2019-08-05 11:03:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:56,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:03:56,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:56,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:56,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:56,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:03:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2249 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 1484 trivial. 0 not checked. [2019-08-05 11:03:57,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:57,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:03:57,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:03:57,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:03:57,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:03:57,108 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 14 states. [2019-08-05 11:03:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:57,757 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-08-05 11:03:57,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:03:57,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-08-05 11:03:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:57,759 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:03:57,759 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:03:57,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:03:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:03:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-08-05 11:03:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:03:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-08-05 11:03:57,764 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2019-08-05 11:03:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:57,764 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-08-05 11:03:57,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:03:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-08-05 11:03:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:03:57,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:57,766 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 8, 7, 1, 1, 1] [2019-08-05 11:03:57,766 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1879811109, now seen corresponding path program 22 times [2019-08-05 11:03:57,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:57,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:03:57,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2344 backedges. 125 proven. 2016 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-08-05 11:03:58,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:58,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:03:58,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:03:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:03:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:58,351 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 20 states. [2019-08-05 11:03:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:59,311 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-08-05 11:03:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:03:59,312 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 107 [2019-08-05 11:03:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:59,314 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:03:59,314 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:03:59,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1248, Invalid=3864, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:03:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:03:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-08-05 11:03:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:03:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2019-08-05 11:03:59,318 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 107 [2019-08-05 11:03:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:59,319 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2019-08-05 11:03:59,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:03:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2019-08-05 11:03:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:03:59,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:59,320 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 9, 8, 1, 1, 1] [2019-08-05 11:03:59,320 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 406863226, now seen corresponding path program 23 times [2019-08-05 11:03:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:59,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:03:59,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 2229 proven. 722 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-08-05 11:03:59,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:59,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:03:59,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:03:59,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:03:59,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:59,793 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 19 states. [2019-08-05 11:04:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:00,134 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-05 11:04:00,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:00,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 125 [2019-08-05 11:04:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:00,136 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:04:00,136 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:04:00,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:04:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 11:04:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:04:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-08-05 11:04:00,141 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-08-05 11:04:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:00,141 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-08-05 11:04:00,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-08-05 11:04:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:04:00,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:00,142 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 9, 8, 1, 1, 1] [2019-08-05 11:04:00,142 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1953415700, now seen corresponding path program 24 times [2019-08-05 11:04:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:00,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:04:00,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:00,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:00,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:00,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:00,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3358 backedges. 0 proven. 1050 refuted. 0 times theorem prover too weak. 2308 trivial. 0 not checked. [2019-08-05 11:04:00,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:00,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:04:00,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:04:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:04:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:00,653 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 15 states. [2019-08-05 11:04:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:01,349 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2019-08-05 11:04:01,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:04:01,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2019-08-05 11:04:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:01,351 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:04:01,351 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:04:01,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:04:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-08-05 11:04:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:04:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-08-05 11:04:01,355 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2019-08-05 11:04:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:01,355 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-08-05 11:04:01,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:04:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-08-05 11:04:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:04:01,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:01,356 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 9, 8, 1, 1, 1] [2019-08-05 11:04:01,357 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:01,357 INFO L82 PathProgramCache]: Analyzing trace with hash 331831662, now seen corresponding path program 25 times [2019-08-05 11:04:01,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:01,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:04:01,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3474 backedges. 154 proven. 3036 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-08-05 11:04:01,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:01,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:01,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:01,889 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 22 states. [2019-08-05 11:04:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:03,599 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-08-05 11:04:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:04:03,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 129 [2019-08-05 11:04:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:03,601 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:04:03,601 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:04:03,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1692, Invalid=5448, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:04:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:04:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-08-05 11:04:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:04:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-08-05 11:04:03,606 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 129 [2019-08-05 11:04:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:03,607 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-08-05 11:04:03,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-08-05 11:04:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:04:03,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:03,608 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 10, 9, 1, 1, 1] [2019-08-05 11:04:03,608 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:03,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1049938461, now seen corresponding path program 26 times [2019-08-05 11:04:03,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:03,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:04:03,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4689 backedges. 3298 proven. 997 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-08-05 11:04:04,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:04,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:04,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:04,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:04,079 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 21 states. [2019-08-05 11:04:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:04,442 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-08-05 11:04:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:04,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 149 [2019-08-05 11:04:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:04,443 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:04:04,443 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:04:04,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=600, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:04:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 11:04:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:04:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-08-05 11:04:04,447 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2019-08-05 11:04:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:04,448 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-08-05 11:04:04,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-08-05 11:04:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:04:04,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:04,449 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 10, 9, 1, 1, 1] [2019-08-05 11:04:04,449 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1564343817, now seen corresponding path program 27 times [2019-08-05 11:04:04,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:04,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:04:04,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:05,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:05,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:05,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:05,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 1397 refuted. 0 times theorem prover too weak. 3429 trivial. 0 not checked. [2019-08-05 11:04:05,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:05,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:04:05,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:04:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:04:05,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:05,442 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 16 states. [2019-08-05 11:04:05,962 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-08-05 11:04:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:06,294 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2019-08-05 11:04:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:04:06,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 151 [2019-08-05 11:04:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:06,296 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:04:06,296 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:04:06,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=633, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:04:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2019-08-05 11:04:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:04:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-08-05 11:04:06,302 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2019-08-05 11:04:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:06,302 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-08-05 11:04:06,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:04:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-08-05 11:04:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:04:06,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:06,303 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 10, 9, 1, 1, 1] [2019-08-05 11:04:06,303 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:06,304 INFO L82 PathProgramCache]: Analyzing trace with hash -95802223, now seen corresponding path program 28 times [2019-08-05 11:04:06,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:06,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:04:06,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4965 backedges. 186 proven. 4395 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-08-05 11:04:07,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:07,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:07,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:07,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:07,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:07,809 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 24 states. [2019-08-05 11:04:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:09,383 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2019-08-05 11:04:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:04:09,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 153 [2019-08-05 11:04:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:09,385 INFO L225 Difference]: With dead ends: 180 [2019-08-05 11:04:09,385 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:04:09,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3721 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2241, Invalid=7461, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:04:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:04:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-08-05 11:04:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:04:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 181 transitions. [2019-08-05 11:04:09,394 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 181 transitions. Word has length 153 [2019-08-05 11:04:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:09,394 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 181 transitions. [2019-08-05 11:04:09,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:04:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 181 transitions. [2019-08-05 11:04:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:04:09,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:09,395 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 11, 10, 1, 1, 1] [2019-08-05 11:04:09,396 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash 732301850, now seen corresponding path program 29 times [2019-08-05 11:04:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:09,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:04:09,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6560 backedges. 4711 proven. 1333 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-08-05 11:04:10,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:10,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:10,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:10,223 INFO L87 Difference]: Start difference. First operand 178 states and 181 transitions. Second operand 23 states. [2019-08-05 11:04:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:10,628 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2019-08-05 11:04:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:10,628 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 175 [2019-08-05 11:04:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:10,630 INFO L225 Difference]: With dead ends: 178 [2019-08-05 11:04:10,630 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 11:04:10,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:04:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 11:04:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 11:04:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:04:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-08-05 11:04:10,635 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-08-05 11:04:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:10,635 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-08-05 11:04:10,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-08-05 11:04:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:04:10,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:10,637 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 11, 10, 1, 1, 1] [2019-08-05 11:04:10,637 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash -589396300, now seen corresponding path program 30 times [2019-08-05 11:04:10,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:11,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:04:11,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:11,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:11,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:11,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:11,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:11,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 0 proven. 1812 refuted. 0 times theorem prover too weak. 4910 trivial. 0 not checked. [2019-08-05 11:04:12,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:12,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:04:12,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:04:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:04:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:12,076 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 17 states. [2019-08-05 11:04:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:12,952 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-08-05 11:04:12,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:12,953 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 177 [2019-08-05 11:04:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:12,954 INFO L225 Difference]: With dead ends: 184 [2019-08-05 11:04:12,954 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:04:12,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:04:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:04:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-08-05 11:04:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:04:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2019-08-05 11:04:12,959 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 177 [2019-08-05 11:04:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:12,960 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2019-08-05 11:04:12,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:04:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2019-08-05 11:04:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:04:12,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:12,961 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 11, 10, 1, 1, 1] [2019-08-05 11:04:12,962 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash 525891086, now seen corresponding path program 31 times [2019-08-05 11:04:12,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:13,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:13,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6886 backedges. 221 proven. 6160 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-08-05 11:04:13,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:13,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:04:13,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:04:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:04:13,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:04:13,748 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 26 states. [2019-08-05 11:04:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:15,424 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-08-05 11:04:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:04:15,424 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-08-05 11:04:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:15,426 INFO L225 Difference]: With dead ends: 208 [2019-08-05 11:04:15,426 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 11:04:15,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5111 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2910, Invalid=9972, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:04:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 11:04:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-08-05 11:04:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:04:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 209 transitions. [2019-08-05 11:04:15,434 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 209 transitions. Word has length 179 [2019-08-05 11:04:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:15,435 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 209 transitions. [2019-08-05 11:04:15,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:04:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 209 transitions. [2019-08-05 11:04:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:04:15,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:15,436 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 12, 11, 1, 1, 1] [2019-08-05 11:04:15,437 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2031773071, now seen corresponding path program 32 times [2019-08-05 11:04:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:15,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 2213 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:04:15,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 6535 proven. 1736 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2019-08-05 11:04:16,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:16,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:04:16,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:04:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:04:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:16,313 INFO L87 Difference]: Start difference. First operand 206 states and 209 transitions. Second operand 25 states. [2019-08-05 11:04:17,320 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:04:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:17,586 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2019-08-05 11:04:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:04:17,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 203 [2019-08-05 11:04:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:17,590 INFO L225 Difference]: With dead ends: 206 [2019-08-05 11:04:17,590 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 11:04:17,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:04:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 11:04:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-05 11:04:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:04:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-08-05 11:04:17,594 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-08-05 11:04:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:17,595 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-08-05 11:04:17,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:04:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-08-05 11:04:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 11:04:17,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:17,596 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 12, 11, 1, 1, 1] [2019-08-05 11:04:17,597 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash 155364683, now seen corresponding path program 33 times [2019-08-05 11:04:17,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:04:19,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:19,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:19,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:19,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:19,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:19,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9121 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 6820 trivial. 0 not checked. [2019-08-05 11:04:20,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:20,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:20,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:20,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:20,047 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 18 states. [2019-08-05 11:04:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:20,957 INFO L93 Difference]: Finished difference Result 212 states and 215 transitions. [2019-08-05 11:04:20,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:20,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 205 [2019-08-05 11:04:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:20,959 INFO L225 Difference]: With dead ends: 212 [2019-08-05 11:04:20,959 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 11:04:20,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=386, Invalid=804, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 11:04:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2019-08-05 11:04:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:04:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2019-08-05 11:04:20,964 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 205 [2019-08-05 11:04:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:20,964 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2019-08-05 11:04:20,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2019-08-05 11:04:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:04:20,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:20,965 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 12, 11, 1, 1, 1] [2019-08-05 11:04:20,966 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1018342683, now seen corresponding path program 34 times [2019-08-05 11:04:20,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:21,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:04:21,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 259 proven. 8404 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-08-05 11:04:21,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:21,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:04:21,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:04:21,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:04:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:04:21,990 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 28 states. [2019-08-05 11:04:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:24,543 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-08-05 11:04:24,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:04:24,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 207 [2019-08-05 11:04:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:24,546 INFO L225 Difference]: With dead ends: 238 [2019-08-05 11:04:24,546 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 11:04:24,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6854 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3715, Invalid=13055, Unknown=0, NotChecked=0, Total=16770 [2019-08-05 11:04:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 11:04:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-08-05 11:04:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 11:04:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2019-08-05 11:04:24,552 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 207 [2019-08-05 11:04:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:24,552 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2019-08-05 11:04:24,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:04:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2019-08-05 11:04:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-08-05 11:04:24,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:24,554 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 13, 12, 1, 1, 1] [2019-08-05 11:04:24,554 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 207125666, now seen corresponding path program 35 times [2019-08-05 11:04:24,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:24,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:04:24,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 8843 proven. 2212 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2019-08-05 11:04:25,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:25,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:04:25,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:04:25,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:04:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:25,092 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand 27 states. [2019-08-05 11:04:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:25,633 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2019-08-05 11:04:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:04:25,633 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 233 [2019-08-05 11:04:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:25,635 INFO L225 Difference]: With dead ends: 236 [2019-08-05 11:04:25,635 INFO L226 Difference]: Without dead ends: 236 [2019-08-05 11:04:25,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=546, Invalid=1014, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:04:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-08-05 11:04:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-08-05 11:04:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 11:04:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2019-08-05 11:04:25,640 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 233 [2019-08-05 11:04:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:25,640 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2019-08-05 11:04:25,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:04:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2019-08-05 11:04:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-05 11:04:25,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:25,642 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 13, 12, 1, 1, 1] [2019-08-05 11:04:25,642 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 196679484, now seen corresponding path program 36 times [2019-08-05 11:04:25,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 2549 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:26,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:26,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:26,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12104 backedges. 0 proven. 2870 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-08-05 11:04:26,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:26,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:26,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:26,647 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 19 states. [2019-08-05 11:04:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:27,822 INFO L93 Difference]: Finished difference Result 242 states and 245 transitions. [2019-08-05 11:04:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:27,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 235 [2019-08-05 11:04:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:27,825 INFO L225 Difference]: With dead ends: 242 [2019-08-05 11:04:27,825 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 11:04:27,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=897, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:04:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 11:04:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2019-08-05 11:04:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 11:04:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2019-08-05 11:04:27,830 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 235 [2019-08-05 11:04:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:27,830 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2019-08-05 11:04:27,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2019-08-05 11:04:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-08-05 11:04:27,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:27,832 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 13, 12, 1, 1, 1] [2019-08-05 11:04:27,832 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash 30475414, now seen corresponding path program 37 times [2019-08-05 11:04:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:28,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:04:28,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 300 proven. 11206 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-08-05 11:04:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:28,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:04:28,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:04:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:04:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:04:28,458 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand 30 states. [2019-08-05 11:04:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:31,064 INFO L93 Difference]: Finished difference Result 270 states and 273 transitions. [2019-08-05 11:04:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-08-05 11:04:31,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 237 [2019-08-05 11:04:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:31,066 INFO L225 Difference]: With dead ends: 270 [2019-08-05 11:04:31,067 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 11:04:31,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9005 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4673, Invalid=16789, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 11:04:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 11:04:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2019-08-05 11:04:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 11:04:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-08-05 11:04:31,074 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 237 [2019-08-05 11:04:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:31,075 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-08-05 11:04:31,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:04:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-08-05 11:04:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-08-05 11:04:31,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:31,077 INFO L399 BasicCegarLoop]: trace histogram [118, 117, 14, 13, 1, 1, 1] [2019-08-05 11:04:31,077 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:31,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1365890733, now seen corresponding path program 38 times [2019-08-05 11:04:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:31,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 2865 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:04:31,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15509 backedges. 11714 proven. 2767 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-08-05 11:04:31,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:31,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:04:31,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:04:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:04:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:31,896 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 29 states. [2019-08-05 11:04:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:32,541 INFO L93 Difference]: Finished difference Result 268 states and 269 transitions. [2019-08-05 11:04:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:04:32,541 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 265 [2019-08-05 11:04:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:32,543 INFO L225 Difference]: With dead ends: 268 [2019-08-05 11:04:32,543 INFO L226 Difference]: Without dead ends: 268 [2019-08-05 11:04:32,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=1176, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:04:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-08-05 11:04:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-08-05 11:04:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 11:04:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 269 transitions. [2019-08-05 11:04:32,548 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 269 transitions. Word has length 265 [2019-08-05 11:04:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:32,549 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 269 transitions. [2019-08-05 11:04:32,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:04:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 269 transitions. [2019-08-05 11:04:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 11:04:32,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:32,550 INFO L399 BasicCegarLoop]: trace histogram [119, 118, 14, 13, 1, 1, 1] [2019-08-05 11:04:32,551 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1602524537, now seen corresponding path program 39 times [2019-08-05 11:04:32,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:33,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 2885 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:04:33,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:33,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:33,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:33,635 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:04:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15758 backedges. 0 proven. 3525 refuted. 0 times theorem prover too weak. 12233 trivial. 0 not checked. [2019-08-05 11:04:34,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:34,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:34,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:34,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:34,292 INFO L87 Difference]: Start difference. First operand 268 states and 269 transitions. Second operand 20 states. [2019-08-05 11:04:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:35,334 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-08-05 11:04:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:35,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 267 [2019-08-05 11:04:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:35,337 INFO L225 Difference]: With dead ends: 274 [2019-08-05 11:04:35,337 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 11:04:35,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=487, Invalid=995, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:04:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 11:04:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2019-08-05 11:04:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-08-05 11:04:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2019-08-05 11:04:35,342 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 267 [2019-08-05 11:04:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:35,342 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 272 transitions. [2019-08-05 11:04:35,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 272 transitions. [2019-08-05 11:04:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-08-05 11:04:35,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:35,344 INFO L399 BasicCegarLoop]: trace histogram [120, 119, 14, 13, 1, 1, 1] [2019-08-05 11:04:35,344 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1867231521, now seen corresponding path program 40 times [2019-08-05 11:04:35,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:35,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 2905 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:04:35,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16009 backedges. 344 proven. 14651 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-08-05 11:04:36,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:36,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:04:36,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:04:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:04:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:04:36,103 INFO L87 Difference]: Start difference. First operand 270 states and 272 transitions. Second operand 32 states. [2019-08-05 11:04:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:39,218 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-08-05 11:04:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-08-05 11:04:39,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 269 [2019-08-05 11:04:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:39,221 INFO L225 Difference]: With dead ends: 304 [2019-08-05 11:04:39,221 INFO L226 Difference]: Without dead ends: 304 [2019-08-05 11:04:39,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11623 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5802, Invalid=21258, Unknown=0, NotChecked=0, Total=27060 [2019-08-05 11:04:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-08-05 11:04:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2019-08-05 11:04:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-08-05 11:04:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 305 transitions. [2019-08-05 11:04:39,228 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 305 transitions. Word has length 269 [2019-08-05 11:04:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:39,228 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 305 transitions. [2019-08-05 11:04:39,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:04:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 305 transitions. [2019-08-05 11:04:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-08-05 11:04:39,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:39,230 INFO L399 BasicCegarLoop]: trace histogram [134, 133, 15, 14, 1, 1, 1] [2019-08-05 11:04:39,231 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:39,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2067403538, now seen corresponding path program 41 times [2019-08-05 11:04:39,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:39,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 3221 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:04:39,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19894 backedges. 15233 proven. 3407 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-08-05 11:04:39,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:39,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:04:39,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:04:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:04:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:39,970 INFO L87 Difference]: Start difference. First operand 302 states and 305 transitions. Second operand 31 states. [2019-08-05 11:04:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:40,583 INFO L93 Difference]: Finished difference Result 302 states and 303 transitions. [2019-08-05 11:04:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:04:40,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 299 [2019-08-05 11:04:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:40,585 INFO L225 Difference]: With dead ends: 302 [2019-08-05 11:04:40,585 INFO L226 Difference]: Without dead ends: 302 [2019-08-05 11:04:40,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:04:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-08-05 11:04:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-08-05 11:04:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-08-05 11:04:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2019-08-05 11:04:40,590 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 299 [2019-08-05 11:04:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:40,590 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2019-08-05 11:04:40,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:04:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2019-08-05 11:04:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-08-05 11:04:40,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:40,592 INFO L399 BasicCegarLoop]: trace histogram [135, 134, 15, 14, 1, 1, 1] [2019-08-05 11:04:40,592 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1153863252, now seen corresponding path program 42 times [2019-08-05 11:04:40,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:41,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 3241 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:04:41,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:41,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:41,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:41,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:41,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:41,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20176 backedges. 0 proven. 4272 refuted. 0 times theorem prover too weak. 15904 trivial. 0 not checked. [2019-08-05 11:04:41,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:41,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:41,969 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 21 states. [2019-08-05 11:04:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:43,078 INFO L93 Difference]: Finished difference Result 308 states and 311 transitions. [2019-08-05 11:04:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:43,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 301 [2019-08-05 11:04:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:43,080 INFO L225 Difference]: With dead ends: 308 [2019-08-05 11:04:43,080 INFO L226 Difference]: Without dead ends: 308 [2019-08-05 11:04:43,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=542, Invalid=1098, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:04:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-08-05 11:04:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-08-05 11:04:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 11:04:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2019-08-05 11:04:43,085 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 301 [2019-08-05 11:04:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:43,085 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2019-08-05 11:04:43,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2019-08-05 11:04:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 11:04:43,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:43,087 INFO L399 BasicCegarLoop]: trace histogram [136, 135, 15, 14, 1, 1, 1] [2019-08-05 11:04:43,088 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash -760970490, now seen corresponding path program 43 times [2019-08-05 11:04:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 3261 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:04:43,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20460 backedges. 391 proven. 18830 refuted. 0 times theorem prover too weak. 1239 trivial. 0 not checked. [2019-08-05 11:04:44,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:04:44,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:04:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:04:44,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:04:44,071 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 34 states. [2019-08-05 11:04:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:47,224 INFO L93 Difference]: Finished difference Result 340 states and 343 transitions. [2019-08-05 11:04:47,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-08-05 11:04:47,225 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 303 [2019-08-05 11:04:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:47,227 INFO L225 Difference]: With dead ends: 340 [2019-08-05 11:04:47,227 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 11:04:47,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14771 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7121, Invalid=26551, Unknown=0, NotChecked=0, Total=33672 [2019-08-05 11:04:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 11:04:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2019-08-05 11:04:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-08-05 11:04:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 341 transitions. [2019-08-05 11:04:47,234 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 341 transitions. Word has length 303 [2019-08-05 11:04:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:47,234 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 341 transitions. [2019-08-05 11:04:47,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:04:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 341 transitions. [2019-08-05 11:04:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-08-05 11:04:47,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:47,237 INFO L399 BasicCegarLoop]: trace histogram [151, 150, 16, 15, 1, 1, 1] [2019-08-05 11:04:47,237 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1255301329, now seen corresponding path program 44 times [2019-08-05 11:04:47,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:47,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 3597 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:04:47,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25140 backedges. 19491 proven. 4138 refuted. 0 times theorem prover too weak. 1511 trivial. 0 not checked. [2019-08-05 11:04:48,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:48,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:04:48,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:04:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:04:48,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:04:48,095 INFO L87 Difference]: Start difference. First operand 338 states and 341 transitions. Second operand 33 states. [2019-08-05 11:04:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:48,570 INFO L93 Difference]: Finished difference Result 338 states and 339 transitions. [2019-08-05 11:04:48,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:04:48,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 335 [2019-08-05 11:04:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:48,574 INFO L225 Difference]: With dead ends: 338 [2019-08-05 11:04:48,574 INFO L226 Difference]: Without dead ends: 338 [2019-08-05 11:04:48,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=816, Invalid=1536, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:04:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-08-05 11:04:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-08-05 11:04:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-08-05 11:04:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2019-08-05 11:04:48,579 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 335 [2019-08-05 11:04:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:48,580 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2019-08-05 11:04:48,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:04:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2019-08-05 11:04:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-08-05 11:04:48,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:48,582 INFO L399 BasicCegarLoop]: trace histogram [152, 151, 16, 15, 1, 1, 1] [2019-08-05 11:04:48,582 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1416403883, now seen corresponding path program 45 times [2019-08-05 11:04:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:51,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 3617 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:04:51,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:51,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:51,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:51,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:51,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:51,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:04:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 25457 backedges. 0 proven. 5117 refuted. 0 times theorem prover too weak. 20340 trivial. 0 not checked. [2019-08-05 11:04:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:51,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:51,981 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 22 states. [2019-08-05 11:04:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:53,214 INFO L93 Difference]: Finished difference Result 344 states and 347 transitions. [2019-08-05 11:04:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:04:53,215 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 337 [2019-08-05 11:04:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:53,217 INFO L225 Difference]: With dead ends: 344 [2019-08-05 11:04:53,217 INFO L226 Difference]: Without dead ends: 344 [2019-08-05 11:04:53,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=600, Invalid=1206, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:04:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-08-05 11:04:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2019-08-05 11:04:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-08-05 11:04:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 342 transitions. [2019-08-05 11:04:53,222 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 342 transitions. Word has length 337 [2019-08-05 11:04:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:53,222 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 342 transitions. [2019-08-05 11:04:53,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 342 transitions. [2019-08-05 11:04:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-08-05 11:04:53,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:53,225 INFO L399 BasicCegarLoop]: trace histogram [153, 152, 16, 15, 1, 1, 1] [2019-08-05 11:04:53,225 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -340448955, now seen corresponding path program 46 times [2019-08-05 11:04:53,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:53,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 3637 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:04:53,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 25776 backedges. 441 proven. 23840 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2019-08-05 11:04:54,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:54,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:04:54,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:04:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:04:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:04:54,082 INFO L87 Difference]: Start difference. First operand 340 states and 342 transitions. Second operand 36 states. [2019-08-05 11:04:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:58,012 INFO L93 Difference]: Finished difference Result 378 states and 381 transitions. [2019-08-05 11:04:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-08-05 11:04:58,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 339 [2019-08-05 11:04:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:58,014 INFO L225 Difference]: With dead ends: 378 [2019-08-05 11:04:58,014 INFO L226 Difference]: Without dead ends: 378 [2019-08-05 11:04:58,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18516 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=8650, Invalid=32762, Unknown=0, NotChecked=0, Total=41412 [2019-08-05 11:04:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-08-05 11:04:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-08-05 11:04:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-08-05 11:04:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 379 transitions. [2019-08-05 11:04:58,020 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 379 transitions. Word has length 339 [2019-08-05 11:04:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:58,020 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 379 transitions. [2019-08-05 11:04:58,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:04:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 379 transitions. [2019-08-05 11:04:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-08-05 11:04:58,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:58,022 INFO L399 BasicCegarLoop]: trace histogram [169, 168, 17, 16, 1, 1, 1] [2019-08-05 11:04:58,023 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1870883990, now seen corresponding path program 47 times [2019-08-05 11:04:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:58,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 3993 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:04:58,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31352 backedges. 24585 proven. 4966 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-08-05 11:04:58,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:58,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:04:58,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:04:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:04:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:58,925 INFO L87 Difference]: Start difference. First operand 376 states and 379 transitions. Second operand 35 states. [2019-08-05 11:04:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:59,587 INFO L93 Difference]: Finished difference Result 376 states and 377 transitions. [2019-08-05 11:04:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:04:59,587 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 373 [2019-08-05 11:04:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:59,589 INFO L225 Difference]: With dead ends: 376 [2019-08-05 11:04:59,589 INFO L226 Difference]: Without dead ends: 376 [2019-08-05 11:04:59,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=918, Invalid=1734, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:04:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-08-05 11:04:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-08-05 11:04:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-08-05 11:04:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-08-05 11:04:59,594 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 373 [2019-08-05 11:04:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:59,595 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-08-05 11:04:59,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:04:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-08-05 11:04:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-08-05 11:04:59,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:59,596 INFO L399 BasicCegarLoop]: trace histogram [170, 169, 17, 16, 1, 1, 1] [2019-08-05 11:04:59,597 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1714936836, now seen corresponding path program 48 times [2019-08-05 11:04:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:00,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 4013 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:05:00,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:00,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:00,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:00,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:00,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:00,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:05:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 31706 backedges. 0 proven. 6066 refuted. 0 times theorem prover too weak. 25640 trivial. 0 not checked. [2019-08-05 11:05:01,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:01,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:01,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:05:01,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:05:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:01,399 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 23 states. [2019-08-05 11:05:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:02,683 INFO L93 Difference]: Finished difference Result 382 states and 385 transitions. [2019-08-05 11:05:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:02,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 375 [2019-08-05 11:05:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:02,686 INFO L225 Difference]: With dead ends: 382 [2019-08-05 11:05:02,686 INFO L226 Difference]: Without dead ends: 382 [2019-08-05 11:05:02,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-08-05 11:05:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2019-08-05 11:05:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-08-05 11:05:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 380 transitions. [2019-08-05 11:05:02,692 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 380 transitions. Word has length 375 [2019-08-05 11:05:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:02,692 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 380 transitions. [2019-08-05 11:05:02,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:05:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 380 transitions. [2019-08-05 11:05:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-08-05 11:05:02,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:02,696 INFO L399 BasicCegarLoop]: trace histogram [171, 170, 17, 16, 1, 1, 1] [2019-08-05 11:05:02,696 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1213089954, now seen corresponding path program 49 times [2019-08-05 11:05:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:03,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 4033 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:05:03,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 32062 backedges. 494 proven. 29784 refuted. 0 times theorem prover too weak. 1784 trivial. 0 not checked. [2019-08-05 11:05:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:05:03,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:05:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:05:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:03,694 INFO L87 Difference]: Start difference. First operand 378 states and 380 transitions. Second operand 38 states. [2019-08-05 11:05:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:08,156 INFO L93 Difference]: Finished difference Result 418 states and 421 transitions. [2019-08-05 11:05:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-08-05 11:05:08,156 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 377 [2019-08-05 11:05:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:08,159 INFO L225 Difference]: With dead ends: 418 [2019-08-05 11:05:08,159 INFO L226 Difference]: Without dead ends: 418 [2019-08-05 11:05:08,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22929 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=10410, Invalid=39990, Unknown=0, NotChecked=0, Total=50400 [2019-08-05 11:05:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-08-05 11:05:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2019-08-05 11:05:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-05 11:05:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 419 transitions. [2019-08-05 11:05:08,164 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 419 transitions. Word has length 377 [2019-08-05 11:05:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:08,164 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 419 transitions. [2019-08-05 11:05:08,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:05:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 419 transitions. [2019-08-05 11:05:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-08-05 11:05:08,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:08,167 INFO L399 BasicCegarLoop]: trace histogram [188, 187, 18, 17, 1, 1, 1] [2019-08-05 11:05:08,167 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:08,167 INFO L82 PathProgramCache]: Analyzing trace with hash -464035107, now seen corresponding path program 50 times [2019-08-05 11:05:08,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:08,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 4409 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:05:08,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38641 backedges. 30618 proven. 5897 refuted. 0 times theorem prover too weak. 2126 trivial. 0 not checked. [2019-08-05 11:05:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:05:09,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:05:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:05:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:09,153 INFO L87 Difference]: Start difference. First operand 416 states and 419 transitions. Second operand 37 states. [2019-08-05 11:05:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,077 INFO L93 Difference]: Finished difference Result 416 states and 417 transitions. [2019-08-05 11:05:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:05:10,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 413 [2019-08-05 11:05:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,080 INFO L225 Difference]: With dead ends: 416 [2019-08-05 11:05:10,080 INFO L226 Difference]: Without dead ends: 416 [2019-08-05 11:05:10,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1026, Invalid=1944, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:05:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-08-05 11:05:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-08-05 11:05:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-05 11:05:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-08-05 11:05:10,086 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 413 [2019-08-05 11:05:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,086 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-08-05 11:05:10,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:05:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-08-05 11:05:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-08-05 11:05:10,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,089 INFO L399 BasicCegarLoop]: trace histogram [189, 188, 18, 17, 1, 1, 1] [2019-08-05 11:05:10,089 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash -789845321, now seen corresponding path program 51 times [2019-08-05 11:05:10,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:11,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 4429 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:05:11,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:11,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:11,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:11,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:11,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:11,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:05:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 39034 backedges. 0 proven. 7125 refuted. 0 times theorem prover too weak. 31909 trivial. 0 not checked. [2019-08-05 11:05:12,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:12,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:12,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:12,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:12,292 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 24 states. [2019-08-05 11:05:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:13,628 INFO L93 Difference]: Finished difference Result 422 states and 425 transitions. [2019-08-05 11:05:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:13,628 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 415 [2019-08-05 11:05:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:13,630 INFO L225 Difference]: With dead ends: 422 [2019-08-05 11:05:13,631 INFO L226 Difference]: Without dead ends: 422 [2019-08-05 11:05:13,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=725, Invalid=1437, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-08-05 11:05:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2019-08-05 11:05:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-08-05 11:05:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 420 transitions. [2019-08-05 11:05:13,636 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 420 transitions. Word has length 415 [2019-08-05 11:05:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:13,636 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 420 transitions. [2019-08-05 11:05:13,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 420 transitions. [2019-08-05 11:05:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-08-05 11:05:13,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:13,639 INFO L399 BasicCegarLoop]: trace histogram [190, 189, 18, 17, 1, 1, 1] [2019-08-05 11:05:13,639 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:13,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1167910225, now seen corresponding path program 52 times [2019-08-05 11:05:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 4449 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 39429 backedges. 550 proven. 36771 refuted. 0 times theorem prover too weak. 2108 trivial. 0 not checked. [2019-08-05 11:05:15,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:05:15,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:05:15,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:05:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1140, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:05:15,192 INFO L87 Difference]: Start difference. First operand 418 states and 420 transitions. Second operand 40 states. [2019-08-05 11:05:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:20,362 INFO L93 Difference]: Finished difference Result 460 states and 463 transitions. [2019-08-05 11:05:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-08-05 11:05:20,363 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 417 [2019-08-05 11:05:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:20,365 INFO L225 Difference]: With dead ends: 460 [2019-08-05 11:05:20,366 INFO L226 Difference]: Without dead ends: 460 [2019-08-05 11:05:20,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28085 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=12423, Invalid=48339, Unknown=0, NotChecked=0, Total=60762 [2019-08-05 11:05:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-08-05 11:05:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2019-08-05 11:05:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-08-05 11:05:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 461 transitions. [2019-08-05 11:05:20,374 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 461 transitions. Word has length 417 [2019-08-05 11:05:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:20,374 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 461 transitions. [2019-08-05 11:05:20,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:05:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 461 transitions. [2019-08-05 11:05:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-08-05 11:05:20,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:20,377 INFO L399 BasicCegarLoop]: trace histogram [208, 207, 19, 18, 1, 1, 1] [2019-08-05 11:05:20,378 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -384365654, now seen corresponding path program 53 times [2019-08-05 11:05:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:20,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 4845 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:05:20,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47124 backedges. 37699 proven. 6937 refuted. 0 times theorem prover too weak. 2488 trivial. 0 not checked. [2019-08-05 11:05:21,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:05:21,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:05:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:05:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:21,755 INFO L87 Difference]: Start difference. First operand 458 states and 461 transitions. Second operand 39 states. [2019-08-05 11:05:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,598 INFO L93 Difference]: Finished difference Result 458 states and 459 transitions. [2019-08-05 11:05:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:05:22,599 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 455 [2019-08-05 11:05:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,601 INFO L225 Difference]: With dead ends: 458 [2019-08-05 11:05:22,601 INFO L226 Difference]: Without dead ends: 458 [2019-08-05 11:05:22,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1140, Invalid=2166, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:05:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-08-05 11:05:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-08-05 11:05:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-08-05 11:05:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 459 transitions. [2019-08-05 11:05:22,606 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 459 transitions. Word has length 455 [2019-08-05 11:05:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,606 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 459 transitions. [2019-08-05 11:05:22,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:05:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 459 transitions. [2019-08-05 11:05:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-08-05 11:05:22,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,609 INFO L399 BasicCegarLoop]: trace histogram [209, 208, 19, 18, 1, 1, 1] [2019-08-05 11:05:22,610 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash -266345404, now seen corresponding path program 54 times [2019-08-05 11:05:22,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:25,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 4865 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:05:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:25,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:25,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:25,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:25,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:25,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:05:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 47558 backedges. 0 proven. 8300 refuted. 0 times theorem prover too weak. 39258 trivial. 0 not checked. [2019-08-05 11:05:26,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:26,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:26,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:26,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:26,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=381, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:26,351 INFO L87 Difference]: Start difference. First operand 458 states and 459 transitions. Second operand 25 states. [2019-08-05 11:05:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:27,830 INFO L93 Difference]: Finished difference Result 464 states and 467 transitions. [2019-08-05 11:05:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:27,831 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 457 [2019-08-05 11:05:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:27,833 INFO L225 Difference]: With dead ends: 464 [2019-08-05 11:05:27,834 INFO L226 Difference]: Without dead ends: 464 [2019-08-05 11:05:27,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=792, Invalid=1560, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:05:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-08-05 11:05:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-08-05 11:05:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 11:05:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 462 transitions. [2019-08-05 11:05:27,837 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 462 transitions. Word has length 457 [2019-08-05 11:05:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:27,838 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 462 transitions. [2019-08-05 11:05:27,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 462 transitions. [2019-08-05 11:05:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-08-05 11:05:27,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:27,840 INFO L399 BasicCegarLoop]: trace histogram [210, 209, 19, 18, 1, 1, 1] [2019-08-05 11:05:27,840 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1740156830, now seen corresponding path program 55 times [2019-08-05 11:05:27,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:28,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 4885 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:05:28,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47994 backedges. 609 proven. 44916 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-08-05 11:05:29,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:29,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:05:29,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:05:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:05:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:05:29,182 INFO L87 Difference]: Start difference. First operand 460 states and 462 transitions. Second operand 42 states. [2019-08-05 11:05:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,960 INFO L93 Difference]: Finished difference Result 504 states and 507 transitions. [2019-08-05 11:05:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-08-05 11:05:34,960 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 459 [2019-08-05 11:05:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,963 INFO L225 Difference]: With dead ends: 504 [2019-08-05 11:05:34,963 INFO L226 Difference]: Without dead ends: 504 [2019-08-05 11:05:34,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34063 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14712, Invalid=57918, Unknown=0, NotChecked=0, Total=72630 [2019-08-05 11:05:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-08-05 11:05:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-08-05 11:05:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-08-05 11:05:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 505 transitions. [2019-08-05 11:05:34,972 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 505 transitions. Word has length 459 [2019-08-05 11:05:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,972 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 505 transitions. [2019-08-05 11:05:34,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:05:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 505 transitions. [2019-08-05 11:05:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-08-05 11:05:34,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,975 INFO L399 BasicCegarLoop]: trace histogram [229, 228, 20, 19, 1, 1, 1] [2019-08-05 11:05:34,976 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1488604881, now seen corresponding path program 56 times [2019-08-05 11:05:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:35,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 5301 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:05:35,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 56924 backedges. 45943 proven. 8092 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2019-08-05 11:05:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:05:36,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:05:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:05:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:05:36,429 INFO L87 Difference]: Start difference. First operand 502 states and 505 transitions. Second operand 41 states. [2019-08-05 11:05:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,192 INFO L93 Difference]: Finished difference Result 502 states and 503 transitions. [2019-08-05 11:05:37,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:05:37,192 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 499 [2019-08-05 11:05:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,195 INFO L225 Difference]: With dead ends: 502 [2019-08-05 11:05:37,195 INFO L226 Difference]: Without dead ends: 502 [2019-08-05 11:05:37,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1260, Invalid=2400, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:05:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-08-05 11:05:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-08-05 11:05:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-08-05 11:05:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2019-08-05 11:05:37,200 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 499 [2019-08-05 11:05:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,200 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 503 transitions. [2019-08-05 11:05:37,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:05:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 503 transitions. [2019-08-05 11:05:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-08-05 11:05:37,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,202 INFO L399 BasicCegarLoop]: trace histogram [230, 229, 20, 19, 1, 1, 1] [2019-08-05 11:05:37,202 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1311132075, now seen corresponding path program 57 times [2019-08-05 11:05:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:53,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 5321 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:05:53,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:53,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:53,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:53,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:05:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 57401 backedges. 0 proven. 9597 refuted. 0 times theorem prover too weak. 47804 trivial. 0 not checked. [2019-08-05 11:05:54,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:54,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:54,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:54,684 INFO L87 Difference]: Start difference. First operand 502 states and 503 transitions. Second operand 26 states. [2019-08-05 11:05:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:56,355 INFO L93 Difference]: Finished difference Result 508 states and 511 transitions. [2019-08-05 11:05:56,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:05:56,356 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 501 [2019-08-05 11:05:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:56,358 INFO L225 Difference]: With dead ends: 508 [2019-08-05 11:05:56,359 INFO L226 Difference]: Without dead ends: 508 [2019-08-05 11:05:56,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=862, Invalid=1688, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:05:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-08-05 11:05:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2019-08-05 11:05:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-08-05 11:05:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 506 transitions. [2019-08-05 11:05:56,363 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 506 transitions. Word has length 501 [2019-08-05 11:05:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:56,363 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 506 transitions. [2019-08-05 11:05:56,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 506 transitions. [2019-08-05 11:05:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-08-05 11:05:56,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:56,366 INFO L399 BasicCegarLoop]: trace histogram [231, 230, 20, 19, 1, 1, 1] [2019-08-05 11:05:56,366 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1572558661, now seen corresponding path program 58 times [2019-08-05 11:05:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:57,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 5341 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:05:57,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 57880 backedges. 671 proven. 54340 refuted. 0 times theorem prover too weak. 2869 trivial. 0 not checked. [2019-08-05 11:05:57,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:05:57,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:05:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:05:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:57,857 INFO L87 Difference]: Start difference. First operand 504 states and 506 transitions. Second operand 44 states. [2019-08-05 11:06:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:04,516 INFO L93 Difference]: Finished difference Result 550 states and 553 transitions. [2019-08-05 11:06:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2019-08-05 11:06:04,516 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 503 [2019-08-05 11:06:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:04,519 INFO L225 Difference]: With dead ends: 550 [2019-08-05 11:06:04,519 INFO L226 Difference]: Without dead ends: 550 [2019-08-05 11:06:04,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40946 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=17301, Invalid=68841, Unknown=0, NotChecked=0, Total=86142 [2019-08-05 11:06:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-08-05 11:06:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-08-05 11:06:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-08-05 11:06:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 551 transitions. [2019-08-05 11:06:04,531 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 551 transitions. Word has length 503 [2019-08-05 11:06:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:04,532 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 551 transitions. [2019-08-05 11:06:04,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:06:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 551 transitions. [2019-08-05 11:06:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2019-08-05 11:06:04,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:04,535 INFO L399 BasicCegarLoop]: trace histogram [251, 250, 21, 20, 1, 1, 1] [2019-08-05 11:06:04,535 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1546399278, now seen corresponding path program 59 times [2019-08-05 11:06:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:05,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 5777 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:06:05,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 68170 backedges. 55471 proven. 9368 refuted. 0 times theorem prover too weak. 3331 trivial. 0 not checked. [2019-08-05 11:06:06,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:06,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:06:06,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:06:06,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:06:06,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:06:06,454 INFO L87 Difference]: Start difference. First operand 548 states and 551 transitions. Second operand 43 states. [2019-08-05 11:06:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:07,289 INFO L93 Difference]: Finished difference Result 548 states and 549 transitions. [2019-08-05 11:06:07,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:06:07,290 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 545 [2019-08-05 11:06:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:07,292 INFO L225 Difference]: With dead ends: 548 [2019-08-05 11:06:07,292 INFO L226 Difference]: Without dead ends: 548 [2019-08-05 11:06:07,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1386, Invalid=2646, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:06:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-08-05 11:06:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-08-05 11:06:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-08-05 11:06:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 549 transitions. [2019-08-05 11:06:07,298 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 549 transitions. Word has length 545 [2019-08-05 11:06:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:07,298 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 549 transitions. [2019-08-05 11:06:07,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:06:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 549 transitions. [2019-08-05 11:06:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-08-05 11:06:07,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:07,301 INFO L399 BasicCegarLoop]: trace histogram [252, 251, 21, 20, 1, 1, 1] [2019-08-05 11:06:07,301 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1770102676, now seen corresponding path program 60 times [2019-08-05 11:06:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:11,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 5797 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:06:11,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:11,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:11,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:11,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:11,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:11,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:06:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 68692 backedges. 0 proven. 11022 refuted. 0 times theorem prover too weak. 57670 trivial. 0 not checked. [2019-08-05 11:06:12,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:12,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:12,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:06:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:06:12,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:12,520 INFO L87 Difference]: Start difference. First operand 548 states and 549 transitions. Second operand 27 states. [2019-08-05 11:06:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:14,135 INFO L93 Difference]: Finished difference Result 554 states and 557 transitions. [2019-08-05 11:06:14,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:06:14,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 547 [2019-08-05 11:06:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:14,138 INFO L225 Difference]: With dead ends: 554 [2019-08-05 11:06:14,138 INFO L226 Difference]: Without dead ends: 554 [2019-08-05 11:06:14,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=935, Invalid=1821, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:06:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-08-05 11:06:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 550. [2019-08-05 11:06:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-08-05 11:06:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 552 transitions. [2019-08-05 11:06:14,143 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 552 transitions. Word has length 547 [2019-08-05 11:06:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:14,143 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 552 transitions. [2019-08-05 11:06:14,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:06:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 552 transitions. [2019-08-05 11:06:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-08-05 11:06:14,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:14,146 INFO L399 BasicCegarLoop]: trace histogram [253, 252, 21, 20, 1, 1, 1] [2019-08-05 11:06:14,146 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -261570106, now seen corresponding path program 61 times [2019-08-05 11:06:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:14,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 5817 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:06:14,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 69216 backedges. 736 proven. 65170 refuted. 0 times theorem prover too weak. 3310 trivial. 0 not checked. [2019-08-05 11:06:16,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:06:16,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:06:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:06:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1518, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:06:16,115 INFO L87 Difference]: Start difference. First operand 550 states and 552 transitions. Second operand 46 states. [2019-08-05 11:06:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:23,676 INFO L93 Difference]: Finished difference Result 598 states and 601 transitions. [2019-08-05 11:06:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2019-08-05 11:06:23,677 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 549 [2019-08-05 11:06:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:23,680 INFO L225 Difference]: With dead ends: 598 [2019-08-05 11:06:23,681 INFO L226 Difference]: Without dead ends: 598 [2019-08-05 11:06:23,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48821 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=20215, Invalid=81227, Unknown=0, NotChecked=0, Total=101442 [2019-08-05 11:06:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-08-05 11:06:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-08-05 11:06:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-08-05 11:06:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 599 transitions. [2019-08-05 11:06:23,691 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 599 transitions. Word has length 549 [2019-08-05 11:06:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:23,692 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 599 transitions. [2019-08-05 11:06:23,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:06:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 599 transitions. [2019-08-05 11:06:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-08-05 11:06:23,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:23,695 INFO L399 BasicCegarLoop]: trace histogram [274, 273, 22, 21, 1, 1, 1] [2019-08-05 11:06:23,695 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2095046317, now seen corresponding path program 62 times [2019-08-05 11:06:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:24,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 6273 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:06:24,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 80997 backedges. 66410 proven. 10771 refuted. 0 times theorem prover too weak. 3816 trivial. 0 not checked. [2019-08-05 11:06:25,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:25,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:06:25,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:06:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:06:25,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:06:25,609 INFO L87 Difference]: Start difference. First operand 596 states and 599 transitions. Second operand 45 states. [2019-08-05 11:06:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:26,757 INFO L93 Difference]: Finished difference Result 596 states and 597 transitions. [2019-08-05 11:06:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:06:26,758 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 593 [2019-08-05 11:06:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:26,761 INFO L225 Difference]: With dead ends: 596 [2019-08-05 11:06:26,761 INFO L226 Difference]: Without dead ends: 596 [2019-08-05 11:06:26,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1518, Invalid=2904, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:06:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-08-05 11:06:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-08-05 11:06:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-08-05 11:06:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 597 transitions. [2019-08-05 11:06:26,766 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 597 transitions. Word has length 593 [2019-08-05 11:06:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:26,767 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 597 transitions. [2019-08-05 11:06:26,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:06:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 597 transitions. [2019-08-05 11:06:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2019-08-05 11:06:26,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:26,770 INFO L399 BasicCegarLoop]: trace histogram [275, 274, 22, 21, 1, 1, 1] [2019-08-05 11:06:26,770 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1564872057, now seen corresponding path program 63 times [2019-08-05 11:06:26,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:46,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 6293 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:06:46,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:46,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:46,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:46,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:46,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:46,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:06:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 81566 backedges. 0 proven. 12581 refuted. 0 times theorem prover too weak. 68985 trivial. 0 not checked. [2019-08-05 11:06:47,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:47,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:47,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:47,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:47,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=471, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:47,955 INFO L87 Difference]: Start difference. First operand 596 states and 597 transitions. Second operand 28 states. [2019-08-05 11:06:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:49,698 INFO L93 Difference]: Finished difference Result 602 states and 605 transitions. [2019-08-05 11:06:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:06:49,699 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 595 [2019-08-05 11:06:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:49,702 INFO L225 Difference]: With dead ends: 602 [2019-08-05 11:06:49,702 INFO L226 Difference]: Without dead ends: 602 [2019-08-05 11:06:49,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1011, Invalid=1959, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:06:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-08-05 11:06:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-08-05 11:06:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-08-05 11:06:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 600 transitions. [2019-08-05 11:06:49,706 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 600 transitions. Word has length 595 [2019-08-05 11:06:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:49,707 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 600 transitions. [2019-08-05 11:06:49,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 600 transitions. [2019-08-05 11:06:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-08-05 11:06:49,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:49,710 INFO L399 BasicCegarLoop]: trace histogram [276, 275, 22, 21, 1, 1, 1] [2019-08-05 11:06:49,710 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -603440863, now seen corresponding path program 64 times [2019-08-05 11:06:49,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:50,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 6313 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:06:50,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 82137 backedges. 804 proven. 77539 refuted. 0 times theorem prover too weak. 3794 trivial. 0 not checked. [2019-08-05 11:06:51,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:51,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:06:51,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:06:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:06:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1656, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:06:51,852 INFO L87 Difference]: Start difference. First operand 598 states and 600 transitions. Second operand 48 states. [2019-08-05 11:07:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:00,360 INFO L93 Difference]: Finished difference Result 648 states and 651 transitions. [2019-08-05 11:07:00,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 302 states. [2019-08-05 11:07:00,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 597 [2019-08-05 11:07:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:00,364 INFO L225 Difference]: With dead ends: 648 [2019-08-05 11:07:00,364 INFO L226 Difference]: Without dead ends: 648 [2019-08-05 11:07:00,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57779 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=23480, Invalid=95200, Unknown=0, NotChecked=0, Total=118680 [2019-08-05 11:07:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-08-05 11:07:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2019-08-05 11:07:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-08-05 11:07:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 649 transitions. [2019-08-05 11:07:00,377 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 649 transitions. Word has length 597 [2019-08-05 11:07:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:00,378 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 649 transitions. [2019-08-05 11:07:00,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:07:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 649 transitions. [2019-08-05 11:07:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2019-08-05 11:07:00,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:00,381 INFO L399 BasicCegarLoop]: trace histogram [298, 297, 23, 22, 1, 1, 1] [2019-08-05 11:07:00,381 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1141472286, now seen corresponding path program 65 times [2019-08-05 11:07:00,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:01,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 6789 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:07:01,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 95546 backedges. 78893 proven. 12307 refuted. 0 times theorem prover too weak. 4346 trivial. 0 not checked. [2019-08-05 11:07:02,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:02,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:07:02,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:07:02,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:07:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:07:02,510 INFO L87 Difference]: Start difference. First operand 646 states and 649 transitions. Second operand 47 states. [2019-08-05 11:07:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:03,501 INFO L93 Difference]: Finished difference Result 646 states and 647 transitions. [2019-08-05 11:07:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:07:03,501 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 643 [2019-08-05 11:07:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:03,505 INFO L225 Difference]: With dead ends: 646 [2019-08-05 11:07:03,505 INFO L226 Difference]: Without dead ends: 646 [2019-08-05 11:07:03,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1656, Invalid=3174, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:07:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-08-05 11:07:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-08-05 11:07:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-08-05 11:07:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 647 transitions. [2019-08-05 11:07:03,510 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 647 transitions. Word has length 643 [2019-08-05 11:07:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:03,510 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 647 transitions. [2019-08-05 11:07:03,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:07:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 647 transitions. [2019-08-05 11:07:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-08-05 11:07:03,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:03,514 INFO L399 BasicCegarLoop]: trace histogram [299, 298, 23, 22, 1, 1, 1] [2019-08-05 11:07:03,514 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 975662716, now seen corresponding path program 66 times [2019-08-05 11:07:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown